Primitive roots for every admissible integer base
We prove the infinitude assertion in Artin's primitive root conjecture: for every integer a that is neither −1 nor a square, there are at least $c_a x/(\log x)^2$ primes in $(x,2x)$ with primitive root a , for some $c_a\gt 0$ and every sufficiently large x .
Comments and reviews
No comments yet.
Discussed elsewhere
API
curl /api/v1/records/openai-math/Primitive-roots-for-every-admissible-integer-base
curl -X POST /api/v1/records/openai-math/Primitive-roots-for-every-admissible-integer-base/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/openai-math/Primitive-roots-for-every-admissible-integer-base/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'
A Brief Digest of Some New OpenAI Results | Persiflagegaloisrepresentations.orgPersiflage
So again, this is an interesting type of argument which I don’t find particularly surprising. But no one was going to write this paper, which depends on the quasi-Riemann hypothesis for Dirichlet \(L\)-functions, without knowing anything about general Dedekind \(L\)-functions. And this brings us…