Timeline for Prove that $\frac{2^n-2}{n}$ is composite number
Current License: CC BY-SA 4.0
15 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 27, 2022 at 11:20 | vote | accept | math110 | ||
S Sep 26, 2021 at 14:02 | history | bounty ended | CommunityBot | ||
S Sep 26, 2021 at 14:02 | history | notice removed | CommunityBot | ||
Sep 18, 2021 at 13:18 | comment | added | math110 | I want to konw have paper reseach this problem? | |
Sep 18, 2021 at 13:14 | comment | added | Carlo Beenakker | what is the purpose of this bounty? | |
S Sep 18, 2021 at 12:50 | history | bounty started | math110 | ||
S Sep 18, 2021 at 12:50 | history | notice added | math110 | Authoritative reference needed | |
Sep 15, 2021 at 15:38 | comment | added | Christian Bernert | Also, strictly speaking you are missing out on the case $n=3$ so the correct condition should be $n \ge 4$. | |
Sep 15, 2021 at 15:36 | comment | added | Christian Bernert | This happens to be a problem from an high-school olympiad in China, just a few days ago: artofproblemsolving.com/community/c6h2669914. I'd be surprised to find that this is a coincidence... ;) | |
Sep 15, 2021 at 14:52 | history | edited | math110 | CC BY-SA 4.0 |
added 2 characters in body
|
Sep 15, 2021 at 10:02 | comment | added | Peter Taylor | Since my earlier comment implicitly making this point has been deleted, I will note explicitly that $n=2$ is an exception, because $\frac{2^2 - 2}{2} = 1$ is not composite. | |
Sep 15, 2021 at 9:14 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
minor typos
|
Sep 15, 2021 at 8:28 | answer | added | Fedor Petrov | timeline score: 17 | |
Sep 15, 2021 at 8:21 | review | Close votes | |||
Sep 18, 2021 at 12:57 | |||||
Sep 15, 2021 at 7:52 | history | asked | math110 | CC BY-SA 4.0 |