Difference between revisions of "2008 AIME II Problems/Problem 4"

Revision as of 22:34, 4 July 2013

Problem

There exist $r$ unique nonnegative integers $n_1 > n_2 > \cdots > n_r$ and $r$ unique integers $a_k$ ( $1\le k\le r$ ) with each $a_k$ either $1$ or $- 1$ such that $a_13^{n_1} + a_23^{n_2} + \cdots + a_r3^{n_r} = 2008.$ Find $n_1 + n_2 + \cdots + n_r$ .

Solution

In base $3$ , we find that $\overline{2008}_{10} = \overline{2202101}_{3}$ . In other words,

$2008 = 2 \cdot 3^{6} + 2 \cdot 3^{5} + 2 \cdot 3^3 + 1 \cdot 3^2 + 1 \cdot 3^0$

In order to rewrite as a sum of perfect powers of $3$ , we can use the fact that $2 \cdot 3^k = 3^{k+1} - 3^k$ :

$2008 = (3^7 - 3^6) + (3^6-3^5) + (3^4 - 3^3) + 3^2 + 3^0 = 3^7 - 3^5 + 3^4 - 3^3 + 3^2 + 3^0$

The answer is $7+5+4+3+2+0 = \boxed{021}$ .

Revision as of 10:33, 8 June 2008 (view source) Jvenezuela716 (talk \| contribs) m ← Older edit		Revision as of 22:34, 4 July 2013 (view source) Nathan wailes (talk \| contribs) Newer edit →
Line 17:		Line 17:

	[[Category:Intermediate Number Theory Problems]]		[[Category:Intermediate Number Theory Problems]]
		+	{{MAA Notice}}

2008 AIME II (Problems • Answer Key • Resources)
Preceded by Problem 3	Followed by Problem 5
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

Page

Toolbox

Search

Difference between revisions of "2008 AIME II Problems/Problem 4"

Revision as of 22:34, 4 July 2013

Problem

Solution

See also