Timeline for how to prove a conjecture on a "canonical equivalent" of factoring
Current License: CC BY-SA 3.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 13, 2013 at 2:23 | comment | added | Paul Tarau | @Gerhard Paseman: Thanks for noticing that - I added the term I was implicitely assuming - the prduct of the primes p_i, which is clearly larger than the product of their positions in the sequence of primes. | |
May 13, 2013 at 2:20 | history | edited | Paul Tarau | CC BY-SA 3.0 |
fixed typo
|
May 13, 2013 at 0:49 | comment | added | Gerhard Paseman | Why do you have equality in your last step? Shouldn't the product be $(n+1)/q_0$? Gerhard "Ask Me About System Design" Paseman, 2013.05.12 | |
May 12, 2013 at 19:56 | history | answered | Paul Tarau | CC BY-SA 3.0 |