返回题库

AIME 2013 II · 第 6 题

AIME 2013 II — Problem 6

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem 6

Find the least positive integer NN such that the set of 10001000 consecutive integers beginning with 1000N1000\cdot N contains no square of an integer.

解析

Solutions

Solution 1

The difference between consecutive integral squares must be greater than 1000. (x+1)2x21000(x+1)^2-x^2\geq1000, so x9992    x500x\geq\frac{999}{2}\implies x\geq500. x=500x=500 does not work, so x>500x>500. Let n=x500n=x-500. By inspection, n2n^2 should end in a number close to but less than 1000 such that there exists 1000N1000N within the difference of the two squares. Examine when n2=1000n^2=1000. Then, n=1010n=10\sqrt{10}. One example way to estimate 10\sqrt{10} follows.

$3^2=9$, so $10=(x+3)^2=x^2+6x+9$. $x^2$ is small, so $10=6x+9$. $x=1/6\implies \sqrt{10}\approx 19/6$. This is 3.16.

Then, n31.6n\approx 31.6. n2<1000n^2<1000, so nn could be 3131. Add 500 to get the first square and 501 to get the second. Then, the two integral squares are 5312531^2 and 5322532^2. Checking, 5312=281961531^2=281961 and 5322=283024532^2=283024. 282,000282,000 straddles the two squares, which have a difference of 1063. The difference has been minimized, so NN is minimized N=282000    282N=282000\implies\boxed{282}

~BJHHar

Solution 2

Let us first observe the difference between x2x^2 and (x+1)2(x+1)^2, for any arbitrary x0x\ge 0. (x+1)2x2=2x+1(x+1)^2-x^2=2x+1. So that means for every x0x\ge 0, the difference between that square and the next square have a difference of 2x+12x+1. Now, we need to find an xx such that 2x+110002x+1\ge 1000. Solving gives x9992x\ge \frac{999}{2}, so x500x\ge 500. Now we need to find what range of numbers has to be square-free: N000N999\overline{N000}\rightarrow \overline{N999} have to all be square-free. Let us first plug in a few values of xx to see if we can figure anything out. x=500x=500, x2=250000x^2=250000, and (x+1)2=251001(x+1)^2=251001. Notice that this does not fit the criteria, because 250000250000 is a square, whereas N000\overline{N000} cannot be a square. This means, we must find a square, such that the last 33 digits are close to 10001000, but not there, such as 961961 or 974974. Now, the best we can do is to keep on listing squares until we hit one that fits. We do not need to solve for each square: remember that the difference between consecutive squares are 2x+12x+1, so all we need to do is addition. After making a list, we find that 5312=281961531^2=281961, while 5322=283024532^2=283024. It skipped 282000282000, so our answer is 282\boxed{282}.

Solution 3

Let xx be the number being squared. Based on the reasoning above, we know that NN must be at least 250250, so xx has to be at least 500500. Let kk be x500x-500. We can write x2x^2 as (500+k)2(500+k)^2, or 250000+1000k+k2250000+1000k+k^2. We can disregard 250000250000 and 1000k1000k, since they won't affect the last three digits, which determines if there are any squares between N000N999\overline{N000}\rightarrow \overline{N999}. So we must find a square, k2k^2, such that it is under 10001000, but the next square is over 10001000. We find that k=31k=31 gives k2=961k^2=961, and so (k+1)2=322=1024(k+1)^2=32^2=1024. We can be sure that this skips a thousand because the 1000k1000k increments it up 10001000 each time. Now we can solve for xx: (500+31)2=281961(500+31)^2=281961, while (500+32)2=283024(500+32)^2=283024. We skipped 282000282000, so the answer is 282\boxed{282}.

Solution 4

The goal is to find the least NNN \in \mathbb{N} such that mN\exists m \in \mathbb{N} where m2+11000N,1000N+1000(m+1)2m^2 + 1 \leq 1000N, 1000N + 1000 \leq (m+1)^2.

Combining the two inequalities leads to (m+1)2m2+1001,m500(m+1)^2 \geq m^2 + 1001, m \geq 500.

Let m=k+500m = k + 500, where kWk \in \mathbb{W}, then the inequalities become,

N(k+500)2+11000=k2+11000+k+250N \geq \frac{(k+500)^2 + 1}{1000} = \frac{k^2 + 1}{1000} + k + 250, and

N(k+501)210001=(k+1)21000+k+250.N \leq \frac{(k+501)^2}{1000} - 1 = \frac{(k+1)^2}{1000} + k + 250.

For k=31k=31, one can verify that N=282N = 282 is the unique integer satisfying the inequalities.

For k30k \leq 30, k+250<k2+11000+k+250Nk + 250 < \frac{k^2 + 1}{1000} + k + 250 \leq N (k+1)21000+k+250(30+1)21000+k+250<k+251\leq \frac{(k+1)^2}{1000} + k + 250 \leq \frac{(30+1)^2}{1000} + k + 250 < k + 251,

i.e., k+250<N<k+251k + 250 < N < k + 251, a contradiction.

Note k32k \geq 32 leads to larger NN(s).

Hence, the answer is 282\boxed{282}.

~yuxiaomatt

Video Solution

https://youtu.be/Rjx-0hAfQ6E?si=sr0N7dWeMg1jH5Bq

~MathProblemSolvingSkills.com