John R Ramsden
|
Registered User
|
|
|
May 11 |
comment |
Trying to solve: Show that n does not divide 3^n - 2^n for n greater than or equal to 2. That argument works, but with mod $p$, where $p$ is the smallest prime dividing $n$ |
|
May 11 |
awarded | ● Critic |
|
Apr 26 |
revised |
Is rigour just a ritual that most mathematicians wish to get rid of if they could? Fixed ArXiv link |
|
Apr 15 |
awarded | ● Nice Answer |
|
Feb 3 |
comment |
Modular Forms - Eichler quote Can someone briefly explain why this was marked down? (N.B. I'm not disputing the reason one way or another, just curious) |
|
Dec 2 |
revised |
An undergraduate’s guide to the foundational theorems of logic Fixed another link |
