A note on Ingham's summation method
Abstract Ingham's (nonregular) summation method (I) is closely connected with prime number theory. An easy limitation theorem for (I) (observed by Hardy) is if Σc n is summable (I) then c n = o (loglog n ). We show this result to be best possible.