Totative
In number theory, a totative of a given positive integer n is an integer k such that 0 < k ≤ n and k is coprime to n. Euler's totient function φ(n) counts the number of totatives of n. The totatives under multiplication modulo n form the multiplicative group of integers modulo n.
Distribution
The distribution of totatives has been a subject of study. Paul Erdős conjectured that, writing the totatives of n as
the mean square gap satisfies
for some constant C, and this was proven by Bob Vaughan and Hugh Montgomery.[1]
gollark: It's a shame it doesn't have a physical keyboard, but for "relatively open thing which can browse the interweb and send SMS/make calls" it does seem pretty good.
gollark: Cool, a pinephone channel.
gollark: Furnaces 0 to 1, smelt clay to bricks.
gollark: Mines 0 to 3, ACTIVATE FUEL PRODUCTION! It has been over 2 hours.
gollark: Furnaces 0 and 1, ACTIVATE (conversion of clay to brick)
See also
References
- Montgomery, H.L.; Vaughan, R.C. (1986). "On the distribution of reduced residues". Ann. Math. 2. 123: 311–333. doi:10.2307/1971274. Zbl 0591.10042.
- Guy, Richard K. (2004). Unsolved problems in number theory (3rd ed.). Springer-Verlag. B40. ISBN 978-0-387-20860-2. Zbl 1058.11001.
Further reading
- Sándor, Jozsef; Crstici, Borislav (2004), Handbook of number theory II, Dordrecht: Kluwer Academic, pp. 242–250, ISBN 1-4020-2546-7, Zbl 1079.11001
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.