MathCastle
Proof Writing & Problem SolvingSuperchallenge

Proof Writing & Problem Solving · Superchallenge problem

Define f(1)=1f(1) = 1 and, for n≥1n \ge 1, f(2n)=3f(n)f(2n) = 3f(n) and f(2n+1)=3f(n)+1f(2n + 1) = 3f(n) + 1. How many different positive integers m≤1000m \le 1000 are values of ff?

Practice more like this