Proof

165 questions · 20 question types identified

Sort by: Question count | Difficulty
Counter example to disprove statement

A question is this type if and only if it asks to show a statement is false by finding a specific counter example that contradicts the claim (e.g., 'if p is prime then 2p+1 is prime' or 'n² + 3n + 1 is always prime').

35 Moderate -0.6
21.2% of questions
Show example »
Show that the following statement is false. $$x - 5 = 0 \Leftrightarrow x^2 = 25$$ [2]
View full question →
Easiest question Easy -1.8 »
1 Celia states that \(n ^ { 2 } + 2 n + 10\) is always odd when \(n\) is a prime number. Prove that Celia's statement is false.
View full question →
Hardest question Standard +0.8 »
Prove or disprove each of the following statements:
  1. If \(n\) is an integer, then \(3n^2 - 11n + 13\) is a prime number. [2]
  2. If \(x\) is a real number, then \(x^2 - 8x + 17\) is positive. [2]
  3. If \(p\) and \(q\) are irrational numbers, then \(pq\) is irrational. [2]
View full question →
Divisibility proof for all integers

A question is this type if and only if it asks to prove that an expression involving n (e.g., n³ - n, n² + 2n) is always divisible by a specific number or is always even/odd for all integers n.

19 Moderate -0.1
11.5% of questions
Show example »
Prove that, when \(n\) is an integer, \(n^3 - n\) is always even. [3]
View full question →
Easiest question Moderate -0.8 »
Prove that, when \(n\) is an integer, \(n^3 - n\) is always even. [3]
View full question →
Hardest question Standard +0.8 »
  1. Show that, if \(n\) is a positive integer, then \((x^n - 1)\) is divisible by \((x - 1)\). [1]
  2. Hence show that, if \(k\) is a positive integer, then \(2^{8k} - 1\) is divisible by 17. [4]
View full question →
Algebraic inequality proof

A question is this type if and only if it asks to prove an algebraic inequality (e.g., expressions involving x, y, a, b) using algebraic manipulation, completing the square, or rearrangement to show one expression is greater than or equal to another.

15 Standard +0.0
9.1% of questions
Show example »
Prove that \(x - 10 < x^2 - 5x\) for all real values of \(x\). [4]
View full question →
Easiest question Easy -1.2 »
Use the triangle in Fig. 4 to prove that \(\sin^2 \theta + \cos^2 \theta = 1\). For what values of \(\theta\) is this proof valid? [3] \includegraphics{figure_4}
View full question →
Hardest question Challenging +1.2 »
Given that \(y \in \mathbb{R}\), prove that $$(2 + 3y)^4 + (2 - 3y)^4 \geq 32$$ Fully justify your answer. [6 marks]
View full question →
Logical statements and converses

A question is this type if and only if it asks to write down the converse of a statement, determine if statements are true/false/either, or identify correct logical connectives (⇒, ⇐, ⇔).

12 Easy -1.4
7.3% of questions
Show example »
1 Is the following statement true or false? Justify your answer. $$x ^ { 2 } = 4 \text { if and only if } x = 2$$
View full question →
Easiest question Easy -2.5 »
Which of these statements is correct? Tick one box. [1 mark] \(x = 2 \Rightarrow x^2 = 4\) \(x^2 = 4 \Rightarrow x = 2\) \(x^2 = 4 \Leftrightarrow x = 2\) \(x^2 = 4 \Rightarrow x = -2\)
View full question →
Hardest question Moderate -0.8 »
1 Explain why each of the following statements is false. State in each case which of the symbols ⟹, ⟸ or ⇔ would make the statement true.
  1. ABCD is a square ⇔ the diagonals of quadrilateral ABCD intersect at \(90 ^ { \circ }\)
  2. \(x ^ { 2 }\) is an integer \(\Rightarrow x\) is an integer
View full question →
Contradiction proof of inequality

A question is this type if and only if it asks to prove an inequality (typically involving positive real numbers) using proof by contradiction, starting by assuming the opposite inequality holds.

10 Standard +0.1
6.1% of questions
Show example »
Prove by contradiction the following proposition: When \(x\) is real and positive, \(x + \frac{81}{x} \geq 18\). [4]
View full question →
Easiest question Moderate -0.8 »
11 Line 8 states that \(\frac { a + b } { 2 } \geqslant \sqrt { a b }\) for \(a\), \(b \geqslant 0\). Explain why the result cannot be extended to apply in each of the following cases.
  1. One of the numbers \(a\) and \(b\) is positive and the other is negative.
  2. Both numbers \(a\) and \(b\) are negative.
