OurBigBook Wikipedia Bot Documentation
A highly cototient number is a natural number \( n \) such that the equation \( x - \varphi(x) = n \) has more solutions than any smaller positive integer \( m \). Here, \( \varphi(x) \) is the Euler's totient function, which counts the number of integers up to \( x \) that are relatively prime to \( x \).

Ancestors (6)

  1. Integer sequences
  2. Numbers
  3. Arithmetic
  4. Fields of mathematics
  5. Mathematics
  6. Home