21 lines
883 B
Text
21 lines
883 B
Text
;Task:
|
|
Write a program which counts up from '''1''', displaying each number as the multiplication of its prime factors.
|
|
|
|
For the purpose of this task, '''1''' (unity) may be shown as itself.
|
|
|
|
|
|
;Example:
|
|
'''2''' is prime, so it would be shown as itself.
|
|
<br> '''6''' is not prime; it would be shown as '''<math>2\times3</math>.'''
|
|
<br>'''2144''' is not prime; it would be shown as '''<math>2\times2\times2\times2\times2\times67</math>.'''
|
|
|
|
|
|
;Related tasks:
|
|
* [[prime decomposition]]
|
|
* [[factors of an integer]]
|
|
* [[Sieve of Eratosthenes]]
|
|
* [[primality by trial division]]
|
|
* [[factors of a Mersenne number]]
|
|
* [[trial factoring of a Mersenne number]]
|
|
* [[partition an integer X into N primes]]
|
|
<br><br>
|