Timeline for Are there infinite many two sided prime numbers?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 27 at 10:22 | vote | accept | Ali Taghavi | ||
| Sep 25, 2019 at 4:54 | comment | added | Terry Tao | Pretty much any statement of the form "there are infinitely many primes $p$ such that $f(p)$ is also prime" for a given function $f$ is beyond current technology to establish if $f$ is not something totally degenerate (e.g. a constant function or the identity function). The case $f(p)=p+2$ being the most famous, of course. | |
| Sep 24, 2019 at 19:05 | comment | added | LSpice | The word 'decimal' belongs somewhere in this post. | |
| Sep 24, 2019 at 14:32 | history | edited | Denis Serre | CC BY-SA 4.0 |
deleted 3 characters in body; edited title
|
| Sep 24, 2019 at 14:18 | answer | added | Bjørn Kjos-Hanssen | timeline score: 5 | |
| Sep 24, 2019 at 13:02 | comment | added | Wojowu | @SylvainJULIEN Perhaps Zhang et al.'s results on prime constellations might be of use here. I'm thinking of something like, take the set of permutations of some finite string of $k$ digits $N$ and pick out a large admissible tuple out of it. Perhaps the methods can be used to show infinitely many primes are of the form $a10^k+N',a10^k+N''$ for two permutations of $N'.N''$. | |
| Sep 24, 2019 at 12:06 | comment | added | Sylvain JULIEN | More generally, are there infinitely many primes such that at least one non-trivial permutation of their digits preserves the primality? | |
| Sep 24, 2019 at 8:03 | comment | added | Wojowu | @GerryMyerson Good catch, my bad. | |
| Sep 23, 2019 at 23:07 | comment | added | Gerry Myerson | @Wojowu the OEIS reserves the term emirp for primes whose reversal is a different prime, so not including $2,3,5,7,11,101$ and others. oeis.org/A006567 The numbers Ali asks about, OEIS calls reversible primes. oeis.org/A007500 | |
| Sep 23, 2019 at 21:19 | comment | added | Wojowu | Those are called emirps and your question is a (presumably very difficult) open problem. en.wikipedia.org/wiki/Emirp | |
| Sep 23, 2019 at 21:09 | history | asked | Ali Taghavi | CC BY-SA 4.0 |