View full question →
Hardest question Standard +0.8 »
10

  1. 10

  2. 10
  3. Given that \(a\) and \(b\) are distinct positive numbers, use proof by contradiction to prove that $$\frac { a } { b } + \frac { b } { a } > 2$$ \section*{END OF SECTION A
    TURN OVER FOR SECTION B}
View full question →
Contradiction proof of irrationality

A question is this type if and only if it asks to prove that a specific number (e.g., √7, √3, log₂3) is irrational using proof by contradiction, typically assuming it can be written as p/q.

10 Standard +0.4
6.1% of questions
Show example »
Prove by contradiction that \(\sqrt{7}\) is irrational. [5]
View full question →
Easiest question Moderate -0.3 »
  1. Use proof by contradiction to prove that \(\sqrt { 7 }\) is irrational.
    (You may assume that if \(k\) is an integer and \(k ^ { 2 }\) is a multiple of 7 then \(k\) is a multiple of 7 )
View full question →
Hardest question Standard +0.8 »
  1. (i) Find, as natural logarithms, the solutions of the equation
$$\mathrm { e } ^ { 2 x } - 8 \mathrm { e } ^ { x } + 15 = 0$$ (ii) Use proof by contradiction to prove that \(\log _ { 2 } 3\) is irrational.
View full question →
Contradiction proof about integers

A question is this type if and only if it asks to prove by contradiction that no integers exist satisfying a given equation or condition (e.g., 3x² + 2xy - y² = 25 has no positive integer solutions).

9 Standard +0.8
5.5% of questions
Show example »
12 Prove by contradiction that 3 is the only prime number which is 1 less than a square number.
View full question →
Easiest question Standard +0.3 »
  1. (i) Show that \(k ^ { 2 } - 4 k + 5\) is positive for all real values of \(k\).
    (ii) A student was asked to prove by contradiction that "There are no positive integers \(x\) and \(y\) such that \(( 3 x + 2 y ) ( 2 x - 5 y ) = 28\) " The start of the student's proof is shown below.
Assume that positive integers \(x\) and \(y\) exist such that $$\left. \begin{array} { c } ( 3 x + 2 y ) ( 2 x - 5 y ) = 28 \\ \text { If } 3 x + 2 y = 14 \text { and } 2 x - 5 y = 2 \\ 3 x + 2 y = 14 \\ 2 x - 5 y = 2 \end{array} \right\} \Rightarrow x = \frac { 74 } { 19 } , y = \frac { 22 } { 19 } \text { Not integers }$$ Show the calculations and statements needed to complete the proof.
View full question →
Hardest question Challenging +1.2 »
12 Prove by contradiction that 3 is the only prime number which is 1 less than a square number.
View full question →
Rational and irrational number properties

A question is this type if and only if it asks to prove or disprove statements about sums, products, or quotients of rational and irrational numbers (e.g., 'if a is rational and b is irrational, then a+b is irrational').

9 Moderate -0.5
5.5% of questions
Show example »
Prove that the sum of a rational number and an irrational number is always irrational. [5 marks]
View full question →
Easiest question Easy -1.8 »
4 Millie is attempting to use proof by contradiction to show that the result of multiplying an irrational number by a non-zero rational number is always an irrational number. Select the assumption she should make to start her proof.
Tick ( \(\checkmark\) ) one box. Every irrational multiplied by a non-zero rational is irrational. □ Every irrational multiplied by a non-zero rational is rational. □ There exists a non-zero rational and an irrational whose product is irrational. □ There exists a non-zero rational and an irrational whose product is rational. □
View full question →
Hardest question Standard +0.8 »
Prove that the sum of a rational number and an irrational number is always irrational. [5 marks]
View full question →
Proof by exhaustion with cases

A question is this type if and only if it requires proving a statement by checking all possible cases systematically, often involving modular arithmetic (e.g., n = 2k or n = 2k+1, or n ≡ 0, 1, 2 mod 3) or a finite set of values.

8 Moderate -0.6
4.8% of questions
Show example »
5 Prove that, for integer values of \(n\) such that \(0 \leq n < 4\) $$2 ^ { n + 2 } > 3 ^ { n }$$
View full question →
Identifying errors in proofs

A question is this type if and only if it presents a student's incorrect proof or solution and asks to identify the mistake(s) and provide a correct version.

7 Standard +0.6
4.2% of questions
Show example »
5 A student's attempt to prove by contradiction that there is no largest prime number is shown below.
If there is a largest prime, list all the primes.
Multiply all the primes and add 1.
The new number is not divisible by any of the primes in the list and so it must be a new prime. The proof is incorrect and incomplete.
Write a correct version of the proof.
View full question →
Parity and evenness proofs

