ExhibitBorrowing without paying back
✗The wrong step: x2+6x+5=(x+3)2+5.
What went wrong? Think first, then open
Diagnosis (x+3)2 expands to x2+6x+9, which is 9 more than the original x2+6x. The corner you filled in was borrowed; if you never subtract it again, the value of the expression changes.
✓The right step: x2+6x+5=(x+3)2−9+5=(x+3)2−4.
“Add a term, and you must take it away again”
From: Completing the Square line
ExhibitNot taking the leading coefficient out properly
✗The wrong step: 2x2+8x=2(x2+4x)=2(x+2)2−4.
What went wrong? Think first, then open
Diagnosis The 4 added inside the brackets is doubled by the 2 outside: 2(x+2)2=2x2+8x+8, so the extra amount is really 8, not 4.
✓The right step: 2x2+8x=2[(x+2)2−4]=2(x+2)2−8. Borrow and pay back inside the brackets first, then multiply out.
“What you borrow inside the brackets, pay back inside the brackets”
From: Completing the Square line
ExhibitForgetting that the new variable has its own range
✗The wrong step: Solve x4−5x2−36=0: let t=x2, so t=9 or t=−4. Hence x=±3 or x=±2.
What went wrong? Think first, then open
Diagnosis t is not just any number: it is x2, so t≥0. t=−4 would mean x2=−4, and no real x can do that. Treating −4 as if it were 4 and taking square roots creates two fake solutions out of nowhere.
✓The right step: Reject t=−4. Only x2=9 is left, so x=±3. Substitute back into the original equation: 81−45−36=0. It works.
“When you substitute, carry the new variable's range across too”
From: Substitution line
ExhibitStaying in the t-world and never coming back
✗The wrong step: Factor (x2+3x)2−2(x2+3x)−8: let t=x2+3x, giving (t−4)(t+2). So the answer is (x2+3x−4)(x2+3x+2).
What went wrong? Think first, then open
Diagnosis Only half of the substituting back was done. Once the lens comes off, each factor must be checked again in the x-world: x2+3x−4 and x2+3x+2 can both still be factored by the cross method.
✓The right step: (x2+3x−4)(x2+3x+2)=(x+4)(x−1)(x+1)(x+2).
“After substituting back, ask once more “can it factor further?””
From: Substitution line
ExhibitUsing Vieta without checking the discriminant
✗The wrong step: The real numbers x1,x2 are the two roots of x2−2kx+k+6=0. x12+x22=(2k)2−2(k+6)=4k2−2k−12, which is smallest when k=41, with minimum −449.
What went wrong? Think first, then open
Diagnosis The sum of the squares of two real numbers can never be negative: the answer itself is shouting “something is wrong”. When k=41, Δ=4k2−4k−24<0, so the equation has no real roots at all, and “the sum of the roots” and “the product of the roots” are promises nobody can keep.
✓The right step: First make sure there are roots: Δ=4(k−3)(k+2)≥0, that is, k≤−2 or k≥3. In this range, 4k2−2k−12 is smallest at k=−2, with minimum 16+4−12=8.
“First make sure the roots exist, then talk about their sum and product”
From: Discriminant and Vieta line
ExhibitForgetting it must be a quadratic equation first
✗The wrong step: The equation kx2−4x+2=0 has two different real roots, so Δ=16−8k>0, which gives k<2.
What went wrong? Think first, then open
Diagnosis k=0 satisfies k<2, but then the equation is −4x+2=0, which has only one root. The discriminant is a tool for quadratic equations: before using it, check that the coefficient of x2 is not 0.
✓The right step: k<2 and k=0.
“First check whether a is 0, then compute Δ”
From: Discriminant and Vieta line
ExhibitDividing by a coefficient that contains a letter
✗The wrong step: Solve (a2−4)x=a+2 for x: divide both sides by a2−4 to get x=a2−4a+2=a−21.
What went wrong? Think first, then open
Diagnosis With x as the main variable, a2−4 is a “coefficient”. But it contains a letter, so it might be exactly 0: when a=2 the equation is 0⋅x=4, with no solution; when a=−2 it is 0⋅x=0, and every x is a solution. Dividing by 0 loses both of these cases.
✓The right step: Split into three cases: if a=±2, then x=a−21; if a=2, there is no solution; if a=−2, x can be any number.
“When a coefficient contains a letter, first ask whether it could be 0”
From: The Principal Variable line
ExhibitAssuming “a ≥ b ≥ c” for a cyclic expression too
✗The wrong step: In a2b+b2c+c2a the letters a,b,c can be cycled, so without loss of generality a≥b≥c.
What went wrong? Think first, then open
Diagnosis “Without loss of generality a≥b≥c” needs the expression to stay the same when any two letters are swapped. This expression is only cyclic: (a,b,c)=(1,2,3) gives 2+12+9=23, while (3,2,1) gives 18+4+3=25, so swapping a and c changes the value. There are 6 possible orderings, and cycling can only merge them into 2 classes, not 1.
✓The right step: For a cyclic expression you may only say “without loss of generality, a is the largest of the three”, and then you must deal with both cases b≥c and b<c.
“Symmetric expressions allow a full ordering; cyclic ones only let you choose the largest”
From: Symmetry line
ExhibitBounding too generously
✗The wrong step: To prove 221+321+⋯+n21<43: since k21<(k−1)k1=k−11−k1, the left side is <1−n1<1. Done.
What went wrong? Think first, then open
Diagnosis What you proved is “less than 1”, but the problem asks for “less than 43”. 1 is bigger than 43, so this bound is too loose and proves nothing. The trouble is the first term: enlarging 41 to 21 throws away 41 in one go.
✓The right step: Keep the first term as it is and start bounding from the second: the left side is <41+(21−n1)<43.
“If a bound is too loose, bound fewer terms”
From: Bounding line
ExhibitForgetting the small cases the bounds do not cover
✗The wrong step: Since n2<n2+n+1<(n+1)2, n2+n+1 is not a perfect square for any non-negative integer n.
What went wrong? Think first, then open
Diagnosis The right-hand inequality is equivalent to n>0. When n=0, n2+n+1=1=(n+1)2, so it is not squeezed at all, and 1 is in fact a perfect square.
✓The right step: For n≥1 it lies strictly between two consecutive squares, so it is not a square; check n=0 separately: it gives 1=12.
“Use an inequality only from where it starts to hold”
From: Bounding line
ExhibitBase and height that do not belong together
✗The wrong step: A right triangle has legs 6 and 8 and hypotenuse 10, so its area is 21×10×8=40.
What went wrong? Think first, then open
Diagnosis In the area formula the “height” must be perpendicular to the chosen “base”. 8 is a leg: it is perpendicular to the other leg, 6, not to the hypotenuse, 10.
✓The right step: With a leg as the base: 21×6×8=24. With the hypotenuse as the base, the height is the altitude to the hypotenuse, 4.8: 21×10×4.8=24.
“Whichever base you choose, use the height perpendicular to it”
From: The Area Method line
ExhibitWriting a ratio of areas as a ratio of sides without thinking
✗The wrong step: D is any point on BC, so S△ABD:S△ACD=AB:AC.
What went wrong? Think first, then open
Diagnosis With AB and AC as bases, the two heights are the distances from D to AB and from D to AC. They are equal only when D lies on the bisector of ∠A.
✓The right step: For any D: the two triangles share the altitude from A, so S△ABD:S△ACD=BD:DC. Only when AD is the angle bisector is this ratio also equal to AB:AC.
“A ratio of areas equals the ratio of the bases only when the heights are the same”
From: The Area Method line
ExhibitRotating and then adding straight away
✗The wrong step: Rotate △ADF about A to △ABF′, so EF′=BE+BF′.
What went wrong? Think first, then open
Diagnosis Two segments can be added only if F′, B, E are on one straight line. The rotation only guarantees BF′=DF; it does not guarantee that the pieces join up straight. In a square they happen to, but in a general quadrilateral they may not.
✓The right step: First write one line: ∠ABF′+∠ABE=90∘+90∘=180∘, so F′, B, E are collinear. Only then add.
“Before joining pieces, check they are collinear”
From: Translation, Rotation and Reflection line
ExhibitRotating even though the two sides are not equal
✗The wrong step: In △ABC, AB=5 and AC=7. Rotate △ABP about A so that AB lands on AC.
What went wrong? Think first, then open
Diagnosis Rotation does not change lengths. Since AB=AC, B cannot land on C, so the rotated triangle does not fit against the original figure, and you get nothing out of it.
✓The right step: Before rotating, look for two equal segments that share a vertex. Their common endpoint is the center of rotation, and the angle between them is the angle of rotation.
“Equal segments sharing a vertex are what make a rotation work”
From: Translation, Rotation and Reflection line
ExhibitUsing a piece of a side instead of the whole side
✗The wrong step: DE∥BC, AD=3, DB=2, so DE:BC=3:2.
What went wrong? Think first, then open
Diagnosis In △ADE∼△ABC the corresponding sides are AD and AB. DB is only a piece of AB; it is not a side of either triangle.
✓The right step: AB=AD+DB=5, so the ratio of similarity is AD:AB=3:5, and DE:BC=3:5.
“Corresponding sides must be actual sides of the two triangles”
From: Building Similar Triangles line
ExhibitForgetting to square the area ratio
✗The wrong step: Two similar triangles have ratio of similarity 2:3, so their areas are also in the ratio 2:3.
What went wrong? Think first, then open
Diagnosis Area is a two-dimensional quantity, like “length × width”. If the base is scaled by 23, the height is scaled by 23 too, so the area is scaled by 23×23.
✓The right step: Area ratio = (ratio of similarity) squared =4:9.
“Lengths scale by the ratio, areas by its square”
From: Building Similar Triangles line
ExhibitUsing inscribed angles before checking the points are concyclic
✗The wrong step: In quadrilateral ABCD, ∠A=∠C=80∘, so A, B, C, D are concyclic and ∠ADB=∠ACB.
What went wrong? Think first, then open
Diagnosis Four points are concyclic when opposite angles are supplementary, not equal. 80∘+80∘=160∘=180∘, so these four points are not on one circle, and the inscribed angle theorem does not apply.
✓The right step: Before using circle properties, write down why the points are concyclic: opposite angles supplementary; or an exterior angle equal to the opposite interior angle; or two points on the same side seeing a segment at equal angles.
“First prove the points are concyclic, then use the circle”
From: Using Circle Properties line
ExhibitMixing up the two sides of a chord
✗The wrong step: P and Q are both on the circle, so they see the chord AB at equal angles: ∠APB=∠AQB.
What went wrong? Think first, then open
Diagnosis They are equal only when P and Q are on the same side of the chord AB (on the same arc). If they are on opposite sides, the two angles stand on two different arcs that together make the whole circle, so they are supplementary.
✓The right step: Same side: ∠APB=∠AQB. Opposite sides: ∠APB+∠AQB=180∘.
“Same arc, equal angles; opposite arcs, supplementary angles”
From: Using Circle Properties line
ExhibitKeeping both roots
✗The wrong step: From x(x+5)=36 we get x=4 or x=−9, so PA=4 or PA=9.
What went wrong? Think first, then open
Diagnosis x is the length of the segment PA, so it must be positive. −9 is a root of the equation, but not a solution of this geometry problem, and quietly dropping the minus sign makes no sense at all.
✓The right step: x=−9<0, so reject it. PA=4.
“Take every root of the equation back to the figure and check it”
From: Algebra for Geometry line
ExhibitIgnoring the range of x when finding a maximum
✗The wrong step: The inscribed rectangle has area S=−1.5x2+12x, and at the vertex S=24. The problem says the height of the rectangle is at most 3, so the maximum area is still 24.
What went wrong? Think first, then open
Diagnosis The vertex is at x=4, but the problem only allows 0<x≤3. If the vertex is outside the allowed range, its value is never reached.
✓The right step: On 0<x≤3, S increases as x increases, so the maximum is at x=3: S=3×7.5=22.5.
“First write down which values x can take, then look for the maximum or minimum”
From: Algebra for Geometry line
ExhibitThe sum is even, so both numbers are even
✗The wrong step: x+y is even, so x and y are both even.
What went wrong? Think first, then open
Diagnosis 3+5=8 is even too. An even sum only tells you that x and y have the same parity: both even or both odd. Forget the “both odd” half and your argument is missing a whole case.
✓The right step: x+y is even ⟺ x and y have the same parity. Then split into two cases: “both even” and “both odd”. And remember: 0 is even, and negative numbers are odd or even too (−3 is odd).
“Even = even + even, and also = odd + odd”
From: Parity line
ExhibitThe parity checks out, so it can be done
✗The wrong step: x2+y2=6: take x and y both odd; then the left side is even and so is the right side. The parity matches, so the equation has integer solutions.
What went wrong? Think first, then open
Diagnosis Matching parity is only a necessary condition. Actually try it: the squares are just 0,1,4,9,…, and no two of them add up to 6. In fact, look at remainders when dividing by 8: the sum of two odd squares leaves 2, while 6 leaves 6.
✓The right step: A parity argument can only show “it cannot be done”. To show “it can be done” you must give an actual method or an actual solution. When parity shows no contradiction, try again with a finer modulus.
“Parity can rule things out, but it can never rule them in”
From: Parity line
ExhibitThe product is a square, so each factor is a square
✗The wrong step: ab is a perfect square, so a and b are both perfect squares.
What went wrong? Think first, then open
Diagnosis 12×27=324=182, yet neither 12 nor 27 is a square. They share the prime factor 3: 12 has one 3, 27 has three, and together that makes four, an even number.
✓The right step: You need gcd(a,b)=1 first. When they are coprime, each prime belongs to only one of the numbers, so the exponents cannot combine. Only then does “ab is a square” imply “a and b are both squares”.
“Check coprime first, then split the square”
From: Prime Factor Analysis line
ExhibitForgetting negative factors and 1
✗The wrong step: (n−3)(n−5) is prime, so the smaller factor n−5=1 and n=6. That is the only answer.
What went wrong? Think first, then open
Diagnosis A prime p written as a product of two integers can be 1×p, but also (−1)×(−p). Here n−3=−1 gives n=2, and (−1)×(−3)=3 is prime too.
✓The right step: When you split into integer factors, list both signs: n−5=1 or n−3=−1, giving n=6 or n=2.
“Integer factor pairs come in positive and negative versions”
From: Prime Factor Analysis line
ExhibitNo contradiction, so it must have a solution
✗The wrong step: Divide both sides of x2+y2=2023 by 3: the left side can leave 0,1,2 and the right side leaves 1, so they match. Therefore the equation has integer solutions.
What went wrong? Think first, then open
Diagnosis When a modulus gives no contradiction, all it tells you is that this modulus does not help. Matching remainders are a long way from “really equal”. Switch to mod 4: the left side can only leave 0,1,2, and the right side leaves 3, a contradiction at once.
✓The right step: To prove there is no solution, one modulus that gives a contradiction is enough. To prove there is a solution, you must actually produce one.
“A modulus can prove “guilty”, never “innocent””
From: Choosing a Good Modulus line
ExhibitCancelling in a congruence without thinking
✗The wrong step: 2x≡2(mod4). Cancel 2 from both sides: x≡1(mod4).
What went wrong? Think first, then open
Diagnosis When x=3, 2x=6, which also leaves 2 on division by 4, but 3 does not leave 1 on division by 4. The 2 you cancelled shares a factor with the modulus 4, and cancelling like that loses solutions.
✓The right step: When you cancel 2, divide the modulus by gcd(2,4)=2 as well: x≡1(mod2), that is, x is odd.
“Only cancel a number that is coprime to the modulus; otherwise divide the modulus too”
From: Choosing a Good Modulus line
ExhibitAn inequality true only for large numbers, used for all numbers
✗The wrong step: Since x2<x2+x+7<(x+1)2, x2+x+7 lies between two consecutive squares, so it cannot be a perfect square.
What went wrong? Think first, then open
Diagnosis The right-hand inequality x2+x+7<x2+2x+1 simplifies to x>6. For x≤6 it is simply false: x=1 gives 1+1+7=9=32 and x=6 gives 36+6+7=49=72, both squares.
✓The right step: First solve for the range where the inequality holds (x>6) and squeeze only there; outside that range, check x=1,2,…,6 one by one. The answers are hiding exactly in these small cases.
“Estimation handles the big numbers; check the small ones by hand”
From: Estimation line
ExhibitBounding from one side only
✗The wrong step: k2−4k<(k−2)2: it is less than a square, so k2−4k is not a perfect square.
What went wrong? Think first, then open
Diagnosis There are plenty of squares less than (k−2)2: (k−3)2, (k−4)2… A bound on one side rules nothing out. When k=4, k2−4k=0=02 is a square.
✓The right step: Squeeze from both sides, and the two bounds must be consecutive squares: for k≥5, (k−3)2<k2−4k<(k−2)2, and only that shows it is not a square. Check k≤4 separately.
“You need both an upper and a lower bound, and they must be consecutive”
From: Estimation line
ExhibitTwo in the same box, but not the property you wanted
✗The wrong step: Take any 6 integers and put them into 5 boxes by their remainder when divided by 5. Two of them must leave the same remainder. So two of them must have a sum that is a multiple of 5.
What went wrong? Think first, then open
Diagnosis Two numbers with the same remainder have a difference that is a multiple of 5, but not necessarily a sum. For example, 1,6,11,16,21,26 all leave remainder 1, and any two of them add up to something with remainder 2. The boxes were right; the conclusion was read wrongly.
✓The right step: First work out exactly what “two in the same box” guarantees. Remainder boxes guarantee that two of the numbers have a difference that is a multiple of 5. The original claim about the “sum” is simply false: the 6 numbers above are a counterexample.
“Before building the boxes, ask what two in the same box would mean”
From: The Pigeonhole Principle line
ExhibitForgetting to add one to the average
✗The wrong step: 22 objects go into 7 boxes. 22÷7=3 remainder 1, so at least one box has 3 objects.
What went wrong? Think first, then open
Diagnosis That is not wrong, but it says too little. If every box had at most 3, there would be at most 21 objects, which is not enough room for 22. So you can guarantee 4.
✓The right step: Count by contradiction: suppose every box holds at most 3. Then there are at most 7×3=21<22 objects. So at least one box holds 4. When there is a remainder, add 1 to the quotient.
“Suppose no box is full enough, and see whether everything still fits”
From: The Pigeonhole Principle line
ExhibitThe color counts match, so it must be possible
✗The wrong step: Cut the 2nd cell of row 1 out of an 8×8 board and color it with 3-color diagonals: 21 cells each of A, B and C are left. Each 1×3 strip covers exactly one A, one B and one C, so 21 strips can certainly cover it.
What went wrong? Think first, then open
Diagnosis Coloring can only say “impossible”, never “possible”. Equal color counts are only a necessary condition: if the counts are wrong it certainly cannot be done, but if they are right it still might not be. In fact, color it with 3-color diagonals running the other way and that cell gives the game away: this board cannot be covered.
✓The right step: To prove that something can be done, you must actually do it (give a construction). Coloring proves “impossible”; “possible” takes hands-on work.
“Coloring only ever says no; to say yes, show a tiling”
From: Coloring and Assigning Values line
ExhibitA coloring that does not suit the tile
✗The wrong step: An 8×8 board with one corner cut out: can it be covered with 1×3 strips? Color it as a checkerboard: 31 black and 32 white are left. That is close, there is no contradiction, so it can probably be done.
What went wrong? Think first, then open
Diagnosis The checkerboard coloring is made to measure for 1×2 dominoes: each domino covers exactly one black and one white. A 1×3 strip may cover two black and one white, or two white and one black, so for this tile the coloring is not fixed and of course shows nothing.
✓The right step: When choosing a coloring, first ask: does every tile always cover the same number of cells of each color? For 1×3 strips, color diagonally with three colors so that each strip covers exactly one cell of each color.
“Look at the shape of the tile first, then decide how to color”
From: Coloring and Assigning Values line
ExhibitDividing without checking for zero
✗The wrong step: Solve (m−1)x=m−1 for x: divide both sides by m−1 to get x=1.
What went wrong? Think first, then open
Diagnosis When m=1, m−1=0, and you cannot divide by 0. The equation is then 0⋅x=0, and every number is a solution, not just x=1.
✓The right step: Split into cases first: if m=1, x=1; if m=1, x can be any number. Whenever you divide by an expression with letters in it, first ask whether it can be 0.
“Before dividing by a letter, ask whether it can be zero”
From: Cases and Enumeration line
ExhibitForgetting each case’s own conditions
✗The wrong step: An isosceles triangle has perimeter 12 and integer sides. Sorting by the length of the equal sides, they can be 1,2,3,4,5, so there are 5 triangles.
What went wrong? Think first, then open
Diagnosis Each case has to pass two tests. The base 12−2a must be positive, so a≤5; the two equal sides must add up to more than the base, 2a>12−2a, so a>3. With equal sides 1,2,3 there is no triangle at all (for example 3,3,6).
✓The right step: The equal sides can only be 4 or 5: (4,4,4) and (5,5,2), so 2 triangles. Splitting into cases only cuts the problem into pieces; the conditions inside each piece still have to be checked one by one.
“After working out each case, go back and check that case’s conditions”
From: Cases and Enumeration line
ExhibitChecking many cases and calling it a proof
✗The wrong step: n2+n+41 is prime for n=0,1,2,…,10 (41,43,47,53,…,151), so it is prime for every natural number n.
What went wrong? Think first, then open
Diagnosis However many cases you check, it is still only finitely many. In fact it stays prime all the way up to n=39, but for n=40, 402+40+41=1681=412, which is not prime. Without the step “from n to n+1”, a pattern can break at any moment.
✓The right step: Induction stands on two legs: ① the starting case holds; ② assuming case k holds, you deduce that case k+1 holds. Small cases are only for guessing; the recursion is what proves.
“Checking is guessing; the recursion is the proof”
From: Recursion and Induction line
ExhibitThe right recursion, the wrong starting values
✗The wrong step: The tilings of a 2×n strip satisfy f(n)=f(n−1)+f(n−2). That is the Fibonacci sequence 1,1,2,3,5,8, so a 2×6 strip has 8 tilings.
What went wrong? Think first, then open
Diagnosis A recursion only tells you “how each term comes from the two before it”; it does not tell you where to start. Here f(1)=1 and f(2)=2 (both dominoes upright, or both lying flat), not 1,1.
✓The right step: Count the starting values by hand first: f(1)=1, f(2)=2. Then use the recursion: 3,5,8,13. So f(6)=13. A recursion that uses the two previous terms needs two starting values.
“If the recursion uses several earlier terms, count that many starting values”
From: Recursion and Induction line
ExhibitTaking a “smallest” that does not exist
✗The wrong step: Among all positive fractions, take the smallest one and call it q…
What went wrong? Think first, then open
Diagnosis There is no smallest positive fraction: however small q is, 2q is a positive fraction too, and smaller. Reasoning about something that does not exist proves nothing.
✓The right step: First ask: “does a smallest one exist?”. Among finitely many numbers there is always a largest and a smallest; any collection of positive integers (even infinitely many) has a smallest. In any other situation, prove it exists first.
“Make sure the extreme one exists before you take it”
From: The Extremal Principle line
ExhibitAssuming there is only one largest
✗The wrong step: Let a be the largest number on the circle. Then both its neighbors are smaller than it, so…
What went wrong? Think first, then open
Diagnosis Several numbers can tie for largest. The neighbors are only not larger than it, and they may well be equal to it. In fact, the conclusion of the circle problem is exactly that “they are all equal”.
✓The right step: Write “≤”, not “<”: the neighbors are ≤a, so their average is ≤a, and equality holds only if both neighbors equal a.
“The largest need not be unique”
From: The Extremal Principle line
ExhibitCounting twice, but not counting the same thing
✗The wrong step: 5 people each shake hands 3 times, so there are 5×3=15 handshakes.
What went wrong? Think first, then open
Diagnosis Every handshake involves two people, so in “how many times did each person shake hands” it is counted twice. 15 counts handshake-ends, not handshakes. The real number would be 15÷2, which is not a whole number!
✓The right step: First say how many times each thing is counted: number of handshakes ×2= the sum of everyone's handshake counts. So that sum must be even, and “5 people each shaking hands 3 times” simply cannot happen.
“Before you count twice, ask how many times each thing is counted”
From: From Local to Global line
ExhibitTrue in a special case, so you think it is proved
✗The wrong step: When P is the midpoint of arc BC, PA=PB+PC, so PA=PB+PC for every point P on the arc.
What went wrong? Think first, then open
Diagnosis Only one position was checked. Something true in a special position may well be false somewhere else. For example, “the altitude and the median coincide” is true in an isosceles triangle but false in a general one.
✓The right step: Specializing helps you find out what to prove. Once you know, write a proof for P in a general position (here: Ptolemy’s theorem, or cut off PD=PB on PA).
“Special values find the answer; they do not prove it”
From: Generalize and Specialize line
✗The wrong step: To find k in a2(b−c)+b2(c−a)+c2(a−b)=k(a−b)(b−c)(c−a), take a=b=1, c=0: both sides are 0, so k can be anything.
What went wrong? Think first, then open
Diagnosis These values make both sides 0 at once, and 0=k⋅0 holds for every k, so you learn nothing.
✓The right step: Choose values that make both sides nonzero, for example a=0, b=1, c=2: the left side is −2 and the right side is 2k, so k=−1.
“Be special, but not so special that both sides become 0”
From: Generalize and Specialize line
ExhibitThe first few cases work, so it must always work
✗The wrong step: Put n points on a circle and join every pair with a chord. The circle is cut into 1,2,4,8,16 regions, so the formula is 2n−1.
What went wrong? Think first, then open
Diagnosis Count n=6 by hand: you get 31 regions, not 32. Five examples were right and the sixth is wrong. Examples can help you guess; they cannot prove anything for you.
✓The right step: Once a conjecture is written down, there are only two ways forward: prove it, or find a counterexample. Here the true number of regions is 1+2n(n−1)+24n(n−1)(n−2)(n−3), which happens to equal 2n−1 exactly when n≤5.
“However many examples you have, they are not a proof”
From: Guess, Then Prove line
ExhibitEven forty examples are not enough
✗The wrong step: n2+n+41 is prime for n=0,1,2,…,39, so it is always prime.
What went wrong? Think first, then open
Diagnosis When n=40, 402+40+41=40×41+41=412, which is composite. You can even see it without calculating: when n=41, all three terms are multiples of 41.
✓The right step: A claim that something “always holds” needs a reason that works for a general n. If you cannot find a reason, look hard for a counterexample.
“A conjecture is either proved or knocked down by a counterexample”
From: Guess, Then Prove line