Mathematical reasoning in an examination works by turning a result into an argument another person can inspect. A maths exam may ask you to explain why a method works, justify a conclusion, prove a statement, show that a result follows, compare two strategies, identify an assumption or decide whether a claim is always true. In these questions, a correct number can be only part of the required answer.
Understanding how to show mathematical reasoning, justify answers and write proofs improves algebra, geometry, number, probability, statistics, functions and problem solving because the same discipline appears everywhere: state what is known, make a valid transition, preserve the conditions and say exactly what the conclusion establishes. This is the examination craft behind phrases such as “show that,” “prove,” “explain,” “justify” and “give a reason.”
This world-facing guide extends How Mathematics Examination Works and its companion on maths word problems and multi-step questions. It uses original examples and the fictional eduKateSG residents Adrian, Jo, Ben, Aisha, Ryan, Mira, Clara and Ethan. For subject knowledge, use the Mathematics Learning Hub and Additional Mathematics Hub.
The 50-second answer
CLAIM → GIVEN FACTS → VALID RELATIONSHIP → LOGICAL STEPS → CONDITIONS → CONCLUSION → CHECK THE SCOPE.
1. Reasoning is the bridge between a fact and a conclusion
Ben writes, “x = 7.” Adrian asks, “Why?” Ben points to the previous line, 3x + 2 = 23. Subtracting two gives 3x = 21; dividing by three gives x = 7. In a routine equation, those algebraic transitions may be enough. In a proof or explanation question, the required bridge may need to be stated more explicitly. The amount of writing changes with the task, but the underlying responsibility does not: each conclusion must follow from something that has been established.
2. A reason is not the same as a restatement
“The angles are equal because they are the same” adds no evidence. “The angles are equal because they are opposite equal sides in an isosceles triangle” identifies the relationship that justifies equality. A mathematical reason should narrow the gap between what is known and what is claimed.
3. Examples can suggest; proofs establish
Testing 3², 5² and 7² shows three odd squares that are odd. It does not establish that every odd integer has an odd square. Writing an arbitrary odd integer as 2k+1 and expanding its square can establish the general claim. Examples are valuable for exploration and checking; their logical job differs from a proof.
4. One counterexample can destroy a universal claim
If a statement says every object of a certain kind has a property, one permitted object without that property is enough to refute it. The response should identify both sides of the contradiction: the example satisfies the stated conditions but fails the claimed conclusion. A bare number may leave the reader to reconstruct why it matters.
5. “Show that” supplies the destination, not the route
When a question supplies a result and asks you to show it, the supplied result cannot simply be copied as an assumption. You may work backwards privately to discover a route, but the submitted reasoning should establish the result from acceptable starting information. The destination helps you navigate; it does not remove the need for the journey.
6. Conditions travel with the theorem
Pythagoras requires a right triangle. Equal base angles require the relevant isosceles condition. Cancelling a denominator requires that the cancelled expression is non-zero. Taking a real logarithm requires a positive argument. Mathematical reasoning is not only remembering conclusions; it is remembering when those conclusions are permitted.
7. Necessary and sufficient are different directions
If a number is divisible by four, it is even. Being even is therefore necessary for divisibility by four, but it is not sufficient: six is even and not divisible by four. Many examination arguments fail because a one-way implication is silently used backwards. Ask whether the theorem says “if A then B,” “if and only if,” or something weaker.
8. Algebra can preserve truth or introduce candidates
Squaring both sides of an equation can produce candidates that do not satisfy the original equation. Dividing by an unknown expression can remove a case where that expression is zero. A reasoning-aware solution notices which transformations are reversible and which require later checking.
9. Scope words control how strong the conclusion may be
Every, some, at least one, exactly, for all real x, for positive integers and in this sample are not decorative phrases. They define the domain of the claim. A proof over positive integers cannot silently become a proof over all real numbers. A statistical observation about a sample cannot automatically become a statement about every member of a population.
10. Good mathematical writing is compressed logic
A strong examination explanation is not necessarily long. It contains the necessary facts, relationships and conclusion with little ambiguity. “AB = AC, so ∠ABC = ∠BCA because base angles in an isosceles triangle are equal” can do more work than a paragraph of vague narration. Precision, not length, is the aim.
Part II. Fifty forms of mathematical reasoning
11. Direct algebraic proof
In direct algebraic proof, the core move is to represent a general object symbolically and transform it to the required form. The proof or justification is successful only when the representation covers the stated domain. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is using a few numerical examples as the proof. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
12. Proof by cases
In proof by cases, the core move is to divide the domain into exhaustive possibilities and prove the claim in each. The proof or justification is successful only when the cases cover every permitted possibility. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is forgetting a case or using overlapping cases unclearly. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
13. Counterexample
In counterexample, the core move is to find one permitted instance that contradicts a universal conclusion. The proof or justification is successful only when the example satisfies every hypothesis. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is giving an example that falls outside the claim’s conditions. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
14. Contradiction
In contradiction, the core move is to assume the negation of the desired conclusion and derive an impossibility. The proof or justification is successful only when the contradiction genuinely follows from the assumption plus accepted facts. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is declaring something contradictory without identifying the conflict. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
15. Contrapositive
In contrapositive, the core move is to prove if not-B then not-A instead of if A then B. The proof or justification is successful only when the contrapositive is logically equivalent to the original implication. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is proving the converse, which is a different statement. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
16. Mathematical induction
In mathematical induction, the core move is to establish a base case and prove the step from one case to the next. The proof or justification is successful only when the inductive step has the correct hypothesis and target. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is checking many cases without proving the transition. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
17. Divisibility
In divisibility, the core move is to express a divisible integer as a multiple of the divisor. The proof or justification is successful only when the multiplier is an integer. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is treating a decimal quotient as evidence of integer divisibility. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
18. Parity
In parity, the core move is to write even numbers as 2k and odd numbers as 2k+1. The proof or justification is successful only when k is an integer and the final form matches the definition. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is relying on the appearance of examples. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
19. Consecutive integers
In consecutive integers, the core move is to encode fixed spacing with one variable. The proof or justification is successful only when the representation includes all consecutive cases. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is using unrelated variables and never enforcing consecutiveness. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
20. Rationality
In rationality, the core move is to write rational numbers as integer ratios with non-zero denominators. The proof or justification is successful only when denominator restrictions are preserved. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is assuming every decimal-looking expression is rational. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
21. Irrationality
In irrationality, the core move is to use a valid structural argument, often contradiction for classic results. The proof or justification is successful only when every divisibility inference is justified. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is copying a famous proof pattern where its assumptions do not apply. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
22. Identity
In identity, the core move is to transform one side using valid equivalences until it matches the other. The proof or justification is successful only when the transformations hold throughout the stated domain. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is starting by assuming the equality that must be proved. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
23. Equation solving
In equation solving, the core move is to derive candidates through valid transformations and test restrictions. The proof or justification is successful only when the final values satisfy the original equation. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is accepting roots introduced by non-reversible operations. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
24. Inequality proof
In inequality proof, the core move is to compare quantities while preserving order rules. The proof or justification is successful only when sign conditions are known before multiplying or dividing. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is multiplying by an unknown-sign expression without case analysis. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
25. Absolute value
In absolute value, the core move is to translate distance-from-zero or split into valid cases. The proof or justification is successful only when the cases match the definition of absolute value. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is dropping the absolute bars as if they were brackets. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
26. Bounds
In bounds, the core move is to establish lower or upper limits from valid inequalities. The proof or justification is successful only when endpoint inclusion is handled correctly. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is calling an unattained upper bound a maximum. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
27. Geometry congruence
In geometry congruence, the core move is to establish a permitted congruence criterion from stated facts. The proof or justification is successful only when corresponding vertices and sides are matched consistently. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is claiming congruence because figures look identical. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
28. Geometry similarity
In geometry similarity, the core move is to establish equal angles or proportional corresponding sides under a valid criterion. The proof or justification is successful only when the correspondence is explicit. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is mixing non-corresponding sides in ratios. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
29. Circle theorem reasoning
In circle theorem reasoning, the core move is to identify the exact circle configuration that licenses the theorem. The proof or justification is successful only when the relevant points, tangent, centre or chord conditions are present. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is naming a circle theorem without matching its configuration. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
30. Coordinate geometry
In coordinate geometry, the core move is to translate geometric claims into gradients, distances or equations. The proof or justification is successful only when the coordinate calculation corresponds to the geometric property. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is using numerical coincidence without stating the property. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
31. Vector proof
In vector proof, the core move is to express the same point or direction through consistent vector relations. The proof or justification is successful only when the vector equations use a common frame. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is treating vector magnitudes as though direction were irrelevant. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
32. Trigonometric identity
In trigonometric identity, the core move is to use identities on a valid domain and preserve denominator restrictions. The proof or justification is successful only when excluded values are recorded where needed. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is cancelling a trigonometric expression that may be zero. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
33. Function equality
In function equality, the core move is to show two functions agree for every input in the stated domain. The proof or justification is successful only when domains as well as formulas are compatible. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is equating formulas while ignoring different domains. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
34. Inverse functions
In inverse functions, the core move is to show composition returns the appropriate identity on the relevant domain. The proof or justification is successful only when one-to-one restrictions or chosen domains make the inverse valid. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is reversing operations without checking invertibility. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
35. Sequence formula
In sequence formula, the core move is to show a proposed formula generates the required pattern or satisfies a recurrence. The proof or justification is successful only when the verification covers the requested index set. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is checking only the first few terms. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
36. Recurrence reasoning
In recurrence reasoning, the core move is to use the recurrence plus initial data to justify later terms or properties. The proof or justification is successful only when the induction or invariant connects successive terms. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is assuming a visible pattern continues. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
37. Probability justification
In probability justification, the core move is to define events and combine them using valid conditional or disjoint relationships. The proof or justification is successful only when independence or mutual exclusivity is established rather than assumed. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is multiplying or adding because of keywords alone. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
38. Statistics inference
In statistics inference, the core move is to match the strength of a conclusion to the sampling evidence. The proof or justification is successful only when population, sample and uncertainty are distinguished. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is using a sample statistic as a universal proof. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
39. Optimisation
In optimisation, the core move is to establish that a candidate is globally or contextually best. The proof or justification is successful only when domain, endpoints and candidate comparison are complete. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is finding a stationary point and calling it a maximum automatically. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
40. Calculus derivative reasoning
In calculus derivative reasoning, the core move is to connect derivative sign or value to the claimed behaviour. The proof or justification is successful only when differentiability and interval conditions are appropriate. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is treating derivative zero as sufficient for every extremum claim. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
41. Integral reasoning
In integral reasoning, the core move is to connect signed accumulation or area to the requested quantity. The proof or justification is successful only when sign changes and limits are handled correctly. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is confusing displacement with total distance. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
42. Existence arguments
In existence arguments, the core move is to show at least one object or solution must occur under stated conditions. The proof or justification is successful only when the theorem used has all required hypotheses. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is claiming existence from a graph sketch alone. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
43. Uniqueness arguments
In uniqueness arguments, the core move is to show no second permitted object can satisfy the same conditions. The proof or justification is successful only when the proof excludes every alternative. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is finding one solution and calling it unique. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
44. Equivalence
In equivalence, the core move is to prove both directions when an if-and-only-if statement is required. The proof or justification is successful only when A implies B and B implies A are both established. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is proving only one implication. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
45. Invariant reasoning
In invariant reasoning, the core move is to identify a property preserved through each permitted operation. The proof or justification is successful only when the preservation holds at every step. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is observing the invariant in the first few steps only. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
46. Extremal reasoning
In extremal reasoning, the core move is to select an extreme object and exploit what extremality forces. The proof or justification is successful only when the extreme object exists in the finite or otherwise justified setting. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is choosing an extreme example without showing why it constrains all cases. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
47. Pigeonhole reasoning
In pigeonhole reasoning, the core move is to compare more objects than available categories. The proof or justification is successful only when the mapping to categories is defined correctly. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is invoking the principle without identifying pigeons and holes. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
48. Construction proof
In construction proof, the core move is to build an object satisfying all requested properties. The proof or justification is successful only when the construction is valid for every allowed input. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is giving one special example when a general construction is required. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
49. Disproof of converse
In disproof of converse, the core move is to distinguish a theorem from its reverse implication. The proof or justification is successful only when the counterexample targets the converse specifically. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is treating a true theorem as automatically biconditional. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
50. Model justification
In model justification, the core move is to state why a mathematical model represents the described situation. The proof or justification is successful only when assumptions connect the model to the context. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is calculating accurately without defending the model. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
51. Approximation justification
In approximation justification, the core move is to explain why an approximation is appropriate and what precision it supports. The proof or justification is successful only when error or rounding conditions match the claim. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is writing an exact equality for rounded values. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
52. Algorithm justification
In algorithm justification, the core move is to show that a repeated procedure terminates and produces the required output. The proof or justification is successful only when each step preserves correctness and progress is established. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is showing the algorithm works on one input only. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
53. Combinatorial counting
In combinatorial counting, the core move is to partition outcomes without omission or duplication. The proof or justification is successful only when cases are exhaustive and disjoint or overlap is corrected. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is double-counting arrangements. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
54. Set equality
In set equality, the core move is to prove mutual inclusion. The proof or justification is successful only when every element of each set is shown to belong to the other. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is showing only that the sets have the same number of elements. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
55. Matrix reasoning
In matrix reasoning, the core move is to use dimension, multiplication order and transformation meaning correctly. The proof or justification is successful only when operations are defined and order is preserved. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is commuting matrix products without justification. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
56. Complex-number argument
In complex-number argument, the core move is to use algebraic or geometric properties within the complex domain. The proof or justification is successful only when modulus, argument and conjugation rules are applied with conditions. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is importing real-number order ideas into complex numbers. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
57. Number-base reasoning
In number-base reasoning, the core move is to interpret place value under the stated base. The proof or justification is successful only when digits are valid and powers of the base are used correctly. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is reading a numeral as though it were decimal. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
58. Logic quantifiers
In logic quantifiers, the core move is to track every, some, exists and for all precisely. The proof or justification is successful only when negations reverse quantifiers correctly. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is negating ‘all’ as ‘none’ instead of ‘not all’. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
59. Conditional probability
In conditional probability, the core move is to update the sample space after information is given. The proof or justification is successful only when the conditioning event has positive probability and is applied consistently. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is using the original unconditional denominator. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
60. Expected value
In expected value, the core move is to justify a weighted average by outcome probabilities. The proof or justification is successful only when probabilities cover the distribution and sum appropriately. That requirement tells you what evidence must appear on the page and what can remain implicit at the level of the course.
A common failure is treating expectation as a guaranteed individual outcome. The problem is logical rather than cosmetic. More algebra or more sentences do not repair a missing implication. Return to the exact claim and identify the smallest fact that would connect the current line to the desired conclusion.
Reasoning drill. Write the claim in one sentence. Under it, write the permitted starting facts. Between them, leave a blank line for every relationship that must be justified. If a line depends on a theorem, state the condition that allows that theorem to be used. Then remove any sentence that merely repeats the conclusion without adding evidence.
Stress test. Change one boundary condition, sign, domain or quantifier and ask whether the argument survives. If it fails, identify the exact line that depended on the original condition. This makes theorem conditions memorable because the learner sees what breaks when one is removed.
Writing test. Ask whether a reader could distinguish this argument from a lucky example or unsupported assertion. A strong response makes the decisive relationship visible without narrating every thought the solver had. Mathematical writing is selective evidence.
Part III. Forty original proof and justification laboratories
Laboratory 1. odd plus odd
Task. Prove that the sum of two odd integers is even.
Reasoning. Let the integers be 2a+1 and 2b+1. Their sum is 2(a+b+1), twice an integer, hence even.
Why this is evidence. The general forms cover all odd integers. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 2. consecutive product
Task. Prove that the product of two consecutive integers is even.
Reasoning. Let them be n and n+1. One of any two consecutive integers is even, so the product contains a factor 2.
Why this is evidence. The two parity cases exhaust all integers. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 3. square parity converse
Task. If n² is odd, prove n is odd.
Reasoning. Use the contrapositive: if n is even, n=2k and n²=4k² is even. Therefore if n² is odd, n cannot be even.
Why this is evidence. The contrapositive is equivalent to the original implication. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 4. false divisibility claim
Task. Disprove: if a+b is divisible by 4, then both a and b are divisible by 4.
Reasoning. Take a=1,b=3. Their sum is 4, divisible by 4, while neither addend is divisible by 4.
Why this is evidence. The example satisfies the hypothesis and contradicts the conclusion. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 5. difference of squares
Task. Show that the difference of squares of consecutive integers is odd.
Reasoning. (n+1)²−n²=2n+1, which is odd for integer n.
Why this is evidence. The final expression matches the definition of odd. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 6. algebra identity
Task. Show (x+3)²−(x−3)²=12x.
Reasoning. Expand the left: x²+6x+9−(x²−6x+9)=12x.
Why this is evidence. Every transformation is an identity for all real x. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 7. rational simplification
Task. Explain why (x²−4)/(x−2)=x+2 requires x≠2.
Reasoning. Factor numerator as (x−2)(x+2); cancellation divides by x−2, which must be non-zero.
Why this is evidence. The restriction belongs to the original denominator. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 8. extraneous root
Task. Solve √(x+2)=x and justify the accepted root.
Reasoning. Squaring gives x²−x−2=0, candidates 2 and −1. Original equation accepts 2 and rejects −1.
Why this is evidence. Squaring can introduce candidates, so original-equation checking is necessary. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 9. isosceles angles
Task. AB=AC in triangle ABC. Explain why angles B and C are equal.
Reasoning. Angles opposite equal sides in an isosceles triangle are equal.
Why this is evidence. The given side equality satisfies the theorem condition. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 10. parallel lines
Task. Two parallel lines are cut by a transversal. Justify equality of alternate interior angles.
Reasoning. Use the alternate-angle theorem under the stated parallel-line condition.
Why this is evidence. Parallelism is evidence, not visual appearance. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 11. similar triangles
Task. Two triangles have two equal corresponding angles. Justify similarity.
Reasoning. The third angles also match and AA similarity applies.
Why this is evidence. Correspondence must be maintained when later comparing sides. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 12. Pythagoras condition
Task. Explain why a²+b²=c² cannot be used on every triangle.
Reasoning. The Pythagorean relationship applies to a right triangle with c opposite the right angle.
Why this is evidence. The theorem has a geometric condition. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 13. gradient parallelism
Task. Show lines y=3x+2 and 3y=9x−12 are parallel.
Reasoning. Second line simplifies to y=3x−4. Both gradients are 3 and intercepts differ.
Why this is evidence. Equal gradients establish parallel distinct lines. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 14. perpendicular gradients
Task. Show y=2x+1 and y=−x/2+7 are perpendicular.
Reasoning. Their gradients multiply to −1.
Why this is evidence. The negative-reciprocal criterion applies in the standard Cartesian setting. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 15. quadratic maximum
Task. Show x(10−x)≤25 for real x.
Reasoning. x(10−x)=25−(x−5)²≤25 because a real square is non-negative.
Why this is evidence. The argument establishes a global bound and equality case. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 16. AM style bound
Task. For positive x, show x+1/x≥2.
Reasoning. (x−1)²≥0 gives x²−2x+1≥0; divide by positive x to obtain x+1/x≥2.
Why this is evidence. Positivity of x is needed to preserve inequality direction. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 17. probability complement
Task. Justify P(at least one success)=1−P(no successes).
Reasoning. The events ‘at least one success’ and ‘no successes’ are complementary and partition the sample space.
Why this is evidence. The event definitions establish the complement relationship. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 18. conditional probability
Task. Explain why without-replacement probabilities change after a draw.
Reasoning. The first outcome changes the composition of the remaining sample space, so the second probability is conditional on the first result.
Why this is evidence. The denominator and favourable count must describe the new state. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 19. mean weighting
Task. Explain why combined mean is not generally the mean of two group means.
Reasoning. Group means represent different numbers of observations; reconstruct totals or weight each mean by group size.
Why this is evidence. Equal weighting of unequal groups changes the data contribution. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 20. sample claim
Task. A sample mean is 14. Explain why this alone does not prove the population mean is 14.
Reasoning. A sample statistic is observed from a subset; population inference requires assumptions and uncertainty beyond the arithmetic.
Why this is evidence. The scope of evidence is narrower than the universal claim. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 21. induction sum
Task. Prove 1+2+…+n=n(n+1)/2 for positive integers.
Reasoning. Base n=1 holds. Assume true for k; add k+1 to get k(k+1)/2+k+1=(k+1)(k+2)/2.
Why this is evidence. Base case plus valid inductive step covers all positive integers. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 22. induction divisibility
Task. Prove 5^n−1 is divisible by 4 for positive integers.
Reasoning. Base n=1 gives 4. If 5^k−1=4m, then 5^(k+1)−1=5(5^k−1)+4=4(5m+1).
Why this is evidence. The inductive step preserves divisibility. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 23. set equality
Task. Prove A∩(B∪C)=(A∩B)∪(A∩C).
Reasoning. Take arbitrary x. Membership in left means x∈A and (x∈B or x∈C), equivalent to (x∈A∩B) or (x∈A∩C).
Why this is evidence. Element-wise equivalence proves both inclusions at once. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 24. function injectivity
Task. Show f(x)=3x−4 is one-to-one over real numbers.
Reasoning. If f(a)=f(b), then 3a−4=3b−4, hence a=b.
Why this is evidence. Equal outputs force equal inputs. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 25. inverse verification
Task. Verify f(x)=2x+5 and g(x)=(x−5)/2 are inverses.
Reasoning. f(g(x))=x and g(f(x))=x for real x.
Why this is evidence. Both compositions return the identity on the stated domain. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 26. sequence invariant
Task. A process adds an even integer at every step. Show parity never changes.
Reasoning. Adding an even number 2k changes n to n+2k, which has the same parity as n.
Why this is evidence. The property is preserved at each permitted operation. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 27. pigeonhole
Task. Show among 13 people at least two share a birth month.
Reasoning. There are 12 month categories and 13 people; assigning each person a month forces some category to contain at least two.
Why this is evidence. More objects than categories triggers the principle. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 28. counting pairs
Task. Count handshakes among n people if each pair shakes once.
Reasoning. Each handshake corresponds to an unordered pair, so the count is C(n,2)=n(n−1)/2.
Why this is evidence. The pairing model prevents order-based double counting. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 29. stationary point
Task. Explain why f'(a)=0 alone does not prove a maximum.
Reasoning. A stationary point can be a minimum or neither; additional sign, second-derivative, shape or global comparison evidence is required.
Why this is evidence. The derivative-zero condition identifies a candidate, not its type. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 30. distance versus displacement
Task. Explain why integrating velocity may not give total distance.
Reasoning. A signed integral allows negative velocity to cancel positive displacement; total distance requires accumulating speed or splitting at sign changes.
Why this is evidence. The target quantity determines whether sign is retained. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 31. model assumption
Task. A linear cost formula is used for all quantities. Explain what must be checked.
Reasoning. The fixed fee and per-unit rate must actually remain constant over the range, with no thresholds or discrete pack rules that change the relationship.
Why this is evidence. Model validity depends on conditions outside symbolic manipulation. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 32. approximation
Task. Explain why 2/3 should not be written equal to 0.67.
Reasoning. 0.67 is a rounded approximation; 2/3 has infinitely recurring decimal expansion. Use ≈ when rounding.
Why this is evidence. Notation communicates whether exact value is preserved. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 33. unique root
Task. Show 2x+7=19 has a unique real solution.
Reasoning. Linear rearrangement gives x=6; if two values solved it, subtracting their equations would give 2(a−b)=0, hence a=b.
Why this is evidence. The non-zero linear coefficient prevents a second solution. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 34. no solution
Task. Show x²+1=0 has no real solution.
Reasoning. For real x, x²≥0, so x²+1≥1>0.
Why this is evidence. A real-square bound excludes every real candidate. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 35. existence interval
Task. For continuous f with f(1)<0 and f(2)>0, explain what a root theorem can establish.
Reasoning. Under continuity, the intermediate value theorem guarantees at least one root between 1 and 2.
Why this is evidence. Continuity is an essential hypothesis; the conclusion is existence, not uniqueness. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 36. equivalence
Task. Prove an integer n is even iff n² is even.
Reasoning. Forward: n=2k gives n²=4k² even. Reverse: contrapositive—odd n=2k+1 has odd square, so even square implies even n.
Why this is evidence. Both directions are required by iff. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 37. log restriction
Task. Why must log(x−3) require x>3 over the reals?
Reasoning. A real logarithm’s argument must be positive, so x−3>0.
Why this is evidence. The domain condition precedes any log manipulation. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 38. matrix order
Task. Explain why AB and BA need not be equal.
Reasoning. Matrix multiplication composes transformations in order and dimensions/entries generally produce different products.
Why this is evidence. Commutativity cannot be assumed from ordinary scalar multiplication. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 39. complex modulus
Task. Show |zw|=|z||w|.
Reasoning. Using |z|²=z conjugate(z), |zw|²=zw conjugate(z)conjugate(w)=|z|²|w|²; nonnegative square roots give the result.
Why this is evidence. Modulus non-negativity justifies the final square-root step. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Laboratory 40. quantifier negation
Task. Negate ‘every student solved at least one problem’.
Reasoning. There exists a student who solved no problems.
Why this is evidence. Negating a universal creates an existential countercase; ‘nobody solved any problem’ would be stronger than the logical negation. The explanation identifies the bridge between the starting information and the conclusion rather than merely announcing that the result is obvious.
Variation. Change one hypothesis or quantifier and decide whether the argument remains valid. If it fails, identify the first line that can no longer be justified. This turns theorem conditions into working knowledge rather than a list memorised separately from problem solving.
Part IV. How to write a proof under examination conditions
First identify the claim type. Is the question universal, existential, conditional, biconditional, an identity, an inequality, an optimisation claim or a request for a counterexample? The logical form narrows the useful proof methods before any algebra begins.
Second, write the domain beside the claim when it matters: integers, positive reals, a stated interval, non-zero values, points on a circle. Many invalid proofs become visible immediately when the domain is written explicitly.
Third, expose the decisive transition. Do not bury it beneath routine manipulation. If parity is the key, reach a form 2k or 2k+1. If similarity is the key, establish the corresponding angles or sides. If a maximum is the key, establish an upper bound and an equality case or provide the course-appropriate extremum test.
Fourth, stress-test the argument. Ask which line would fail if a hypothesis were removed. This is a fast way to detect an assumption you used without stating. Finally, write the conclusion with the same strength and domain as the question.
Part V. Frequently asked questions
How long should a proof be?
Long enough to establish every necessary logical bridge and no longer merely for appearance. A one-line counterexample can completely disprove a universal statement; a general proof may need several steps. Judge completeness by logic, not word count.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
Can examples ever prove a statement?
A finite list of examples normally cannot prove a claim about infinitely many cases. Examples can prove an existential statement—showing that at least one object exists—or refute a universal statement when one example is a valid counterexample. The quantifier decides the evidential job.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
What does ‘justify’ mean in maths?
It asks for support that makes the conclusion warranted. Depending on the task, that may be a theorem with its conditions, an algebraic derivation, a calculation tied to the model, a counterexample, a comparison or a statistical limitation. Use your examination’s command-word guidance for exact expectations.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
What is the difference between prove and show that?
Both can require a valid derivation. ‘Show that’ often supplies the destination, while ‘prove’ may present a proposition more directly. Neither permits assuming the desired result as a starting fact. Board-specific conventions can differ, so follow the actual syllabus and question.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
Should I write theorem names?
Write enough to identify the reason unambiguously when a reason is required. A theorem name can be efficient, but it must match the configuration. Naming Pythagoras on a triangle not established as right-angled does not justify the equation.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
How do I start a proof when I am stuck?
Rewrite the claim with its domain and quantifiers. List the permitted facts and definitions. Ask what form the conclusion would need: even, divisible, equal, parallel, bounded, unique. Then look for a representation that exposes that form. This often gives a smaller next step than trying to see the entire proof at once.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
Can I work backwards?
Working backwards is useful for discovery. In the final argument, make sure each displayed implication is valid in the direction you claim. If a backward step is reversible, it may be rewritten as an equivalence; if not, use it only to discover a forward route and verify the final logic.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
Why do I lose marks when the final statement is correct?
The task may assess the reasoning that establishes the statement. A supplied or guessed conclusion without the required evidence cannot demonstrate the intended mathematical performance. Check the official scheme for the specific item rather than assuming how many marks any line receives.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
What is an extraneous solution?
It is a candidate produced by a transformed problem that does not satisfy the original conditions. Squaring equations is a common source because equal squares do not imply equal signed values. Test candidates in the original equation when the transformation can introduce them.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
What is a hidden restriction?
It is a condition such as a denominator being non-zero, a square-root input being non-negative in real arithmetic, or a logarithm argument being positive. Simplification can make the expression that carried the restriction disappear visually, but the original domain still matters.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
How do I prove something is unique?
Finding one example establishes existence, not uniqueness. To prove uniqueness, suppose two permitted objects satisfy the conditions and show they must be equal, or use a property such as strict monotonicity that prevents two solutions. The exact route depends on the problem.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
How do I disprove an ‘if and only if’ statement?
An equivalence contains two implications. It is false if either direction fails. Identify a direction and provide a valid counterexample satisfying that direction’s hypothesis but not its conclusion.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
Why is the converse dangerous?
From A implies B, B implies A does not automatically follow. ‘Divisible by four implies even’ is true, while ‘even implies divisible by four’ is false. Write the two directions explicitly when the wording makes reversal tempting.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
How can I check a geometry proof?
Ignore the apparent scale of the diagram and list only stated or derived facts. For every angle or length equality, identify its reason. Check correspondence carefully in congruent or similar figures. Redraw the diagram distorted while preserving markings; a valid proof should survive.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
How can I check an algebra proof?
Inspect operations for domain restrictions and reversibility. Test whether division could be by zero, whether squaring introduced candidates, whether inequality direction should change, and whether an identity step is valid for all values in the stated domain.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
What makes a statistical explanation mathematical?
It connects a numerical measure or sampling design to a precisely scoped claim. A lower sample mean may describe lower average values in that sample; it does not by itself prove a causal explanation or universal population statement. The wording should match the evidence.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
Does a calculator count as justification?
A calculator can supply numerical evidence but does not automatically establish why a theorem or general claim is true. For an approximate numerical question, a calculator result may be part of a valid solution. For proof, the logical relationship must still be supplied.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
Can a diagram be a proof?
A diagram can communicate structure and sometimes form part of a rigorous argument, but a picture drawn to one scale does not establish a general geometric fact by appearance alone. The required reasoning must follow from stated properties, constructions or accepted results.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
How do I improve proof writing?
Study completed proofs by identifying the job of each line, then close the model and reconstruct the argument. Next solve a near variation and a mixed proof where the method is not announced. Compare missing logical steps rather than merely comparing wording.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
What should I do at the end of a proof?
State the conclusion at the scope requested. If you proved an expression is twice an integer, explicitly connect that to evenness. If you established a contradiction, state what assumption is rejected. The last sentence closes the logical contract with the question.
A useful practice response is to take one proof you already know and identify its claim, domain, hypotheses, decisive relationship and conclusion. Then change one condition and decide whether the proof survives. This makes reasoning visible as a system rather than a script to memorise.
A creative-writing lens: causality, evidence and consequence
Mathematical proof and creative writing have different standards, but a writer can borrow one useful discipline from proof: consequences should have causes the reader can trace. If a character changes a decision, the story needs evidence—new information, pressure, memory, conflict or discovery—that makes the change intelligible. The writer is not proving a theorem; the analogy is about causal continuity.
Original scene. Ethan had insisted the window was locked. He had checked it twice before the class left. When the papers appeared on the corridor floor the next morning, everyone blamed the wind anyway. Clara did not argue. She placed one sheet beside the window and watched its corner remain perfectly still. Then she pointed to the damp footprint beneath the side door.
The scene works because the conclusion changes when new evidence appears. The still paper weakens one explanation; the footprint supports another possibility without proving an entire story. A careful writer, like a careful mathematician, can distinguish what the evidence establishes from what it merely suggests. That distinction creates room for suspense without making characters irrational.
Use the eduKate ecosystem as a reasoning route
Use the Mathematics Learning Hub for prerequisite concepts and the Additional Mathematics Hub for advanced techniques. Use Why Students Fail Proof and Derivation Exams for the failure-analysis branch, and the reasoning and explanation workbook for structured explanation practice.
For the wider examination architecture, return to How Mathematics Examination Works and the Examinations & Assessment Hub. This article owns the narrower reasoning-to-proof pathway: how a mathematical claim becomes defensible evidence.
Final answer: make the bridge visible
A mathematics examination does not ask for reasons merely to make answers longer. Reasoning reveals whether the conclusion follows from the information and whether the solver understands the conditions under which the method works. Proof is the most explicit version of that responsibility.
The final editing question is simple: “What exactly makes this next line true?” If you can answer that at every decisive transition, preserve the domain and finish at the scope requested, your mathematics becomes easier to inspect, easier to correct and much harder to fake with a lucky final number.
Part VI. Reasoning vocabulary laboratory
Proof writing becomes easier when the language used to describe logic is itself precise. The following laboratory treats reasoning vocabulary as working tools. For every term, the learner should be able to identify it inside an actual solution, explain what job it performs and recognise a nearby misuse.
Reasoning word 1. Claim
claim is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to claim. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of claim is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which claim is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 2. Hypothesis
hypothesis is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to hypothesis. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of hypothesis is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which hypothesis is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 3. Conclusion
conclusion is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to conclusion. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of conclusion is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which conclusion is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 4. Definition
definition is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to definition. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of definition is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which definition is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 5. Theorem condition
theorem condition is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to theorem condition. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of theorem condition is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which theorem condition is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 6. Domain
domain is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to domain. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of domain is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which domain is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 7. Quantifier
quantifier is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to quantifier. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of quantifier is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which quantifier is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 8. Implication
implication is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to implication. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of implication is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which implication is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 9. Converse
converse is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to converse. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of converse is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which converse is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 10. Contrapositive
contrapositive is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to contrapositive. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of contrapositive is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which contrapositive is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 11. Equivalence
equivalence is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to equivalence. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of equivalence is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which equivalence is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 12. Counterexample
counterexample is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to counterexample. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of counterexample is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which counterexample is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 13. Case split
case split is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to case split. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of case split is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which case split is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 14. Invariant
invariant is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to invariant. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of invariant is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which invariant is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 15. Boundary
boundary is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to boundary. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of boundary is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which boundary is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 16. Equality case
equality case is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to equality case. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of equality case is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which equality case is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 17. Existence
existence is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to existence. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of existence is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which existence is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 18. Uniqueness
uniqueness is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to uniqueness. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of uniqueness is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which uniqueness is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 19. Necessity
necessity is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to necessity. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of necessity is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which necessity is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 20. Sufficiency
sufficiency is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to sufficiency. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of sufficiency is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which sufficiency is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 21. Reversibility
reversibility is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to reversibility. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of reversibility is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which reversibility is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 22. Restriction
restriction is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to restriction. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of restriction is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which restriction is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 23. Approximation
approximation is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to approximation. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of approximation is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which approximation is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 24. Generalisation
generalisation is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to generalisation. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of generalisation is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which generalisation is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 25. Correspondence
correspondence is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to correspondence. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of correspondence is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which correspondence is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 26. Independence
independence is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to independence. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of independence is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which independence is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 27. Mutual exclusivity
mutual exclusivity is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to mutual exclusivity. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of mutual exclusivity is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which mutual exclusivity is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 28. Continuity
continuity is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to continuity. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of continuity is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which continuity is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 29. Monotonicity
monotonicity is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to monotonicity. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of monotonicity is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which monotonicity is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 30. Symmetry
symmetry is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to symmetry. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of symmetry is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which symmetry is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 31. Parity
parity is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to parity. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of parity is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which parity is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 32. Divisibility
divisibility is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to divisibility. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of divisibility is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which divisibility is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 33. Congruence
congruence is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to congruence. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of congruence is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which congruence is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 34. Similarity
similarity is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to similarity. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of similarity is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which similarity is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 35. Proportionality
proportionality is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to proportionality. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of proportionality is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which proportionality is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 36. Linearity
linearity is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to linearity. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of linearity is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which linearity is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 37. Convexity
convexity is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to convexity. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of convexity is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which convexity is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 38. Periodicity
periodicity is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to periodicity. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of periodicity is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which periodicity is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 39. Recurrence
recurrence is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to recurrence. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of recurrence is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which recurrence is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 40. Induction hypothesis
induction hypothesis is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to induction hypothesis. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of induction hypothesis is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which induction hypothesis is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Reasoning word 41. Base case
base case is useful only when it identifies a real logical feature of the mathematics. In examination work, do not memorise the term as an isolated definition. Find the line of a proof where the idea matters, then explain what would become invalid or incomplete if that feature were ignored.
Reading drill. Take a completed proof and mark the sentence or symbol sequence that corresponds to base case. If no such feature is present, explain why the proof does not need it. This prevents reasoning vocabulary from becoming decorative terminology attached to every solution regardless of structure.
Writing drill. Rewrite one vague sentence so that the role of base case is explicit. Keep the revision short. The purpose is not to insert technical words for sophistication but to make the dependency between facts visible to another reader.
Failure drill. Construct or locate a near-miss argument in which base case is mishandled. Identify the first unsupported conclusion and repair it with the smallest necessary change. A deliberately broken proof can reveal theorem boundaries more clearly than another flawless example.
Part VII. Thirty broken-proof diagnostics
A powerful way to learn mathematical reasoning is to diagnose an argument that looks plausible but fails. Each diagnostic below names a failure pattern. The learner’s job is to create a small example of it, locate the first invalid transition and rewrite only the part necessary to make the argument sound.
Diagnostic 1. Assuming the conclusion
The failure pattern is assuming the conclusion. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because assuming the conclusion is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 2. Proving the converse
The failure pattern is proving the converse. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because proving the converse is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 3. Forgetting the domain
The failure pattern is forgetting the domain. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because forgetting the domain is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 4. Dividing by a possible zero
The failure pattern is dividing by a possible zero. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because dividing by a possible zero is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 5. Squaring without checking candidates
The failure pattern is squaring without checking candidates. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because squaring without checking candidates is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 6. Using examples as universal proof
The failure pattern is using examples as universal proof. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because using examples as universal proof is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 7. Giving a counterexample outside the hypothesis
The failure pattern is giving a counterexample outside the hypothesis. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because giving a counterexample outside the hypothesis is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 8. Forgetting an equality case
The failure pattern is forgetting an equality case. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because forgetting an equality case is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 9. Calling a stationary point a maximum
The failure pattern is calling a stationary point a maximum. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because calling a stationary point a maximum is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 10. Using a diagram’s appearance as evidence
The failure pattern is using a diagram’s appearance as evidence. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because using a diagram’s appearance as evidence is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 11. Mixing corresponding sides
The failure pattern is mixing corresponding sides. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because mixing corresponding sides is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 12. Omitting a case
The failure pattern is omitting a case. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because omitting a case is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 13. Using circular reasoning
The failure pattern is using circular reasoning. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because using circular reasoning is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 14. Changing an inequality sign incorrectly
The failure pattern is changing an inequality sign incorrectly. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because changing an inequality sign incorrectly is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 15. Failing to change an inequality sign when required
The failure pattern is failing to change an inequality sign when required. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because failing to change an inequality sign when required is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 16. Claiming independence without evidence
The failure pattern is claiming independence without evidence. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because claiming independence without evidence is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 17. Double-counting overlapping cases
The failure pattern is double-counting overlapping cases. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because double-counting overlapping cases is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 18. Using an approximation as an equality
The failure pattern is using an approximation as an equality. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because using an approximation as an equality is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 19. Claiming uniqueness after finding one solution
The failure pattern is claiming uniqueness after finding one solution. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because claiming uniqueness after finding one solution is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 20. Claiming existence after finding no contradiction
The failure pattern is claiming existence after finding no contradiction. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because claiming existence after finding no contradiction is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 21. Dropping a restriction after cancellation
The failure pattern is dropping a restriction after cancellation. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because dropping a restriction after cancellation is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 22. Forgetting endpoint inclusion
The failure pattern is forgetting endpoint inclusion. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because forgetting endpoint inclusion is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 23. Generalising from a sample
The failure pattern is generalising from a sample. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because generalising from a sample is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 24. Confusing correlation with proof of cause
The failure pattern is confusing correlation with proof of cause. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because confusing correlation with proof of cause is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 25. Using a theorem without its hypotheses
The failure pattern is using a theorem without its hypotheses. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because using a theorem without its hypotheses is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 26. Negating a quantifier incorrectly
The failure pattern is negating a quantifier incorrectly. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because negating a quantifier incorrectly is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 27. Treating necessary as sufficient
The failure pattern is treating necessary as sufficient. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because treating necessary as sufficient is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 28. Treating sufficient as necessary
The failure pattern is treating sufficient as necessary. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because treating sufficient as necessary is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 29. Assuming a sequence pattern continues without proof
The failure pattern is assuming a sequence pattern continues without proof. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because assuming a sequence pattern continues without proof is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Diagnostic 30. Writing therefore between unrelated statements
The failure pattern is writing therefore between unrelated statements. Do not repair it by adding more words around the same invalid step. Identify what fact, condition or direction of implication is missing. Then decide whether the claim can be saved with an additional hypothesis, a different proof method, a restricted conclusion or a genuine counterexample.
Audit question. What is the last line that is unquestionably established? What is the next line claiming? Write the exact logical bridge that would be required between them. If that bridge is false or unavailable, the proof must change at that point rather than farther down the page.
Transfer question. Build a second problem in a different topic where the same failure could occur. This matters because writing therefore between unrelated statements is not merely a mistake attached to one chapter. It is a reasoning pattern that can reappear in algebra, geometry, probability, statistics or calculus whenever the same logical structure is present.
Part VIII. A 20-day proof-writing programme
Day 1. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 2. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 3. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 4. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 5. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 6. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 7. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 8. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 9. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 10. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 11. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 12. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 13. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 14. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 15. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 16. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 17. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 18. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 19. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Day 20. From recognition to independent reasoning
Choose one proof or justification type appropriate to the learner’s syllabus. Begin by stating the claim, domain and hypotheses without solving it. Then identify what the conclusion would look like in a useful mathematical form. For example, an evenness conclusion suggests a final expression twice an integer; a parallel-lines conclusion suggests a gradient or angle relationship; a maximum suggests an upper-bound or extremum argument.
Study one worked example and label the job of each decisive line. Close the example and reconstruct the argument from the claim alone. If reconstruction fails, reopen only far enough to locate the missing relationship. This keeps assistance measurable and prevents recognition of a displayed proof from being mistaken for independent proof construction.
Finish with a near variation and one stress test. Change a sign, domain, quantifier or condition and decide whether the original proof still works. Record the first line that changes. The day’s success criterion is not speed; it is the ability to explain why the proof method belongs to the new problem without being told its name.
Source and scope note
This article uses original mathematical examples and teaching routines. Examination command words, permitted methods and marking expectations differ across qualifications, so readers should use their current official syllabus, paper instructions and mark schemes. The article does not assign official marks to its original tasks and does not claim that a particular proof length or phrase guarantees credit.
Adrian, Jo, Ben, Aisha, Ryan, Mira, Clara and Ethan are fictional teaching characters. Their conversations illustrate reasoning differences; they are not reports of real students or evidence of guaranteed outcomes.
Return to the Mathematics Examination owner
This guide deepens one part of the wider examination system. Return to How Mathematics Examination Works | Maths Exam Questions, Working and Marks Explained to reconnect this topic with question reading, mathematical working, evidence, checking, timing and the rest of the series.
