Numbers whose count of divisors is prime: Difference between revisions
Content added Content deleted
m (→{{header|Phix}}: use pygments, added faster version to 4e9) |
m (→smarter, faster: extended desc) |
||
| Line 1,472: | Line 1,472: | ||
</pre> |
</pre> |
||
=== smarter, faster === |
=== smarter, faster === |
||
As per Nigel's analysis on the talk page |
As per Nigel's analysis on the talk page, valid numbers must be of the form a^(b-1) where a is prime and b is an odd prime, with no further checking required. |
||
<syntaxhighlight lang="phix"> |
<syntaxhighlight lang="phix"> |
||
atom t1 = time() |
atom t1 = time() |
||