TOPICS
Search

Totient Function

Explore TotientFunction on MathWorld


The totient function is a function that gives the number of positive integers less than or equal to a given number that are relatively prime to it.

Totient function is a college-level concept that would be first encountered in a number theory course.

Prerequisites

Divisor: An integer that divides a given integer with no remainder. A synonym for factor.
Greatest Common Divisor: The greatest common divisor of a set of integers is the largest integer that divides all of them.
Relatively Prime: Two or more integers that share no common positive divisors except 1 are said to be relatively prime.

Classroom Articles on Number Theory (Up to College Level)

  • Congruence
    		•
  • Partition
    		•
  • Continued Fraction
    		•
  • Perfect Number
    		•
  • Convergent
    		•
  • Prime Counting Function
    		•
  • Diophantine Equation
    		•
  • Prime Factorization Algorithms
    		•
  • Divisor Function
    		•
  • Prime Number Theorem
    		•
  • Euclidean Algorithm
    		•
  • Quadratic Reciprocity Theorem
    		•
  • Euler-Mascheroni Constant
    		•
  • Squarefree
    		•
  • Fermat's Last Theorem
    		•
  • Transcendental Number
    		•
  • Number Theory
    		•