- In
number theory, Euler's
totient function counts the
positive integers up to a
given integer n that are
relatively prime to n. It is
written using the...
- theory, Euler's
theorem (also
known as the Fermat–Euler
theorem or Euler's
totient theorem)
states that, if n and a are
coprime positive integers, then a...
- A
highly totient number k {\displaystyle k} is an
integer that has more
solutions to the
equation ϕ ( x ) = k {\displaystyle \phi (x)=k} ,
where ϕ {\displaystyle...
- In
number theory, the
totient summatory function Φ ( n ) {\displaystyle \Phi (n)} is a
summatory function of Euler's
totient function defined by: Φ ( n...
- In
number theory, Jordan's
totient function,
denoted as J k ( n ) {\displaystyle J_{k}(n)} ,
where k {\displaystyle k} is a
positive integer, is a function...
- it,
making it a noncototient. 100 has a
reduced totient of 20, and an
Euler totient of 40. A
totient value of 100 is
obtained from four numbers: 101,...
- theory, a
perfect totient number is an
integer that is
equal to the sum of its
iterated totients. That is, one
applies the
totient function to a number...
-
defined it in 1910. It is also
known as Carmichael's λ function, the
reduced totient function, and the
least universal exponent function. The
order of the multiplicative...
-
Unsolved problem in mathematics: Can the
totient function of a
composite number n {\displaystyle n}
divide n − 1 {\displaystyle n-1} ? (more unsolved...
-
parasitic number 103,049 = Schröder–Hipparchus
number 103,680 =
highly totient number 103,769 = the
number of
combinatorial types of 5-dimensional parallelohedra...
