MathDB
Problems
Contests
National and Regional Contests
USA Contests
USA - College-Hosted Events
Stanford Mathematics Tournament
2009 Stanford Mathematics Tournament
4
SMT 2009 Team 4
SMT 2009 Team 4
Source:
December 27, 2011
Problem Statement
How many ways are there to write
657
657
657
as a sum of powers of two where each power of two is used at most twice in the sum? For example,
256
+
256
+
128
+
16
+
1
256+256+128+16+1
256
+
256
+
128
+
16
+
1
is a valid sum.
Back to Problems
View on AoPS