Practice Proofs in Math

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

Quick Recap

A mathematical proof is a rigorous logical argument that demonstrates the truth of a statement beyond doubt, proceeding from accepted axioms and previously proven results through valid inference rules.

It is not guessing the answer; it is proving why the answer must be true.

Showing a random 20 of 50 problems.

Example 1

challenge
Prove: for any sets, AโІBA \subseteq B if and only if AโˆฉB=AA \cap B = A.

Example 2

hard
Prove by induction: 2n>n2^n > n for all nโ‰ฅ1n \ge 1.

Example 3

easy
A proof by contradiction begins by assuming what?

Example 4

medium
Prove: if xx is rational and yy is irrational, then x+yx+y is irrational.

Example 5

easy
Prove directly: The sum of two even integers is even.

Example 6

medium
Prove: if aa and bb are both odd, then abab is odd.

Example 7

medium
Prove by contradiction: there is no largest integer.

Example 8

medium
Prove: for all integers nn, n2+nn^2+n is even.

Example 9

medium
Prove: if aโˆฃba \mid b, then aโˆฃbca \mid bc for every integer cc.

Example 10

easy
Prove directly: if nn is even, then n+2n+2 is even.

Example 11

medium
Prove: if n2n^2 is even, then nn is even (use contrapositive).

Example 12

medium
Prove by contrapositive: if n2n^2 is even, then nn is even.

Example 13

easy
Prove: the sum of two odd numbers is even.

Example 14

medium
Disprove by counterexample: 'For all integers nn, n2>nn^2 > n.'

Example 15

medium
Prove: the sum of the first nn odd numbers equals n2n^2 โ€” outline the method that fits best.

Example 16

medium
What is the converse of 'if it rains, the ground is wet', and is it always true?

Example 17

hard
Prove: there are infinitely many primes (Euclid's argument).

Example 18

easy
What name do we give a statement that has been proven from axioms?

Example 19

easy
What proof technique uses 'base case' and 'inductive step'?

Example 20

medium
Prove directly: For any integer nn, if nn is odd then n2n^2 is odd.