Difference between revisions of "2009 AIME I Problems/Problem 6"
m |
m (→Solution) |
||
Line 28: | Line 28: | ||
Since <math>x</math> must be less than <math>5</math>, we can stop here and the answer is <math>1+5+37+369= \boxed {412}</math> possible values for <math>N</math>. | Since <math>x</math> must be less than <math>5</math>, we can stop here and the answer is <math>1+5+37+369= \boxed {412}</math> possible values for <math>N</math>. | ||
− | Alternatively, one could find that the values which work are <math>1^1,\ 2^2,\ 3^3,\ 4^4,\ \sqrt{5}^{\lfloor\sqrt{5}\rfloor},\ \sqrt{6}^{\lfloor\sqrt{6}\rfloor},\ \sqrt{7}^{\lfloor\sqrt{7}\rfloor},\ \sqrt{8}^{\lfloor\sqrt{8}\rfloor},\ \sqrt[3]{28}^{\lfloor\sqrt[3]{28}\rfloor},\ \sqrt[3]{29}^{\lfloor\sqrt[3]{29}\rfloor},\ \sqrt[3]{30}^{\lfloor\sqrt[3]{30}\rfloor},\ ...,\ \sqrt[3]{63}^{\lfloor\sqrt[3]{63}\rfloor},\ \sqrt[4]{257}^{\lfloor\sqrt[4]{257}\rfloor},\ \sqrt[4]{258}^{\lfloor\sqrt[4]{258}\rfloor},\ ...,\ \sqrt[4]{624}^{\lfloor\sqrt[4]{624}\rfloor}</math> to get the same answer. | + | Alternatively, one could find that the values which work are <math>1^1,\ 2^2,\ 3^3,\ 4^4,\ \sqrt{5}^{\lfloor\sqrt{5}\rfloor},\ \sqrt{6}^{\lfloor\sqrt{6}\rfloor},\ \sqrt{7}^{\lfloor\sqrt{7}\rfloor},\ \sqrt{8}^{\lfloor\sqrt{8}\rfloor},\ \sqrt[3]{28}^{\lfloor\sqrt[3]{28}\rfloor},\ \sqrt[3]{29}^{\lfloor\sqrt[3]{29}\rfloor},\ \sqrt[3]{30}^{\lfloor\sqrt[3]{30}\rfloor},\ ...,</math> |
+ | <math>\ \sqrt[3]{63}^{\lfloor\sqrt[3]{63}\rfloor},\ \sqrt[4]{257}^{\lfloor\sqrt[4]{257}\rfloor},\ \sqrt[4]{258}^{\lfloor\sqrt[4]{258}\rfloor},\ ...,\ \sqrt[4]{624}^{\lfloor\sqrt[4]{624}\rfloor}</math> to get the same answer. | ||
==Solution 2== | ==Solution 2== |
Revision as of 03:28, 14 February 2021
Contents
Problem
How many positive integers less than are there such that the equation has a solution for ?
Solution
First, must be less than , since otherwise would be at least which is greater than .
Because must be an integer, let’s do case work based on :
For , as long as . This gives us value of .
For , can be anything between to excluding
Therefore, . However, we got in case 1 so it got counted twice.
For , can be anything between to excluding
This gives us 's
For , can be anything between to excluding
This gives us 's
For , can be anything between to excluding
This gives us 's
Since must be less than , we can stop here and the answer is possible values for .
Alternatively, one could find that the values which work are to get the same answer.
Solution 2
For a positive integer , we find the number of positive integers such that has a solution with . Then , and because , we have , and because is an integer, we get . The number of possible values of is equal to the number of integers between and inclusive, which is equal to the larger number minus the smaller number plus one or , and this is equal to . If , the value of exceeds , so we only need to consider . The requested number of values of is the same as the number of values of , which is .
Video Solutions
Video Solution 1
Mostly the above solution explained on video: https://www.youtube.com/watch?v=2Xzjh6ae0MU&t=11s
~IceMatrix
Video Solution 2
~Shreyas S
Video Solution 3
Projective Solution: https://youtu.be/fUef_tVnM5M
~Shreyas S
See also
2009 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 5 |
Followed by Problem 7 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.