Curzon numbers: Difference between revisions
Content deleted Content added
add OCaml |
Python: much faster with modpow |
||
Line 1,198:
=={{header|Python}}==
<syntaxhighlight lang="python">def is_Curzon(n, k):
return pow(k, n, m) + 1 == m
for k in [2, 4, 6, 8, 10]:
| |||