Weighted dilation graphs, smooth shifted primes and totient fibers
We prove Erdős's conjecture on the largest fibers of Euler's totient function: for every ε > 0, infinitely many positive integers n have more than $n^{1-\varepsilon }$ preimages. We also show that, for every fixed δ > 0, there are at least $x^{1-o(1)}$ primes p in $2x\lt p\le5x$ whose predecessors have no prime factor exceeding x δ .
Comments and reviews
No comments yet.
API
curl /api/v1/records/openai-math/Weighted-Dilation-Graphs-Smooth-Shifted-Primes-and-Totient-Fibers
curl -X POST /api/v1/records/openai-math/Weighted-Dilation-Graphs-Smooth-Shifted-Primes-and-Totient-Fibers/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/openai-math/Weighted-Dilation-Graphs-Smooth-Shifted-Primes-and-Totient-Fibers/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'