Timeline for Which integer polynomials represent fewer primes, in terms of order of magnitude, when shifted by a constant integer?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 22, 2022 at 8:14 | history | edited | CommunityBot |
replaced http://www.math.uga.edu/~pete with http://alpha.math.uga.edu/~pete
|
|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Dec 7, 2012 at 0:06 | history | edited | Timothy Foo | CC BY-SA 3.0 |
elaborated on second question
|
| Dec 5, 2012 at 7:39 | history | edited | Timothy Foo | CC BY-SA 3.0 |
improved the condition
|
| Dec 4, 2012 at 1:22 | history | edited | Timothy Foo | CC BY-SA 3.0 |
fixed latex
|
| Dec 3, 2012 at 9:27 | comment | added | Timothy Foo | Hi @js, and thanks for your comment. It indeed seems elusive. And from the comments in the first question linked to here, it seems that even the question of which integers are represented by multivariate polynomials is not all that straightforward... | |
| Dec 3, 2012 at 7:43 | comment | added | js21 | If one believes the Bateman-Horn Conjecture, this phenomenon is specific to multivariate polynomials. On the other hand, even an appropriate conjecture in the multivariate case remains elusive (as far as I know). | |
| Dec 3, 2012 at 6:41 | history | asked | Timothy Foo | CC BY-SA 3.0 |