Structure of proof and proof by exhaustion

Structure of proof and proof by exhaustion Flashcards

Spec 1.1–2 · Edexcel International A Level Maths: Flashcards

Studying this course? Keep your progress in one place.

Flip each card. Be honest: the ones you mark Not yet come back first.

12 cards

Tap a card to flip it. Swipe right if you knew it, left if not.

See all 12 cards
What is a mathematical proof?
A logical argument from given assumptions, through justified steps, to a conclusion.
What are the main parts of the structure of a proof?
State what is to be proved, state assumptions, give logical steps, and write a clear conclusion.
What is proof by exhaustion?
Checking every possible case and showing that the statement is true in each one.
When can proof by exhaustion be used?
Only when there is a finite number of cases that can all be listed and checked.
What do you write at the end of a proof by exhaustion?
A conclusion saying the statement is true because it holds in every case.
If one case fails in an exhaustive check, what does that show?
The statement is false.
Why does checking n=1n=1 to 55 not prove a statement for all positive integers?
There are infinitely many other cases that have not been checked.
x,yx,y are odd positive integers less than 77. What values can each take?
11, 33 or 55
List the possible values of x+yx+y for odd positive integers less than 77.
2,4,6,8,102,4,6,8,10, all divisible by 22
Evaluate n2+nn^2+n for n=1,2,3,4,5n=1,2,3,4,5.
2,6,12,20,302,6,12,20,30
Why must every case be shown, not just the answers?
So that the proof is complete and each step can be seen to be justified.
n2+n+11n^2+n+11 for n=10n=10: is it prime?
No. It is 121=112121=11^2.

Flashcards