Timeline for Smallest solution to $x^2 \equiv x\pmod{n}$
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 20, 2016 at 16:10 | comment | added | Emil Jeřábek | Even without twin primes, there are infinitely many $n$ where the least $x$ is exactly $n/2$: namely, $n=2p$ for $p$ an odd prime (or prime power). However, I thought the question asked for better bounds if there are more prime factors. | |
| Jun 20, 2016 at 15:59 | history | answered | David E Speyer | CC BY-SA 3.0 |