MathDB
Problems
Contests
National and Regional Contests
USA Contests
USA - College-Hosted Events
Harvard-MIT Mathematics Tournament
2013 Harvard-MIT Mathematics Tournament
21
21
Part of
2013 Harvard-MIT Mathematics Tournament
Problems
(1)
2013 HMMT Guts #21: Summation of Powers of 3
Source:
3/26/2013
Find the number of positive integers
j
≤
3
2013
j\leq 3^{2013}
j
≤
3
2013
such that
j
=
∑
k
=
0
m
(
(
−
1
)
k
⋅
3
a
k
)
j=\sum_{k=0}^m\left((-1)^k\cdot 3^{a_k}\right)
j
=
k
=
0
∑
m
(
(
−
1
)
k
⋅
3
a
k
)
for some strictly increasing sequence of nonnegative integers
{
a
k
}
\{a_k\}
{
a
k
}
. For example, we may write
3
=
3
1
3=3^1
3
=
3
1
and
55
=
3
0
−
3
3
+
3
4
55=3^0-3^3+3^4
55
=
3
0
−
3
3
+
3
4
, but
4
4
4
cannot be written in this form.
HMMT