This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Suppose that f : N → N is injective. For any N ∈ N , suppose that { f ( 1 ) , f ( 2 ) , . . . , f ( N ) } = { a 1 , a 2 , . . . , a N } , where a 1 < a 2 < ⋯ < a N . By the Rearrangement Lemma, n = 1 ∑ N n 2 f ( n ) ≥ n = 1 ∑ N n 2 a n Since a 1 < a 2 < ⋯ < a N , we deduce that a n ≥ n for 1 ≤ n ≤ N , and hence n = 1 ∑ N n 2 f ( n ) ≥ n = 1 ∑ N n 2 a n ≥ n = 1 ∑ N n 2 n and hence n = 1 ∑ N n 2 f ( n ) > ln N N ∈ N which means that the infinite series ∑ n = 1 ∞ n 2 f ( n ) diverges.