![]() Mov x17,0 // number of identical divisors Ldr x0,qAdrszMessEndPgm // display end message Ldr x0,qAdrszMessStartPgm // display start message * for this file see task include a file in language AArch64 assembly*/ * ARM assembly AARCH64 Raspberry PI 3B */ Note: The program must not be limited by the word size of your computer or some other artificial limit it should work for any number regardless of size (ignoring the physical limits of RAM etc). If you would like to test code from this task, you may use code from trial division or the Sieve of Eratosthenes. Whether a number is prime (note its name before your code). ![]() You may assume that you have a function which determines If your language does not have an isPrime-like function available, Which when all multiplied together, are equal to that number.Įxample 12 = 2 × 2 × 3, so its prime decomposition is greater than 1. The prime decomposition of a number is defined as a list of prime numbers You are encouraged to solve this task according to the task description, using any language you may know.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |