Timeline for Find the least prime so that p-1 has two factors greater than $m$ and $n$
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 4, 2011 at 18:49 | comment | added | Gerhard Paseman | Although Linnik's theorem and related heuristics does not apply directly, one can consider a "path" composed of two arithmetic sequences from mn+1 to (m+i)(n+j) + 1, and perhaps come up with a better upper bound like 4mn for the value of p(mn). Gerhard "Asl Me About System Design" Paseman, 2011.10.04 | |
| Oct 4, 2011 at 18:43 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |