Let n be a natural number. Prove that [n1]+[n2]+[n3]+......[nn]+[√n] is even.
(Here [x] denotes the largest integer smaller than or equal to x)
Open in App
Solution
Let f(n) denotes the given equation. Then f(1)=2 which is even. Now suppose that f(n) is even for some n≥1. Then, f(n+1)=[n+11]+[n+12]+[n+13]+......[n+1n+1]+[√n+1]=[n1]+[n2]+[n3]+[nn]+[√n+1]+σ(n+1), where σ(n+1) denotes the number of positive divisors of n+1. This follows from [n+1k]=[nk]+1 if k divides n+1, and [n+1k]=[nk] otherwise. Note that [√n+1]=[√n] unless n+1 is a square, in which case [√n+1]=[√n]+1. On the other hand σ(n+1) is odd if and only if n+1 is a square. Therefore it follows that f(n+1)=f(n)+2l for some integer l. ∴f(n+1) is even. Thus it follows by induction that f(n) is even for all natural number n.