Difference between revisions of "1997 IMO Problems/Problem 6"
(Created page with "==Problem== For each positive integer <math>n</math>, let <math>f(n)</math> denote the number of ways of representing <math>n</math> as a sum of powers of <math>2</math> with...") |
(→Solution) |
||
| Line 11: | Line 11: | ||
==Solution== | ==Solution== | ||
{{solution}} | {{solution}} | ||
| + | |||
| + | ==See Also== | ||
| + | |||
| + | {{IMO box|year=1997|num-b=5|after=Last Question}} | ||
| + | [[Category:Olympiad Geometry Problems]] | ||
| + | [[Category:3D Geometry Problems]] | ||
Latest revision as of 00:02, 17 November 2023
Problem
For each positive integer 
, let 
denote the number of ways of representing as a sum of powers of 
with nonnegative integer exponents. Representations which differ only in the ordering of their summands are considered to be the same. For instance, 
, because the number 4 can be represented in the following four ways:
Prove that, for any integer 
,
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 1997 IMO (Problems) • Resources | ||
| Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Last Question |
| All IMO Problems and Solutions | ||
