Practice Proof (Intuition) in Math

Use these practice problems to test your method after reviewing the concept explanation and worked examples.

Worksheet PDF Free Answer-key PDF Family

Quick Recap

The informal, intuitive sense of why a mathematical statement must be true — the "aha" that precedes and motivates a formal proof.

A chain of reasoning that convinces you something MUST be true.

Showing a random 20 of 50 problems.

Example 1

easy
Build intuition for the statement: 'For any integer n, n(n+1) is even.' Explain informally why this must be true.

Example 2

medium
In the inductive step for ∑i=1ni=n(n+1)2, assuming it for n=k, what do you add to both sides to reach n=k+1? Give the term.

Example 3

easy
The contrapositive of 'if P then Q' is 'if not Q then not P' and is logically equivalent. Give 1 if equivalent.

Example 4

medium
Build intuition for why 2 is irrational before writing the formal proof. What is the core contradiction?

Example 5

hard
Why does the principle of strong induction allow assuming P(1),P(2),…,P(k) all at once when proving P(k+1)? Build intuition with the prime factorization theorem.

Example 6

easy
How many cases does a proof by cases on the parity of an integer need? Give the number.

Example 7

easy
How many counterexamples are needed to disprove a universal statement of the form 'for all x, P(x)'?

Example 8

easy
The proof technique that assumes the opposite and derives a contradiction is called proof by _____.

Example 9

easy
The sum of two even numbers is even. Writing 2a+2b=2(a+b), what common factor proves it? Give the factor.

Example 10

challenge
In a flawed proof '1=2', both sides are divided by (a−b) after setting a=b. What is the value of a−b that invalidates this step?

Example 11

medium
Give a counterexample to the claim 'every odd integer is prime'.

Example 12

hard
If 'all crows are black' is true and you see a non-black object, what can you conclude about the object?

Example 13

medium
Sketch the intuition behind the pigeonhole principle: if n+1 pigeons fit into n holes, what must happen?

Example 14

challenge
A proof shows n3−n is divisible by 3 for all integers n. Factoring gives (n−1)n(n+1) — how many consecutive integers is that product, guaranteeing a multiple of 3?

Example 15

medium
To prove a number is divisible by 6, it suffices to show divisibility by which two coprime numbers? Give their product.

Example 16

easy
The negation of 'for all x, P(x)' is 'there exists x such that _____'.

Example 17

easy
True or false: 'if P then Q' is logically equivalent to its contrapositive 'if not Q then not P'.

Example 18

medium
A valid proof needs each step to follow. In 'a=b, so a2=ab', what operation was applied to both sides? Give the multiplier.

Example 19

easy
Is the statement 'for some n, n2=n' true? Give an example.

Example 20

medium
In an 'if and only if' proof, how many directions must be shown? Give the number.
← Back to Proof (Intuition) Worked Examples Formula Explained