# Greatest odd divisor function problem [closed]

Show that where $f(n)$ denotes the greatest odd divisor of a positive integer $n$, $f(n+1)+f(n+2)+...+f(2n)=n^2$.

edit: This post has been solved:

Merely induct on n, and you will find that as f(2n+1)=2n+1, we get (n+1)^2=n^2+2n+1 which is clearly true for all n. See solution below.

## closed as off-topic by mfl, I am Back, Carl Schildkraut, Namaste, Brevan EllefsenOct 11 '17 at 2:34

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – mfl, I am Back, Carl Schildkraut, Namaste, Brevan Ellefsen
If this question can be reworded to fit the rules in the help center, please edit the question.

• This is a pretty nice property. Absolutely not trivial... – Raffaele Oct 10 '17 at 20:56
• I first attempted to do casework based on whether n was even or odd. This didn't get me very far though. – mathcounter Oct 10 '17 at 21:14

Induction: $n = 1$ is easy; both sides are equal to $1$.
Suppose true for some $n > 0$. Now we prove for $n + 1$: $$f(n+2) + \dots + f(2n) + f(2n + 1) + f(2n + 2) = f(n+1) + f(n+2) + \dots + f(2n) + (2n+1).$$ Here I've used $f(2n+2) = f(2(n+1)) = f(n+1)$ and $f(2n+1) = 2n + 1$.
Now the RHS of the indented equation is, by inductive hypothesis, $n^2 + (2n + 1) = (n+1)^2$, as required.