Timeline for For which values of $k$ is it known that there are infinitely many $n$, such that $2^{n+k}\equiv 1\pmod{n}$?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 23, 2017 at 15:18 | vote | accept | Konstantinos Gaitanas | ||
| Dec 19, 2017 at 22:13 | comment | added | GH from MO | Any $k\geq 1$ works, see my proof below. | |
| Dec 19, 2017 at 22:13 | history | edited | GH from MO |
edited tags
|
|
| Dec 19, 2017 at 21:50 | answer | added | GH from MO | timeline score: 10 | |
| Dec 19, 2017 at 18:20 | answer | added | Henri Cohen | timeline score: 8 | |
| Dec 19, 2017 at 18:13 | comment | added | Henri Cohen | I believe any odd $k$ works, but I don't have a reference nor a proof at hand. | |
| Dec 19, 2017 at 10:10 | history | asked | Konstantinos Gaitanas | CC BY-SA 3.0 |