Factors of a Mersenne number: Difference between revisions

m
(Added Arturo implementation)
Line 401:
 
<lang rebol>mersenneFactors: function [q][
if not? prime? q -> returnprint ø"number not prime!"
r: new q
while -> r > 0
Line 418:
else -> break
]
print ["2 ^" q "- 1 = 0 ( mod" d ")"]
return d
]
 
print ["2 ^ 929 - 1 = 0 ( mod" mersenneFactors 929 ")"]</lang>
 
{{out}}
1,532

edits