A question is this type if and only if it asks to prove that an expression is always even or odd, or involves proving statements about products/sums of consecutive integers being even.

6 Moderate -1.0
3.6% of questions
Show example »
1 Prove that the product of consecutive integers is always even.
View full question →
Proof involving squares and modular forms

A question is this type if and only if it asks to prove that squares of integers have specific modular properties (e.g., n² is always 0 or 1 mod 3, or n² + 2 is never divisible by 4).

6 Standard +0.4
3.6% of questions
Show example »
Prove that \(n\) is a prime number greater than \(5 \Rightarrow n^4\) has final digit \(1\) [5 marks]
View full question →
Existence of greatest/smallest element

A question is this type if and only if it asks to prove by contradiction that there is no greatest/smallest element in a set (e.g., no greatest odd integer, no smallest value in an interval).

5 Moderate -0.7
3.0% of questions
Show example »
3. Prove by contradiction that there is no greatest odd integer.
View full question →
Proof by exhaustion with table

A question is this type if and only if it provides a table to fill in and asks to prove a statement by exhaustively checking all valid combinations of constrained integer variables (e.g., a + b + c = 10 with c = b + 2).

3 Easy -1.4
1.8% of questions
Show example »
Given that \(n\) is an integer such that \(1 \leq n \leq 4\), prove that \(2n^2 + 5\) is a prime number. [3]
View full question →
Conditional divisibility with if-then

A question is this type if and only if it asks to prove a conditional statement of the form 'if n³ is a multiple of k, then n is a multiple of k' or similar divisibility implications, often using contradiction.

3 Standard +0.8
1.8% of questions
Show example »
16. Prove by contradiction that if \(n ^ { 2 }\) is a multiple of \(3 , n\) is a multiple of 3 .
View full question →
Prime number conjectures

A question is this type if and only if it involves proving or disproving statements about prime numbers, such as '2ⁿ - 1 is prime' or 'sum of consecutive primes is a multiple of 5'.

3 Standard +0.4
1.8% of questions
Show example »
Shona makes the following claim. "\(n\) is an even positive integer greater than \(2 \Rightarrow 2^n - 1\) is not prime" Prove that Shona's claim is true. [4]
View full question →
Pythagorean triples and number patterns

A question is this type if and only if it involves proving properties of Pythagorean triples or showing that certain integer expressions form specific patterns (e.g., 2t, t²-1, t²+1).

2 Standard +0.3
1.2% of questions
Show example »
5 Positive integers \(a , b\) and \(c\) are said to form a Pythagorean triple if \(a ^ { 2 } + b ^ { 2 } = c ^ { 2 }\).
  1. Given that \(t\) is an integer greater than 1 , show that \(2 t , t ^ { 2 } - 1\) and \(t ^ { 2 } + 1\) form a Pythagorean triple.
  2. The two smallest integers of a Pythagorean triple are 20 and 21. Find the third integer. Use this triple to show that not all Pythagorean triples can be expressed in the form \(2 t , t ^ { 2 } - 1\) and \(t ^ { 2 } + 1\).
View full question →
Function properties proof

A question is this type if and only if it asks to prove properties of functions such as showing a function is odd, even, or proving that f(x) > 0 for all x.

2 Moderate -0.6
1.2% of questions
Show example »
2. $$f ( x ) = 1 - \frac { 3 } { x + 2 } + \frac { 3 } { ( x + 2 ) ^ { 2 } } , x \neq - 2$$
  1. Show that \(\mathrm { f } ( x ) = \frac { x ^ { 2 } + x + 1 } { ( x + 2 ) ^ { 2 } } , x \neq - 2\).
  2. Show that \(x ^ { 2 } + x + 1 > 0\) for all values of \(x\).
  3. Show that \(\mathrm { f } ( x ) > 0\) for all values of \(x , x \neq - 2\).
View full question →
Geometric proof using coordinates

A question is this type if and only if it asks to prove geometric properties (e.g., perpendicularity, circle diameter, equal lengths) using coordinate geometry and algebraic calculations.

1 Challenging +1.2
0.6% of questions
Show example »
The diagram below shows a circle and four triangles.
[diagram]
\(AB\) is a diameter of the circle. \(C\) is a point on the circumference of the circle. Triangles \(ABK\), \(BCL\) and \(CAM\) are equilateral. Prove that the area of triangle \(ABK\) is equal to the sum of the areas of triangle \(BCL\) and triangle \(CAM\). [5 marks]
View full question →
Inequality with absolute values

A question is this type if and only if it involves proving or analyzing inequalities containing absolute value expressions (e.g., |x-2| ≥ |x| - 2).

0
0.0% of questions