Timeline for Generating prime numbers
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 12, 2015 at 21:47 | comment | added | Gerry Myerson | @Woj, yes, it's known for $a=3/2$ and $a=4/3$, due to Forman and Shapiro, An arithmetic property of certain rational powers, Communications on Pure and Applied Mathematics Volume 20, Issue 3, pages 561–573, August 1967. More recently, there is work by Dubickas and by Novikas. See mathoverflow.net/questions/153426/… for some discussion. | |
| Dec 12, 2015 at 21:23 | comment | added | Wojowu | @GerryMyerson Is it known that we get infinitely many composites for $[a^n]$ for some rational, non-integer $a$? I suspect no, but I'm quite curious. | |
| Dec 12, 2015 at 12:09 | comment | added | Gerry Myerson | I doubt it, but it's hard to prove anything. I think it's unknown whether, say, $[(8/7)^n]$ is composite infinitely often. | |
| Dec 12, 2015 at 8:27 | history | asked | alex alexeq | CC BY-SA 3.0 |