Miller–Rabin primality test: Difference between revisions

m
→‎{{header|Sidef}}: minor simplifications
(added FreeBASIC)
m (→‎{{header|Sidef}}: minor simplifications)
Line 3,828:
 
=={{header|Sidef}}==
<lang ruby>func is_prime(n { .is_odd && (_ > 2) }, k) {
 
var s = 0
var dn == n.dec2 && return true
(dn >><= 1; ++s)&& whilereturn d.is_evenfalse
n %% 2 && return false
 
var sd = 0n-1
var s = valuation(d, 2)
d >>= s
 
k.times {
Line 3,840 ⟶ 3,845:
(s-1).times {
x.expmod!(2, n)
return false if x.is_one==1
break if (x == n-1)
}
Line 3,849 ⟶ 3,854:
}
 
funcsay(^1000->grep {|n| is_prime((2)n, _k10) { true }.join(', '))</lang>
func is_prime(_n, _k) { false }
 
say 1000.range.grep {|n| is_prime(n, 10) }.join(", ")</lang>
 
=={{header|Smalltalk}}==
2,747

edits