Wieferich primes: Difference between revisions
Content added Content deleted
m (add the Prime Numbers category.) |
(add PicoLisp) |
||
Line 566: | Line 566: | ||
<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"Weiferich primes less than 5000: %V\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">filter</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">get_primes_le</span><span style="color: #0000FF;">(</span><span style="color: #000000;">5000</span><span style="color: #0000FF;">),</span><span style="color: #000000;">weiferich</span><span style="color: #0000FF;">)})</span> |
<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"Weiferich primes less than 5000: %V\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">filter</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">get_primes_le</span><span style="color: #0000FF;">(</span><span style="color: #000000;">5000</span><span style="color: #0000FF;">),</span><span style="color: #000000;">weiferich</span><span style="color: #0000FF;">)})</span> |
||
<!--</lang>--> |
<!--</lang>--> |
||
=={{header|PicoLisp}}== |
|||
<lang PicoLisp>(de **Mod (X Y N) |
|||
(let M 1 |
|||
(loop |
|||
(when (bit? 1 Y) |
|||
(setq M (% (* M X) N)) ) |
|||
(T (=0 (setq Y (>> 1 Y))) |
|||
M ) |
|||
(setq X (% (* X X) N)) ) ) ) |
|||
(let (D 2 L (1 2 2 . (4 2 4 2 4 6 2 6 .))) |
|||
(until (> D 5000) |
|||
(and |
|||
(=1 (**Mod 2 (dec D) (* D D))) |
|||
(println D) ) |
|||
(inc 'D (++ L)) ) )</lang> |
|||
{{out}} |
|||
<pre> |
|||
1093 |
|||
3511 |
|||
</pre> |
|||
=={{header|Quackery}}== |
=={{header|Quackery}}== |