Timeline for Are there infinite many two sided prime numbers?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 27 at 10:22 | vote | accept | Ali Taghavi | ||
| Sep 24, 2019 at 18:48 | history | edited | Bjørn Kjos-Hanssen | CC BY-SA 4.0 |
added 9 characters in body
|
| Sep 24, 2019 at 18:47 | comment | added | Aleksei Kulikov | @SylvainJULIEN I guess I wrote it in my comment -- you don't need anything, there are at most $n^9$ sets of $n$ digits and the number of primes is $\sim 10^n/n$ which is much larger. | |
| Sep 24, 2019 at 18:41 | comment | added | Sylvain JULIEN | Can Maynard's work about primes with missing digits be of any use to show a similar result for base ten? | |
| Sep 24, 2019 at 18:30 | comment | added | Bjørn Kjos-Hanssen | @AlekseiKulikov you are right... fixed now | |
| Sep 24, 2019 at 18:28 | history | edited | Bjørn Kjos-Hanssen | CC BY-SA 4.0 |
deleted 130 characters in body
|
| Sep 24, 2019 at 18:12 | comment | added | Aleksei Kulikov | Sorry, what you did in the second step? Most numbers are not primes as well so it may well be that for primes their digit sums are always very small. In any case you don't need anything like this because there are at most $n$ digit sums and the muber of primes is much, much more (asymptotically $2^n/n$) and this actually works for any base -- there are at most $n^{b-1}$ different sets of digits. | |
| Sep 24, 2019 at 14:18 | history | answered | Bjørn Kjos-Hanssen | CC BY-SA 4.0 |