Proof by Exhaustion (Edexcel A-Level Mathematics): Flashcards
📚Flashcards
Practise the cards
12 cards from this deck
ShowHide
Practise the cards
12 cards from this deck
Proof by exhaustion considers
Proof by exhaustion considers
Every possible case
Proof by exhaustion Step 1
Proof by exhaustion Step 1
Identify the statement to prove and possible cases
Proof by exhaustion Step 2
Proof by exhaustion Step 2
Break into finite distinct cases covering all scenarios
Proof by exhaustion Step 3
Proof by exhaustion Step 3
Prove statement for each case individually
Proof by exhaustion Step 4
Proof by exhaustion Step 4
Conclude statement is true for all cases
Single-digit odd numbers
Single-digit odd numbers
1, 3, 5, 7, 9
Sum of two odd numbers is
Sum of two odd numbers is
Always even
Prove 47 prime by exhaustion: method
Prove 47 prime by exhaustion: method
Check every possible factor for integer result
Upper limit when checking if is prime
Upper limit when checking if is prime
Last integer less than
Check 47 factors up to
Check 47 factors up to
6 (integer below )
When checking primality, start at
When checking primality, start at
2 (first prime number)
Why 47 is prime
Why 47 is prime
All from 2 to are not factors