Wilson primes of order n: Difference between revisions
Added PureBasic, Run BASIC and True BASIC
No edit summary |
(Added PureBasic, Run BASIC and True BASIC) |
||
Line 207:
510 prod = prod-int(prod/p2)*p2
520 return</syntaxhighlight>
==={{header|MSX Basic}}===
Both the [[#GW-BASIC|GW-BASIC]] and [[#Chipmunk_Basic|Chipmunk Basic]] solutions work without change.
==={{header|PureBasic}}===
{{trans|FreeBASIC}}
<syntaxhighlight lang="purebasic">XIncludeFile "isprime.pb"
Procedure.b isWilson(n.i, p.i)
Define prod.f, i.i, p2.f
If p < n : ProcedureReturn #False
EndIf
prod = 1
p2 = p*p
For i = 1 To n-1
prod = Mod((prod*i), p2)
Next i
For i = 1 To p-n
prod = Mod((prod*i), p2)
Next i
prod = Mod((p2 + prod - Pow(-1,n)), p2)
If prod = 0 :
ProcedureReturn #True
Else
ProcedureReturn #False
EndIf
EndProcedure
OpenConsole()
PrintN(" n: Wilson primes")
PrintN("----------------------")
For n.i = 1 To 11
Print(Str(n) + ": ")
For p.i = 3 To 10099 Step 2
If isPrime(p) And isWilson(n, p) :
Print(Str(p) + " ")
EndIf
Next p
PrintN("")
Next n
Input()
CloseConsole()</syntaxhighlight>
==={{header|QBasic}}===
Line 248 ⟶ 292:
END</syntaxhighlight>
==={{header|
{{trans|FreeBASIC}}
<syntaxhighlight lang="vb">function isPrime(n)
if n < 2 then isPrime = 0 : goto [exit]
if n = 2 then isPrime = 1 : goto [exit]
if n mod 2 = 0 then isPrime = 0 : goto [exit]
isPrime = 1
for i = 3 to int(n^.5) step 2
if n mod i = 0 then isPrime = 0 : goto [exit]
next i
[exit]
end function
function isWilson(n, p)
if p < n then isWilson = 0 : goto [exit]
prod = 1
p2 = p^2
for i = 1 to n-1
prod = (prod*i) mod p2
next i
for i = 1 to p-n
prod = (prod*i) mod p2
next i
prod = (p2 + prod - (-1)^n) mod p2
if prod = 0 then isWilson = 1 : goto [exit]
isWilson = 0
[exit]
end function
print " n: Wilson primes"
print "------------------"
for n = 2 to 11
print n;" : ";
for p = 3 to 10499 step 2
if isPrime(p) and isWilson(n, p) then print p; " ";
next p
print
next n
end</syntaxhighlight>
==={{header|True BASIC}}===
{{trans|QBasic}}
<syntaxhighlight lang="qbasic">FUNCTION isPrime(v)
LET FALSE = 0
LET TRUE = 1
IF v <= 1 THEN LET isPrime = FALSE
IF v < 4 THEN LET isPrime = TRUE
IF REMAINDER(v, 2) = 0 THEN LET isPrime = FALSE
IF v < 9 THEN LET isPrime = TRUE
IF REMAINDER(v, 3) = 0 THEN
LET isPrime = FALSE
ELSE
LET r = INT(SQR(v))
LET f = 5
DO WHILE f <= r
IF REMAINDER(v, f) = 0 OR REMAINDER(v, (f+2)) = 0 THEN LET isPrime = FALSE
LET f = f + 6
LOOP
END IF
LET isPrime = TRUE
END FUNCTION
FUNCTION isWilson(n, p)
LET FALSE = 0
LET TRUE = 1
IF p < n THEN LET isWilson = FALSE
LET prod = 1
LET p2 = p^2
FOR i = 1 TO n-1
LET prod = REMAINDER((prod*i), p2)
NEXT i
FOR i = 1 TO p-n
LET prod = REMAINDER((prod*i), p2)
NEXT i
LET prod = REMAINDER((p2+prod-(-1)^n), p2)
IF prod = 0 THEN LET isWilson = TRUE ELSE LET isWilson = FALSE
END FUNCTION
PRINT " n: Wilson primes"
PRINT "----------------------"
FOR n = 1 TO 11
PRINT USING "##: ": n;
FOR p = 3 TO 10099 STEP 2
IF isPrime(p) <> 0 AND isWilson(n, p) <> 0 THEN PRINT p; " ";
NEXT p
PRINT
NEXT n
END</syntaxhighlight>
==={{header|Visual Basic .NET}}===
| |||