Method line M6 · When and why do we use it?

Bounding

In the Chinese book: 放缩

Cannot compute it? Squeeze it between bounds until only a few integers fit.

📖 §1.6 of 《解题方法与策略》

One idea, one pictureDrag n. Is the number in the middle ever exactly a square? Then look at n = 0.

Loading figure…

In one sentence

Some quantities are hard to work out exactly, but you can squeeze them between two quantities that are easy to compute. With real numbers, squeezing only tells you “roughly”; with integers, a tight enough squeeze tells you “exactly”. There is no square between two consecutive squares, and between and there is only .

Example: n is a positive integer. Can n² + n + 1 be a perfect square?

Step 1 / 6
Loading figure…
  1. Try one

    : , which lies between and .

Predict first

Positive integers satisfy . What is the largest possible value of ?

Choose an answer first; then you can see the result.

Stop 1 · Integer solutions of equations (Vol. 2)

Example: find all positive integers x ≤ y ≤ z with 1/x + 1/y + 1/z = 1

Step 1 / 6
Loading figure…
  1. x cannot be too big

    Try : none of the three fractions is more than , so together they are at most , which never reaches . So .

Stop 2 · Maxima and minima of quadratic functions (Vol. 3)

After completing the square, throwing away a non-negative square is the simplest kind of bounding: .

Example: two positive numbers add up to 4. What is the largest their product can be?

Step 1 / 4
Loading figure…
  1. Use one letter

    Let one number be ; the other is (). The product is .

Stop 3 · Diophantine equations (Vol. 6)

When the squeezed range does contain squares, bounding turns the equation into a few linear equations.

Example: find positive integers x, y with y² = x² + x + 7

Step 1 / 5
Loading figure…
  1. Lower bound

    is clearly bigger than .

Stop 4 · Extremal problems in combinatorics (Vol. 7)

“What is the most you can place?” is also answered by squeezing: an argument presses down from above (it cannot be more than this), and a construction pushes up from below (this many really can be done). Where the two meet is the answer.

Example: place pieces on a 5×5 board so that no two are in cells sharing a side. What is the most you can place?

Step 1 / 4
Loading figure…
  1. Try it yourself

    Tap cells to place pieces; two neighboring cells (sharing a side) cannot both have one. How many can you place?

Practice

Exercise 1Basic

Positive integers satisfy . How many such pairs are there?

Exercise 2Advanced

is a positive integer and is a perfect square. Find .

Exercise 3Challenge

Positive integers satisfy . Find .

Mistake Museum · Exhibits from this stop

Before you leave, look at the traps other people fell into here.See every exhibit in the museum →

Exhibit

Bounding too generously

The wrong step: To prove : since , the left side is . Done.
What went wrong? Think first, then open

Diagnosis What you proved is “less than ”, but the problem asks for “less than ”. is bigger than , so this bound is too loose and proves nothing. The trouble is the first term: enlarging to throws away in one go.

The right step: Keep the first term as it is and start bounding from the second: the left side is .

“If a bound is too loose, bound fewer terms”

Exhibit

Forgetting the small cases the bounds do not cover

The wrong step: Since , is not a perfect square for any non-negative integer .
What went wrong? Think first, then open

Diagnosis The right-hand inequality is equivalent to . When , , so it is not squeezed at all, and is in fact a perfect square.

The right step: For it lies strictly between two consecutive squares, so it is not a square; check separately: it gives .

“Use an inequality only from where it starts to hold”

Stops on this line

The same idea, used once in each of several places.

  1. Integer Solutions of EquationsVol. 2 Equations and Systems of Equations, ch. 15
  2. Maxima and Minima of FunctionsVol. 3 Linear and Quadratic Functions, ch. 5
  3. Common Methods for Diophantine EquationsVol. 6 Divisibility, Congruences and Diophantine Equations, §3.2
  4. Extremal Problems in CombinatoricsVol. 7 Fun Problems in Combinatorics, ch. 5