Timeline for Density of a set of numbers dividing a fixed number with polynomial exponent
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 23, 2019 at 15:30 | vote | accept | hookah | ||
| Feb 22, 2019 at 21:48 | answer | added | Fedor Petrov | timeline score: 2 | |
| Feb 22, 2019 at 19:18 | comment | added | Greg Martin | Possible strategy: (1) for a typical prime $p$, most arithmetic progressions modulo $p$ contain only integers $n$ for which $p\nmid f(n)$; (2) most integers in any such arithmetic progression have the property that $p$ divides the order of $a$ modulo $n$. Then an ad-hoc density bound, or indeed the large sieve, should give a nontrivial upper bound on the density of $S$. There should be some examples in the literature about integers $n$ for which $n \mid (a^n-1)$. | |
| Feb 22, 2019 at 18:24 | history | asked | hookah | CC BY-SA 4.0 |