返回题库

AIME 2009 I · 第 6 题

AIME 2009 I — Problem 6

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

How many positive integers NN less than 10001000 are there such that the equation xx=Nx^{\lfloor x\rfloor} = N has a solution for xx?

解析

Solution 1

First, xx must be less than 55, since otherwise xxx^{\lfloor x\rfloor} would be at least 31253125 which is greater than 10001000.

Because x{\lfloor x\rfloor} must be an integer, let’s do case work based on x{\lfloor x\rfloor}:

For x=0{\lfloor x\rfloor}=0, N=1N=1 as long as x0x \neq 0. This gives us 11 value of NN.

For x=1{\lfloor x\rfloor}=1, NN can be anything between 111^1 to 212^1 excluding 212^1

Therefore, N=1N=1. However, we got N=1N=1 in case 1 so it got counted twice.

For x=2{\lfloor x\rfloor}=2, NN can be anything between 222^2 to 323^2 excluding 323^2

This gives us 3222=53^2-2^2=5 NN's

For x=3{\lfloor x\rfloor}=3, NN can be anything between 333^3 to 434^3 excluding 434^3

This gives us 4333=374^3-3^3=37 NN's

For x=4{\lfloor x\rfloor}=4, NN can be anything between 444^4 to 545^4 excluding 545^4

This gives us 5444=3695^4-4^4=369 NN's

Since xx must be less than 55, we can stop here and the answer is 1+5+37+369=4121+5+37+369= \boxed {412} possible values for NN.

Alternatively, one could find that the values which work are 11, 22, 33, 44, 55, 66, 77, 88, 283283, 293293, 303303, ...,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},\ ...,  633633, 25742574, 25842584, ..., 62446244\ \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} to get the same answer.

Solution 2

For a positive integer kk, we find the number of positive integers NN such that xx=Nx^{\lfloor x\rfloor}=N has a solution with x=k{\lfloor x\rfloor}=k. Then x=Nkx=\sqrt[k]{N}, and because kx<k+1k \le x < k+1, we have kkxk<(k+1)kk^k \le x^k < (k+1)^k, and because (k+1)k(k+1)^k is an integer, we get kkxk(k+1)k1k^k \le x^k \le (k+1)^k-1. The number of possible values of xkx^k is equal to the number of integers between kkk^k and (k+1)k1(k+1)^k-1 inclusive, which is equal to the larger number minus the smaller number plus one or ((k+1)k1)(kk)+1((k+1)^k-1)-(k^k)+1, and this is equal to (k+1)kkk(k+1)^k-k^k. If k>4k>4, the value of xkx^k exceeds 10001000, so we only need to consider k4k \le 4. The requested number of values of NN is the same as the number of values of xkx^k, which is k=14[(k+1)kkk]=21+94+6427+625256=412\sum^{4}_{k=1} [(k+1)^k-k^k]=2-1+9-4+64-27+625-256=\boxed{412}.

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

https://youtu.be/kALrIDMR0dg

~Shreyas S

Video Solution 3

Projective Solution: https://youtu.be/fUef_tVnM5M

~Shreyas S