The numbers and are a pair of consecutive positive squares whose difference is . How many pairs of consecutive positive perfect squares have a difference of less than or equal to ?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Neighboring squares n squared and (n+1) squared always differ by 2n + 1. So count the values of n that make 2n + 1 at most 2023.
Solution
Start with a few small pairs to see how the differences grow.
- Small cases.
| pair | |||||
|---|---|---|---|---|---|
| difference |
The differences are the odd numbers , going up by each time.
2. The general rule. Call the smaller square , so the next one is . Then
Check: gives and , and . It matches.
3. Set up the condition. We want , so and .
4. Count. The squares must be positive, so starts at . The allowed values are , and each one gives exactly one pair. The last one works: , which is allowed because the problem says "less than or equal".
That is pairs.
The answer is .
Why this works
The gap between neighboring squares is always the odd number , so "the gap is at most " turns into a simple limit on . Naming each pair by one number, its smaller square root , turns "count the pairs" into "count the whole numbers from up to some limit".
The trap
Starting the count at n = 0 (0 is not a positive square) or leaving out the last pair whose difference is exactly 2023, which gives 1012 or 1010.
Concise solution
A pair of consecutive positive squares is and with . Their difference is
We need , i.e. . Each gives exactly one pair (and works since ), so there are pairs.
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 1: Integers: The Basics
- Introduction to Algebra, Chapter 11: Special Factorizations
- Introduction to Algebra, Chapter 20: Special Functions (§20.3)
- Introduction to Algebra, Chapter 10: Quadratic Equations – Part 1 (§10.4)
Techniques
Apply an identity: SFFT, sum of squares, difference of cubes, Vieta · Bound the quantity above/below or estimate to pin it down