Timeline for On the number of values with exactly $k$ prime factors of a given polynomial
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 16 at 8:05 | comment | added | Paul Cusson | (I should correct myself, for degree $d$ irreducible polynomials, from what you said all we can conclude is that there is some $k$ between $1$ and $d+1$ that occurs infinitely many times.) | |
| Jan 16 at 7:57 | comment | added | Stanley Yao Xiao | I believe the best way to describe this behaviour is the following paper due to Friedlander and Iwaniec: Asymptotic sieve for primes (jstor.org/stable/121035) | |
| Jan 16 at 7:26 | vote | accept | Paul Cusson | ||
| Jan 16 at 7:26 | comment | added | Paul Cusson | Thanks for the answer, and sorry for the very late response. I'll accept this answer since, if I understand correctly, at least for degree $d$ irreducible polynomials, there does exist such a $k$, namely $d+1$. As I do not work in analytic number theory, and I cannot find information about "Type II information" online, could you point me to a reference to this? | |
| Oct 31, 2023 at 22:36 | history | answered | Stanley Yao Xiao | CC BY-SA 4.0 |