AoPSWiki
Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.

2009 AIME I Problems/Problem 6

From AoPSWiki

Problem

How many positive integers N less than 1000 are there such that the equation x^{\lfloor x\rfloor} = N has a solution for x? (The notation \lfloor x\rfloor denotes the greatest integer that is less than or equal to x.)

Solution

First, x must be less than 5, since otherwise x^{\lfloor x\rfloor} would be at least 3125 which is greater than 1000.

Now, {\lfloor x\rfloor} must be an integer, so lets do case work:

For {\lfloor x\rfloor}=0, N=1 no matter what x is

For {\lfloor x\rfloor}=1, N can be anything between 1^1 to 2^1 excluding 2^1

This gives us 2^1-1^1=1 N's

For {\lfloor x\rfloor}=2, N can be anything between 2^2 to 3^2 excluding 3^2

This gives us 3^2-2^2=5 N's

For {\lfloor x\rfloor}=3, N can be anything between 3^3 to 4^3 excluding 4^3

This gives us 4^3-3^3=37 N's

For {\lfloor x\rfloor}=4, N can be anything between 4^4 to 5^4 excluding 5^4

This gives us 5^4-4^4=369 N's

Since x must be less than 5, we can stop here and the answer answer is 1+5+37+369= \boxed {412}.

See also

2009 AIME I (ProblemsResources)
Preceded by
Problem 5
Followed by
Problem 7
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us