Proof by contradiction

Proof by contradiction Flashcards

Spec 1.1 · Edexcel 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.

14 cards

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

See all 14 cards
What is proof by contradiction?
Assume the statement is false, then show this leads to something impossible, so the statement must be true.
What must you do first in a contradiction proof?
State the assumption: the opposite of what you want to prove.
Define a rational number.
A number that can be written as ab\frac{a}{b} with a,ba,b integers and b≠0b\neq0.
Why assume ab\frac{a}{b} is in lowest terms?
So that 'a and b both have a factor 2' is a genuine contradiction.
If a2a^2 is even, what follows?
aa is even, since the square of an odd number is odd.
Start of the proof that 2\sqrt2 is irrational?
Assume 2=ab\sqrt2=\frac{a}{b} in lowest terms, so a2=2b2a^2=2b^2.
What contradiction arises for 2\sqrt2?
aa and bb are both even, contradicting lowest terms.
If a2a^2 is a multiple of 3, what follows?
aa is a multiple of 3, as (3k±1)2(3k\pm1)^2 is never a multiple of 3.
Define NN in the proof of infinitely many primes.
N=p1p2⋯pn+1N=p_1p_2\cdots p_n+1.
What is the remainder when NN is divided by any listed prime?
1
Why does NN give a contradiction?
NN is prime or has a prime factor, and in each case that prime is not in the list.
State the opposite of 'there are infinitely many primes'.
There are finitely many primes.
What are typical contradictions?
Even equals odd; fraction not in lowest terms; a multiple of 5 equals 1.
Is NN always prime in Euclid's proof?
No. 2×3×5×7×11×13+1=59×5092\times3\times5\times7\times11\times13+1=59\times509.

Flashcards