In number theory, the Dedekind psi function is the multiplicative function on the positive integers defined by where the product is taken over all primes p dividing n. (By convention, \psi(1), which is the empty product, has value 1.) The function was introduced by Richard Dedekind in connection with modular functions. The value of \psi(n) for the first few integers n is: The function \psi(n) is greater than n for all n greater than 1, and is even for all n greater than 2. If n is a square-free number then, where \sigma(n) is the sum-of-divisors function. The \psi function can also be defined by setting for powers of any prime p, and then extending the definition to all integers by multiplicativity. This also leads to a proof of the generating function in terms of the Riemann zeta function, which is This is also a consequence of the fact that we can write as a Dirichlet convolution of. There is an additive definition of the psi function as well. Quoting from Dickson, R. Dedekind proved that, if n is decomposed in every way into a product ab and if e is the g.c.d. of a, b then where a ranges over all divisors of n and p over the prime divisors of n and \varphi is the totient function.

Higher orders

The generalization to higher orders via ratios of Jordan's totient is with Dirichlet series It is also the Dirichlet convolution of a power and the square of the Möbius function, If is the characteristic function of the squares, another Dirichlet convolution leads to the generalized σ-function,