RosettaCodeData/Task/Prime-decomposition/EasyLang/prime-decomposition.easy
2024-10-16 18:07:41 -07:00

16 lines
267 B
Text

func[] decompose num .
t = 2
while t * t <= num
if num mod t = 0
primes[] &= t
num = num / t
else
t += 1
.
.
primes[] &= num
return primes[]
.
for v in [ 27 1232125 9007199254740991 ]
print decompose v
.