Lesson 1.1.1
1.1.1 Structure of mathematical proof and methods of proof Quiz: Pearson Edexcel Maths, Unit 1
20 questions
In partnership with Revision Ninja
Lesson 1.1.1, Structure of mathematical proof and methods of proof: 20 multiple choice questions for the Pearson Edexcel Maths (9MA0), Unit 1: Proof, written with Revision Ninja.
Host it live on the board and students join with a game code on their own devices, or revise alone with Free Play. The answers are revealed in the game.
The 20 questions
-
What do we call a mathematical statement that has been proven true?
- Conjecture
- Axiom
- Theorem
- Hypothesis
-
What term describes an unproven mathematical statement that is believed to be true?
- Lemma
- Corollary
- Theorem
- Conjecture
-
Which proof method demonstrates a statement is true for all cases by systematically checking every possibility?
- Exhaustion
- Deduction
- Induction
- Contradiction
-
What proof method assumes the negation of the statement to arrive at a logical absurdity?
- Contradiction
- Exhaustion
- Counterexample
- Induction
-
What single example is sufficient to disprove a universal mathematical conjecture?
- Counterexample
- Base case
- Contradiction
- Anomalous root
-
What is the primary method of proof used in A-level maths to move logically from known facts?
- Estimation
- Deduction
- Observation
- Induction
-
Which proof type is specifically used to prove statements involving positive integers n?
- Contradiction
- Exhaustive testing
- Exhaustion
- Mathematical induction
-
In proof by induction, what is the first explicit value of n you must test?
- n = 2
- n = 1
- n = k
- n = 0
-
When testing a general algebraic statement, how do we write an even integer algebraically?
- 2n - 3
- 2n
- 2n + 1
- n^2
-
How do we algebraically represent an odd integer where n is an integer?
- 3n
- 2n + 1
- n^2 + 1
- 2n
-
To prove the sum of two even numbers is even, what expression should you add?
- m + n
- 2m + 2n + 1
- 4m + 2n
- 2m + 2n
-
What is the assumption made about n in the inductive step of mathematical induction?
- Assume false for n = k
- Assume true for n = k
- Assume true for n = k + 1
- Assume true for n = 1
-
After assuming a statement is true for n = k, what value of n must you prove it for next?
- n = k + 2
- n = k + 1
- n = k - 1
- n = 2k
-
To disprove that all prime numbers are odd, what single number is the counterexample?
- 2
- 9
- 3
- 1
-
What foundational self-evident truth in mathematics requires no proof?
- Theorem
- Axiom
- Lemma
- Corollary
-
What do we call a minor proved result used primarily as a stepping stone to a larger theorem?
- Conjecture
- Axiom
- Corollary
- Lemma
-
What term describes a proposition that follows easily from the proof of another theorem?
- Lemma
- Corollary
- Conjecture
- Axiom
-
When using proof by contradiction, what is your ultimate goal to reach?
- A counterexample
- A contradiction
- A positive integer
- A factorization
-
If you show a statement holds for all integers between 1 and 4 by testing each, what proof method is this?
- Contradiction
- Exhaustion
- Deduction
- Induction
-
What expression represents the square of any odd integer?
- 4k^2 + 4k + 1
- 4k^2 + 1
- 2k^2 + 1
- 2k + 1
Related quizzes
- Vectors in two and three dimensions Quiz · 10.1.1 · 20 questions
- Laws of indices for all rational exponents Quiz · 2.1.1 · 20 questions
- Straight lines and their equations Quiz · 3.1.1 · 20 questions
- Binomial expansion Quiz · 4.1.1 · 20 questions
- Sine, cosine and tangent for all angles Quiz · 5.1.1 · 20 questions
- Exponential function e^x and its graph Quiz · 6.1.1 · 20 questions
- Derivative as the gradient of a tangent Quiz · 7.1.1 · 20 questions
- Fundamental Theorem of calculus and integration as reverse differentiation Quiz · 8.1.1 · 20 questions
- Locating roots by change of sign Quiz · 9.1.1 · 20 questions
- Fundamental quantities and units in the S.I. Quiz · M6.1.1 · 20 questions