Timeline for Primes $p$ for which $pk+1$ is prime for small $k$ (or approximating Sophie Germain)
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 23, 2020 at 9:22 | comment | added | Đào Thanh Oai | @DavidEppstein I am Dao Thanh Oai, Long time I belive you have pair eye for geometry. But I think You are admin of en.wiki but You don't have your pair eye for geometry. Because, you see that I promostion, but You don't see that the theorem I proposed to you are very nice and have some valid source. | |
| Aug 12, 2014 at 20:49 | comment | added | David Eppstein | In case anyone is curious what this was for: see arxiv.org/abs/1408.1422. The largest prime factor of another prime provides a lower bound on degree (as a function of graph size) for finding an exact solution to certain graph-drawing problems by iterated polynomial root-finding methods. | |
| Jan 12, 2014 at 7:55 | vote | accept | David Eppstein | ||
| Nov 23, 2013 at 15:04 | comment | added | Tom Leinster | Peripheral to the question, but why do people say "Sophie Germain primes" instead of just "Germain primes"? We don't say "Pierre de Fermat primes" or "Marin Mersenne primes", and there's been no other famous mathematician called Germain, as far as I know. If it's some outdated convention based on gender, isn't it time we abandoned it? | |
| Nov 23, 2013 at 13:25 | answer | added | Mark Lewko | timeline score: 4 | |
| Nov 23, 2013 at 8:54 | answer | added | user5810 | timeline score: 5 | |
| Nov 23, 2013 at 8:00 | history | asked | David Eppstein | CC BY-SA 3.0 |