In number theory, the totient summatory function is a summatory function of Euler's totient function defined by

It is the number of ordered pairs of coprime integers (p,q), where 1 ≤ pqn.

The first few values are 0, 1, 2, 4, 6, 10, 12, 18, 22, 28, 32, ... (sequence A002088 in the OEIS). Values for powers of 10 are 1, 32, 3044, 304192, 30397486, 3039650754, ... (sequence A064018 in the OEIS).

Properties

edit

The following identity holds for all real :

.

This gives an implicit recurrence for the totient summatory function.[1]: 138 

Applying Möbius inversion to the totient function or the above identity yields

where is the Möbius function. Then it can be shown that Φ(n) has the asymptotic expansion

where ζ(2) is the Riemann zeta function evaluated at 2, which is .[1]: 462–463 [2]

Reciprocal totient summatory function

edit

The summatory function of the reciprocal of the totient is

Edmund Landau showed in 1900 that this function has the asymptotic behavior[3]

where γ is the Euler–Mascheroni constant,

and

The constant A = 1.943596... is sometimes known as Landau's totient constant. The sum converges to

In this case, the product over the primes in the right side is a constant known as the totient summatory constant,[4] and its value is

See also

edit

References

edit
  1. ^ a b Graham, Ronald L.; Knuth, Donald E.; Patashnik, Oren. Concrete Mathematics (2 ed.). Addison-Wesley. ISBN 0-201-55802-5.
  2. ^ Weisstein, Eric W., "Riemann Zeta Function \zeta(2)", MathWorld
  3. ^ Landau, E. (1900), "Ueber die zahlentheoretische Funktion und ihre Beziehung zum Goldbachschen Satz", Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse, 1900: 177–186
  4. ^ OEISA065483
edit


📚 Artikel Terkait di Wikipedia

Euler's totient function

Multiplicative group of integers modulo n Ramanujan sum Totient summatory function (𝛷) "Euler's totient function". Khan Academy. Retrieved 2016-02-26. Long (1972

Arithmetic function

summation function for large x. A classical example of this phenomenon is given by the divisor summatory function, the summation function of d(n), the

32 (number)

{\displaystyle p^{5}} where p {\displaystyle p} is prime. 32 is the totient summatory function Φ ( n ) {\displaystyle \Phi (n)} over the first 10 integers, and

Divisor function

related function is the divisor summatory function, which, as the name implies, is a sum over the divisor function. The sum of positive divisors function σz(n)

Mertens function

is the totient summatory function. Neither of the methods mentioned previously leads to practical algorithms to calculate the Mertens function. Using

Prime omega function

formulas more generally for the related summatory functions over so-termed factorial moments of the function ω ( n ) {\displaystyle \omega (n)} . A known

Average order of an arithmetic function

(f)=q^{2n}(1-q^{-1}).} Divisor summatory function Normal order of an arithmetic function Extremal orders of an arithmetic function Divisor sum identities Hardy

Extremal orders of an arithmetic function

ln n / ln 2 It is conjectured that the Mertens function, or summatory function of the Möbius function, satisfies lim sup n → ∞ | M ( x ) | x = + ∞ , {\displaystyle