Free Online Flashcard Deck

04 Proof Techniques Free Online FlashCards

Study 04 Proof Techniques with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.

12 cards
01
Front

What is a mathematical proof?

Back

A logically valid argument showing that a conclusion follows from definitions, assumptions, and established results for every object covered by the statement.

02
Front

What is the contrapositive of P  ⟹  QP\implies Q?

Back

The contrapositive of P  ⟹  QP\implies Q is ¬Q  ⟹  ¬P\neg Q\implies\neg P. These implications are logically equivalent.

03
Front

How does a direct proof establish P  ⟹  QP\implies Q?

Back

Assume PP, introduce arbitrary objects satisfying the hypotheses, apply definitions or known results, and derive QQ.

04
Front

How can you prove that the sum of two even integers is even?

Back

Write a=2ma=2m and b=2nb=2n for integers m,nm,n. Then a+b=2(m+n)a+b=2(m+n), so the sum is even.

05
Front

What is a proof by contrapositive?

Back

Prove the logically equivalent statement ¬Q  ⟹  ¬P\neg Q\implies\neg P instead of proving P  ⟹  QP\implies Q directly.

06
Front

What is the structure of proof by contradiction?

Back

Assume the statement is false, derive an impossibility, and conclude that the negation is impossible; therefore the original statement is true.

07
Front

How does the contrapositive prove that odd n2n^2 implies odd nn?

Back

Assume nn is not odd, so n=2kn=2k. Then n2=4k2=2(2k2)n^2=4k^2=2(2k^2) is even, proving the contrapositive.

08
Front

What requirement makes a proof by cases complete?

Back

A proof by cases divides all possibilities into exhaustive cases and proves the conclusion separately within each case.

09
Front

Why is n2−nn^2-n even for every integer nn?

Back

For even nn, write n=2kn=2k; for odd nn, n−1n-1 is even. Thus n(n−1)=n2−nn(n-1)=n^2-n is even in both exhaustive cases.

10
Front

What is a counterexample?

Back

A single valid example that shows a universal claim is false. For an implication, it must satisfy the hypothesis and fail the conclusion.

11
Front

Give a counterexample to divisibility by 44 implying divisibility by 88.

Back

The integer 44 is divisible by 44 but not by 88, so it disproves the implication.

12
Front

Why can examples not prove a universal claim?

Back

A universal claim requires a general argument over arbitrary allowed objects; checking finitely many examples only shows that those tested cases work.