Jump to content

Primality by trial division: Difference between revisions

Primality by trial division (view source)

Revision as of 19:19, 6 April 2010

16 bytes removed ,  14 years ago
→‎{{header|Scheme}}: Simplified.
(Added an ActionScript version.)
(→‎{{header|Scheme}}: Simplified.)
Line 626:
 
=={{header|Scheme}}==
{{Works with|Scheme|R<math>^5</math>RS}}
<lang scheme>(define (is-prime? xnumber)
(cond ((< x 2) #f)
(define ((= x 2)*prime? #tdivisor)
(or ((zero?> (remainder* xdivisor 2)divisor) #fnumber)
(elseand (> (modulo number divisor) 0)
(let loop (*prime? (c+ divisor 31)))))
(condand ((> (* c c) x)number #t1)
((zero*prime? (remainder x c2)) #f)</lang>
(else (loop (+ c 2))))))))</lang>
 
=={{header|Standard ML}}==
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/45742"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information