Course home

1.1 Proof by Contradiction

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92

Question 83

In a specific cryptographic protocol, a validation factor $V$ is calculated for prime numbers $p$ using the formula

V(p) = p^2 - 1

Prove that for every prime number $p$ in the range $10 < p < 20$ , the validation factor $V (p)$ is a multiple of 24.

[3]

ii.

A software engineer claims that for any non-negative integer $n$ , the processing time $T(n) = n^2 + 3n + 5$ microseconds is never a multiple of 2. Use proof by contradiction to show that this claim is correct.

[4]

Markscheme

1.1 Proof by Contradiction Questions

A Level
Maths
1.1 Proof by Contradiction

107 exam-style questions on Edexcel A Level Maths 1.1 Proof by Contradiction. Each one has a worked solution and a mark scheme showing where the marks go.

1.1 Proof by Contradiction

Question bank

1.1 Proof by Contradiction

Easy Medium Hard

Question 83

In a specific cryptographic protocol, a validation factor $V$ is calculated for prime numbers $p$ using the formula

V(p) = p^2 - 1

Prove that for every prime number $p$ in the range $10 < p < 20$ , the validation factor $V (p)$ is a multiple of 24.

[3]

ii.

[4]

Markscheme

1.1 Proof by Contradiction Questions

A Level
Maths
1.1 Proof by Contradiction

107 exam-style questions on Edexcel A Level Maths 1.1 Proof by Contradiction. Each one has a worked solution and a mark scheme showing where the marks go.