Timeline for A limit concerning prime numbers
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 7, 2013 at 10:04 | comment | added | Will Sawin | The same reasoning works for anything that is $1$ mod $p$. For other things, you can ignore the powers that are not $1$ mod $p$, which means you can assume $n$ is a multiple of the least $k$ such that $r^k\equiv 1$ mod $p$, but then you can just replace $r$ with $r^k$. | |
| Jul 7, 2013 at 5:12 | comment | added | Igor Rivin | Since $r$ is a fixed prime power, it is unlikely to be $p+1$... | |
| Jul 6, 2013 at 23:00 | comment | added | Will Sawin | Ah then this follows from what I wrote - since the $p$-part is $O(n)$, the non-$p$-part increases exponentially. | |
| Jul 6, 2013 at 22:57 | comment | added | Uep | I used $p'$ to mean the set of primes not equal $p$. Sorry for the confusion. | |
| Jul 6, 2013 at 21:59 | history | answered | Will Sawin | CC BY-SA 3.0 |