Timeline for Distinctive property of the primes 17 and 19?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 25, 2013 at 3:02 | review | First posts | |||
| Jun 25, 2013 at 10:37 | |||||
| May 28, 2013 at 6:27 | comment | added | Gerhard Paseman | One passably clever speedup would memoize mod p the results of $m^m$ and $n^n$ to aid in calculating $mn^{mn}$, but I don't see it reducing the exponent on the runtime. Gerhard "Has Not Thought It Through" Paseman, 2013.05.27 | |
| May 28, 2013 at 3:15 | comment | added | Noam D. Elkies | Testing up to $N$ takes time proportional to $N^2$ (the sum mod $p$ is a sum of $p$ terms, each of which takes about $\log p$ operations mod $p$, and there are $N/\log N$ terms to try. So going from $10^5$ to $5 \cdot 10^8$ would multiply the computing time not by $500$ but by about a quarter-million, unless there's some clever speedup I'm not seeing to a smaller power than $N^2$. | |
| May 28, 2013 at 3:03 | history | answered | none | CC BY-SA 3.0 |