Timeline for Prepending strings to primes.
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 2, 2011 at 17:44 | vote | accept | Dedalus | ||
| Jan 2, 2011 at 17:44 | history | bounty ended | Dedalus | ||
| Dec 30, 2010 at 18:09 | comment | added | Zsbán Ambrus | Similarly, you don't need B < R because you can just start from a late enough term of the sequence and take that (padded with some zeros) as B instead. | |
| Dec 28, 2010 at 10:40 | history | edited | Pete L. Clark | CC BY-SA 2.5 |
corrected spelling of Ziegler
|
| Dec 21, 2010 at 20:28 | comment | added | David E Speyer | Oh, right. Better to start with p a prime factor of $A 10^k+B$ and then modify the argument accordingly. | |
| Dec 21, 2010 at 20:10 | comment | added | Kevin O'Bryant | In comment (1), you still haven't eliminated $B=00\cdots01$, as then $B$ does not have any prime factors. | |
| Dec 21, 2010 at 19:16 | history | answered | David E Speyer | CC BY-SA 2.5 |