PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: Very high
totative (Definition)

Given a positive integer $ n$, an integer $ 0 < m < n$ is a totative of $ n$ if $ \gcd(m, n) = 1$. Put another way, all the smaller integers than $ n$ that are coprime to $ n$ are totatives of $ n$.

For example, the totatives of 21 are 1, 2, 4, 5, 8, 10, 11, 13, 16, 17, 19 and 20.

The count of totatives of $ n$ is Euler's totient function $ \phi(n)$. The set of totatives of $ n$ forms a reduced residue system modulo $ n$. The word “totative” was coined by James Joseph Sylvester, who also coined “totient” (though despite occasional usage in some papers and books, the term “totative” has not caught on the way “totient” has).



"totative" is owned by CompositeFan.
(view preamble)

View style:

See Also: residue systems


Attachments:
every positive integer greater than 30 has at least one composite totative (Result) by mps
relationship between totatives and divisors (Theorem) by Wkbj79
Log in to rate this entry.
(view current ratings)

Cross-references: term, James Joseph Sylvester, reduced residue system, Euler's totient function, coprime, integer, positive
There are 4 references to this entry.

This is version 6 of totative, born on 2007-04-23, modified 2007-05-08.
Object id is 9246, canonical name is Totative.
Accessed 870 times total.

Classification:
AMS MSC11A25 (Number theory :: Elementary number theory :: Arithmetic functions; related numbers; inversion formulas)

Pending Errata and Addenda
None.
[ View all 5 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)