Structure of proof and proof by exhaustion 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 to not prove a statement for all positive integers?
- There are infinitely many other cases that have not been checked.
- are odd positive integers less than . What values can each take?
- , or
- List the possible values of for odd positive integers less than .
- , all divisible by
- Evaluate for .
- 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.
- for : is it prime?
- No. It is .