STAGE PS 3.1 · 8 PRACTICE PROBLEMS · 2 NEW-CONTEXT APPLICATIONS
Rule Out a Possibility
Useful preparation: Patterns and Induction
Goal: Understand and apply rule out a possibility.
Before you begin: Patterns and Induction
Understand the idea
A remainder classification can disprove a claim without finding the alleged object. Every integer is congruent to zero, one or two modulo three, so its square has only two possible residues.
Choose and carry out a method
Square each residue class. Compare the proposed total with the resulting list; a residue of two cannot be a square.
Check the reasoning
Passing this test does not prove a number is a square. It is a necessary condition used to rule out impossible cases.
An integer N equals 5. What is its remainder modulo 3? Explain to yourself why this rules out N being a perfect square; enter the remainder only.
- Classify all integer inputs by their remainder modulo 3.
- 0²≡0, 1²≡1 and 2²≡1 modulo 3; 5≡2.
- The remainder is 2. A square cannot have this residue.
2
An integer N equals 8. What is its remainder modulo 3? Explain to yourself why this rules out N being a perfect square; enter the remainder only.
- Classify all integer inputs by their remainder modulo 3.
- 0²≡0, 1²≡1 and 2²≡1 modulo 3; 8≡2.
- The remainder is 2. A square cannot have this residue.
2
Common pitfalls
Possible mix-up: Remainder one guarantees a square.
It passes one necessary test but does not establish squareness.
Possible mix-up: A correct numerical answer alone explains the method.
State the governing relationship and check the conditions described above.
Explain it to yourself
Find a nonsquare that still has remainder one modulo three.
Preview the eight practice prompts
- An integer N equals 14. What is its remainder modulo 3? Explain to yourself why this rules out N being a perfect square; enter the remainder only.
- An integer N equals 17. What is its remainder modulo 3? Explain to yourself why this rules out N being a perfect square; enter the remainder only.
- An integer N equals 20. What is its remainder modulo 3? Explain to yourself why this rules out N being a perfect square; enter the remainder only.
- An integer N equals 23. What is its remainder modulo 3? Explain to yourself why this rules out N being a perfect square; enter the remainder only.
- An integer N equals 26. What is its remainder modulo 3? Explain to yourself why this rules out N being a perfect square; enter the remainder only.
- An integer N equals 29. What is its remainder modulo 3? Explain to yourself why this rules out N being a perfect square; enter the remainder only.
- A square array is claimed to contain exactly 32 dots. What is the total’s remainder modulo 3, which shows that an integer-sided square array is impossible? New context
- A square array is claimed to contain exactly 35 dots. What is the total’s remainder modulo 3, which shows that an integer-sided square array is impossible? New context

