Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2002 AIME II Problems/Problem 5"

(Added problem, solution still needed)
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
−
Find the sum of all positive integers <math>a=2^n3^m</math> where <math>n</math> and <math>m</math> are non-negative integers, for which <math>a^6</math> is not a divisor of <math>6^a</math>.
+
Find the sum of all positive integers <math>a=2^n3^m</math> where <math>n</math> and <math>m</math> are non-negative integers, for which <math>a^6</math> is not a divisor of <math>6^a</math>
  
 
== Solution ==
 
== Solution ==
−
{{solution}}
+
Substitute <math>a=2^n3^m</math> into <math>a^6</math> and <math>6^a</math>, and find all pairs of non-negative integers (n,m) for which <math>(2^n3^m)^{6}</math> is not a divisor of <math>6^{2^n3^m</math>
 +
 
 +
Simplifying both expressions:
 +
 
 +
<math>2^{6n} \cdot 3^{6m}</math> is not a divisor of <math>2^{2^n3^m} \cdot 3^{2^n3^m}</math>
 +
 
 +
Comparing both exponents (noting that there must be either extra powers of 2 or extra powers of 3 in the left expression):
 +
 
 +
<math>6n > 2^n3^m</math>  OR  <math>6m > 2^n3^m</math>
 +
 
 +
 
 +
Using the first inequality <math>6n > 2^n3^m</math> and going case by case starting with n <math>\in</math> {0, 1, 2, 3...}:
 +
 
 +
n=0:
 +
<math>0>1 \cdot 3^m</math> which has no solution for non-negative integers m
 +
 
 +
n=1:
 +
<math>6 > 2 \cdot 3^m</math> which is true for m=0 but fails for higher integers <math>\Rightarrow (1,0)</math>
 +
 
 +
n=2:
 +
<math>12 > 4 \cdot 3^m</math> which is true for m=0 but fails for higher integers <math>\Rightarrow (2,0)</math>
 +
 
 +
n=3:
 +
<math>18 > 8 \cdot 3^m</math> which is true for m=0 but fails for higher integers <math>\Rightarrow (3,0)</math>
 +
 
 +
n=4:
 +
<math>24 > 16 \cdot 3^m</math> which is true for m=0 but fails for higher integers <math>\Rightarrow (4,0)</math>
 +
 
 +
n=5:
 +
<math>30 > 32 \cdot 3^m</math> which has no solution for non-negative integers m
 +
 
 +
There are no more solutions for higher <math>n</math>, as polynomials like <math>6n</math> grow slower than exponentials like <math>2^n</math>.
 +
 
 +
 
 +
 
 +
Using the second inequality <math>6m > 2^n3^m</math> and going case by case starting with m <math>\in</math> {0, 1, 2, 3...}:
 +
 
 +
m=0:
 +
<math>0>2^n \cdot 1</math> which has no solution for non-negative integers n
 +
 
 +
m=1:
 +
<math>6>2^n \cdot 3</math> which is true for n=0 but fails for higher integers <math>\Rightarrow (0,1)</math>
 +
 
 +
m=2:
 +
<math>12>2^n \cdot 9</math> which is true for n=0 but fails for higher integers <math>\Rightarrow (0,2)</math>
 +
 
 +
m=3:
 +
<math>18>2^n \cdot 27</math> which has no solution for non-negative integers n
 +
 
 +
There are no more solutions for higher <math>m</math>, as polynomials like <math>6m</math> grow slower than exponentials like <math>3^m</math>.
 +
 
 +
 
 +
Thus there ae six numbers corresponding to (1,0), (2,0), (3,0), (4,0), (0,1), and (0,2). 
 +
Plugging them back into the original expression, these numbers are 2, 4, 8, 16, 3, and 9, respectively.  Their sum is <math>042</math>.
  
 
== See also ==
 
== See also ==
−
{{AIME box|year=2002|n=II|num-b=4|num-a=6}}
+
{{AIME box|year=
 +
2002|n=II|num-b=4|num-a=6}}

Revision as of 22:18, 14 December 2008

Problem

Find the sum of all positive integers $a=2^n3^m$ where $n$ and $m$ are non-negative integers, for which $a^6$ is not a divisor of $6^a$

Solution

Substitute $a=2^n3^m$ into $a^6$ and $6^a$, and find all pairs of non-negative integers (n,m) for which $(2^n3^m)^{6}$ is not a divisor of $6^{2^n3^m$ (Error compiling LaTeX. Unknown error_msg)

Simplifying both expressions:

$2^{6n} \cdot 3^{6m}$ is not a divisor of $2^{2^n3^m} \cdot 3^{2^n3^m}$

Comparing both exponents (noting that there must be either extra powers of 2 or extra powers of 3 in the left expression):

$6n > 2^n3^m$ OR $6m > 2^n3^m$


Using the first inequality $6n > 2^n3^m$ and going case by case starting with n $\in$ {0, 1, 2, 3...}:

n=0: $0>1 \cdot 3^m$ which has no solution for non-negative integers m

n=1: $6 > 2 \cdot 3^m$ which is true for m=0 but fails for higher integers $\Rightarrow (1,0)$

n=2: $12 > 4 \cdot 3^m$ which is true for m=0 but fails for higher integers $\Rightarrow (2,0)$

n=3: $18 > 8 \cdot 3^m$ which is true for m=0 but fails for higher integers $\Rightarrow (3,0)$

n=4: $24 > 16 \cdot 3^m$ which is true for m=0 but fails for higher integers $\Rightarrow (4,0)$

n=5: $30 > 32 \cdot 3^m$ which has no solution for non-negative integers m

There are no more solutions for higher $n$, as polynomials like $6n$ grow slower than exponentials like $2^n$.


Using the second inequality $6m > 2^n3^m$ and going case by case starting with m $\in$ {0, 1, 2, 3...}:

m=0: $0>2^n \cdot 1$ which has no solution for non-negative integers n

m=1: $6>2^n \cdot 3$ which is true for n=0 but fails for higher integers $\Rightarrow (0,1)$

m=2: $12>2^n \cdot 9$ which is true for n=0 but fails for higher integers $\Rightarrow (0,2)$

m=3: $18>2^n \cdot 27$ which has no solution for non-negative integers n

There are no more solutions for higher $m$, as polynomials like $6m$ grow slower than exponentials like $3^m$.


Thus there ae six numbers corresponding to (1,0), (2,0), (3,0), (4,0), (0,1), and (0,2). Plugging them back into the original expression, these numbers are 2, 4, 8, 16, 3, and 9, respectively. Their sum is $042$.

See also

2002 AIME II (Problems • Answer Key • Resources)
Preceded by
Problem 4 		Followed by
Problem 6
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2002_AIME_II_Problems/Problem_5&oldid=28603"