Wieferich primes: Difference between revisions
added RPL
m (→{{header|ALGOL 68}}: Added lib header) |
(added RPL) |
||
| (4 intermediate revisions by 3 users not shown) | |||
Line 544:
1093
3511</pre>
=={{header|EasyLang}}==
{{trans|BASIC256}}
<syntaxhighlight>
fastfunc isprim num .
while i <= sqrt num
return 0
.
return 1
.
func wieferich p .
if isprim p = 0
return 0
.
q = 1
p2 = p * p
while p > 1
p -= 1
.
if q = 1
return 1
.
.
print "Wieferich primes less than 5000: "
for i = 2 to 5000
if wieferich i = 1
print i
.
.
</syntaxhighlight>
{{out}}
<pre>
Wieferich primes less than 5000:
1093
3511
</pre>
=={{header|F_Sharp|F#}}==
Line 953 ⟶ 996:
=={{header|Python}}==
<syntaxhighlight lang="python">
# Wieferich-Primzahlen
MAX: int = 5_000
# Berechnet a^n mod m
def pow_mod(a: int, n: int, m: int) -> int:
assert n >= 0 and m != 0, "pow_mod(a, n, m), n >= 0, m <> 0"
res: int = 1
a %= m
while n > 0:
if n%2:
res = (res*a)%m
n -= 1
else:
a = (a*a)%m
n //= 2
return res%m
def is_prime(n: int) -> bool:
for i in range(2, int(n**0.5) + 1):
if n
return False
return True
def
if
return False
▲ p2 = p ** 2
▲ while p > 1:
▲ q = (2 * q) % p2
▲ p -= 1
▲ if q == 1:
return True
else:
return False
if __name__ == '__main__':
print(f"Wieferich primes less than
for i in range(2,
if
print(i)
</syntaxhighlight>
{{out}}
<pre>Wieferich primes less than 5000:
Line 1,077 ⟶ 1,131:
Found 2 Wieferich primes that are < 5,000
</pre>
=={{header|RPL}}==
{{works with|RPL|HP49-C}}
« { } 2
'''WHILE''' DUP 5000 < '''REPEAT'''
'''IF''' 2 OVER 1 - ^ 1 - OVER SQ MOD NOT '''THEN''' SWAP OVER + SWAP '''END'''
NEXTPRIME
'''END''' DROP
» '<span style="color:blue">TASK</span>' STO
{{out}}
<pre>
1: { 1093 3511 }
</pre>
Line 1,205 ⟶ 1,272:
{{libheader|Wren-math}}
{{libheader|Wren-big}}
<syntaxhighlight lang="
import "./big" for BigInt
var primes = Int.primeSieve(5000)
| |||