Timeline for Achieving consecutive integers as norms from a quadratic field
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 21, 2013 at 1:15 | comment | added | Lucia | It's a little easier than Hardy-Littlewood since one has to sieve just half the primes out. But in practice it seems equally impossible! | |
| Aug 21, 2013 at 0:03 | comment | added | David E Speyer | Thanks! Do you think this is actually as hard as Hardy-Littlewood? "Is a norm from $K$" is more common than "is prime" and I had the idea this would make it easier to sieve for. But my knowledge of sieve methods is essentially nonexistent. | |
| Aug 21, 2013 at 0:01 | vote | accept | David E Speyer | ||
| Aug 20, 2013 at 23:33 | history | answered | Lucia | CC BY-SA 3.0 |