RosettaCodeData/Task/Prime-decomposition/Logo/prime-decomposition.logo
2023-07-01 13:44:08 -04:00

5 lines
163 B
Text

to decompose :n [:p 2]
if :p*:p > :n [output (list :n)]
if less? 0 modulo :n :p [output (decompose :n bitor 1 :p+1)]
output fput :p (decompose :n/:p :p)
end