Timeline for b^(n-1)=-1 mod n
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 9, 2010 at 21:56 | comment | added | Michael Lugo | Nurdin, there are other solutions if you take the brute force a bit further; the first one is at n = 28. See my answer above. | |
| Jan 9, 2010 at 21:34 | comment | added | Nurdin Takenov | Hm, it's obvious that (2k-1,2k) gives a family of silutions, so the only questions remains - are there another solutions? | |
| Jan 9, 2010 at 21:08 | history | answered | Mariano Suárez-Álvarez | CC BY-SA 2.5 |