Curzon numbers: Difference between revisions
m
do one addition less
(→{{header|Ruby}}: Switched to modular pow like Python) |
m (do one addition less) |
||
Line 267:
#include <vector>
if (mod == 1)
return 0;
Line 281:
bool is_curzon(uint64_t n, uint64_t k) {
const uint64_t
return modpow(k, n,
}
Line 1,064:
let is_curzon k n =
let
let () =
Line 1,198:
=={{header|Python}}==
<syntaxhighlight lang="python">def is_Curzon(n, k):
return pow(k, n,
for k in [2, 4, 6, 8, 10]:
Line 1,210:
for i, c in enumerate(curzons[:50]):
print(f'{c: 5,}', end='\n' if (i + 1) % 25 == 0 else '')
print(f' Thousandth Curzon with k = {k}: {curzons[999]}.\n')</syntaxhighlight>
<pre>
Curzon numbers with k = 2:
Line 1,357:
Enumerator.new do |y|
(1..).each do |n|
y << n if k.pow(n,
end
end
| |||