Skip to content

Course home

Sign up

1.1 Proof

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990
Question 6
45%

A student named Elena makes the claim that there is a finite set of prime numbers P={p1,p2,p3,…,pk}P = \{p_1, p_2, p_3, \dots, p_k\}P={p1​,p2​,p3​,…,pk​} where pk p_k\,pk​ is the largest prime. Use the method of proof by contradiction to show that Elena's claim is incorrect, and thus prove that there are infinitely many prime numbers.

[6]
Markscheme

1.1 Proof Questions

  1. A Level
  2. /Maths
  3. /1.1 Proof

132 exam-style questions on OCR (MEI) A Level Maths 1.1 Proof, covering 1.1.1 Structure of mathematical proof, 1.1.2 Disproof by counter example, 1.1.3 Proof by contradiction (A-level only), and 1.1 Proof. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank