2008 AIME I Problems/Problem 7

Revision as of 12:45, 23 March 2008 by Azjps (talk | contribs) (solution by samath)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $S_i$ be the set of all integers $n$ such that $100i\leq n < 100(i + 1)$. For example, $S_4$ is the set ${400,401,402,\ldots,499}$. How many of the sets $S_0, S_1, S_2, \ldots, S_{999}$ do not contain a perfect square?

Solution

The difference between consecutive squares is \[(x + 1)^2 - x^2 = 2x + 1\] which means that all squares above $50^2 = 2500$ are more than 100 apart. Then the first 25 sets ($S_1,\cdots S_{25}$) each have one perfect square. Also, since $316^2 < 10000 < 317^2$, there are $316 - 50 = 266$ other sets after $S_{25}$ that have a square. Then there are $1000 - 266 - 26 = 708$ without a perfect square.

See also

2008 AIME I (ProblemsAnswer KeyResources)
Preceded by
Problem 6
Followed by
Problem 8
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions