Divisor-square summatory bound
ID: divisor-square-summatory-bound
For , the divisor function obeysOne proof compares it with the generalized divisor function , the number of ordered factorizations into four positive integers. At a prime power , the two counts are and . The inequality holds for every nonnegative integer , and multiplicativity gives . Hence, with the harmonic number,Applying partial summation to this upper bound also yields
New to topics? Read the docs here!