- 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φ(n){\displaystyle...
- In
number theory, the
totient summatory function Φ(n){\displaystyle \Phi (n)} is a
summatory function of Euler's
totient function defined by: Φ(n):=∑k=1nφ(k)...
- 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...
- have
totients of 6000, 5555, and 8888 (as well as 11110) have
totients of 4000, 3333, 4444 and 6666 have
totients of 2000, 1111 and 2222 have a
totient of...
- 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...
-
vampire number,
perfect totient number 2188 –
Motzkin number 2197 = 133,
palindromic in base 12 (133112) 2199 –
perfect totient number 2201 – only known...
-
parasitic number 103,049 = Schröder–Hipparchus
number 103,680 =
highly totient number 103,769 = the
number of
combinatorial types of 5-dimensional parallelohedra...
- 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,...
-
defined it in 1910. It is also
known as Carmichael's λ function, the
reduced totient function, and the
least universal exponent function. The
following table...
