Totative

From testwiki
Revision as of 10:55, 17 October 2024 by imported>Citation bot (Add: jstor, issue, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Modular arithmetic | #UCB_Category 36/62)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description In number theory, a totative of a given positive integer Template:Mvar is an integer Template:Mvar such that Template:Math and Template:Mvar is coprime to Template:Mvar. 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

0<a1<a2<aϕ(n)<n,

the mean square gap satisfies

i=1ϕ(n)1(ai+1ai)2<Cn2/ϕ(n)

for some constant C, and this was proven by Bob Vaughan and Hugh Montgomery.[1]

See also

References

Template:Reflist

Further reading


Template:Numtheory-stub