Timeline for The number of elements with order less than $k$ in a larger cyclic group
Current License: CC BY-SA 4.0
3 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 4, 2020 at 18:39 | comment | added | Marcel K. Goh | @Seva I just came to the realisation that for my problem specifically, I only need very loose bounds, so that would definitely work. However, this is an interesting question in general (perhaps even replacing ${\bf Z}/n{\bf Z}$ with an arbitrary abelian group), and I'd be happy to hear anything that sheds light on it! | |
Dec 4, 2020 at 7:39 | comment | added | Seva | The upper bound $kn^\varepsilon$ is easy; would you be happy with it? It is probably close to what one can prove, anyway. | |
Dec 4, 2020 at 0:13 | history | asked | Marcel K. Goh | CC BY-SA 4.0 |