Trisha Shetty (Editor)

Totative

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In number theory, a totative of a given positive integer n is an integer k such that 0 < kn 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

0 < a 1 < a 2 < a ϕ ( n ) < n ,

the mean square gap satisfies

i = 1 ϕ ( n ) 1 ( a i + 1 a i ) 2 < C n 2 / ϕ ( n )

for some constant C and this was proved by Bob Vaughan and Hugh Montgomery.

References

Totative Wikipedia