1.1.3 Proof by contradiction (A-level only)

Easy Medium Hard

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

Question 42

In the field of cryptography, certain protocols rely on the property that specific constants are not rational. Let $S\,$ be a constant defined by the equation $S^2 - 13 = 0$ . Given that $S > 0$ , prove by contradiction that $S\,$ is an irrational number.

(You may assume that if $n^2\,$ is a multiple of 13, then $n\,$ is also a multiple of 13 for any integer $n$ .)

[6]

1.1.3 Proof by contradiction (A-level only) Questions

A Level
Maths
1.1.3 Proof by contradiction (A-level only)

A Level
Maths OCR (MEI)
Question bank

1.1.3 Proof by contradiction (A-level only)

Easy Medium Hard

Question 42

(You may assume that if $n^2\,$ is a multiple of 13, then $n\,$ is also a multiple of 13 for any integer $n$ .)

[6]

1.1.3 Proof by contradiction (A-level only) Questions