Let .
Show that .
Hence prove that the difference of the squares of any two odd integers which differ by is divisible by .
0
State the values of for which the expression is not defined.
Show that , for all allowed values of .
Explain why substituting into both sides is not a proof of the identity in part (b).
0
Consider the statement
Prove the identity by starting with the left-hand side.
Check the identity using .
Explain why the calculation in part (b) is not a proof of the identity.
0
Show exactly that
Prove the identity
where .
Explain why the decimal calculation is not the preferred proof for part (a).
0
Show that .
Show that , where .
0
Let .
Show that .
Hence prove that the product of four consecutive integers, increased by , is a perfect square.
0
Show that and .
Hence show that .
0
Let be a non-zero rational number and let be an irrational number.
Prove by contradiction that is irrational.
0
A student makes the following claim.
For every , the number is prime.
Disprove the claim by giving a counterexample. You must explain why your example is a counterexample.
0
Consider the statement:
The sum of any two irrational numbers is irrational.
Disprove the statement by giving a counterexample. You must explain why your example is a counterexample.
0
The following identity is defined for suitable real values of :
State the values of that must be excluded.
Show that the identity is true.
Hence solve exactly
0
Consider the identity
State the restriction on .
Prove the identity.
Hence solve exactly
0
The function is defined by
Use your GDC to find and .
Prove that .
student says that the two values found in part (a) prove the result in part (b). Explain why the student is incorrect.
0
Let be a non-zero rational number and let be an irrational number. Prove by contradiction that is irrational.
0
Consider the statement:
For every , the number is prime.
Use your GDC, or otherwise, to find a value of that may be used as a counterexample.
Show that your value is a counterexample.
Explain why this disproves the statement.
0
Consider the expression .
Show that , for .
Determine the solution of , giving a reason why any rejected value is not a solution.
0
Use mathematical induction to prove that for all .
0
Prove by contradiction that is irrational. You may use the fact that if a prime divides , then it divides .
Hence prove that is irrational.
0
For all real values of ,
where , and are constants.
Expand the left-hand side and collect like terms.
Determine the values of , and .
Check your result by substituting into both sides of the identity.
0
Use mathematical induction to prove that
for all .
0
Use mathematical induction to prove that divides
for all .
0
Prove by contradiction that is irrational.
0
For real values of , consider
Algebraic form and domain
State the values of for which is not defined.
Show that
for all allowed values of .
Further algebraic manipulation
Show that
Hence solve .
Calculate both sides when and explain whether this check proves the identity in part (a)(ii).
0
Let and define
Show that
Hence prove that is divisible by for every integer .
student calculates and to support the result in part (a).
Find and .
Explain why these two calculations are not a proof of the result in part (a)(ii).
0
Consider the exact surd expressions
Show that and .
Hence find the exact value of .
Show that .
Find the exact value of and hence solve
Explain why a decimal approximation to is not a proof of the exact value found in part (a)(ii).
0
Use mathematical induction to prove that divides for all .
0
For real values of , consider the expression
State the values of for which is not defined.
Prove that
for all allowed values of .
Hence solve exactly
Use your GDC to check the identity in part (a)(ii) when .
Explain why the calculation in part (c)(i) is not a proof of the identity.
0
For all real values of ,
where , and are constants.
Expand the left-hand side and collect like terms.
Determine the values of , and .
Let and .
Use your GDC to find and .
Explain why the result in part (b)(i) is consistent with, but does not prove, the identity.
0
The function is defined by
Use your GDC to find and .
Prove that .
Hence solve , giving exact answers.
student claims that the two values found in part (a)(i) prove the identity in part (a)(ii). Explain why this claim is incorrect.
0
Use mathematical induction to prove that, for ,
for all .
0
A sequence is defined by and for . This question investigates a closed form and divisibility properties of the sequence.
1 | |||
2 | |||
3 | |||
4 |
Calculate , and .
Use your values to conjecture a formula for .
Use mathematical induction to prove that
for all .
Hence prove that divides for every integer .
student claims that divides for every integer . Disprove the claim by giving a counterexample.
0
For each , define
This question investigates exact forms and irrationality.
n | exact | decimal approx. |
|---|---|---|
1 | 0.414214 | |
2 | 0.236068 | |
3 | 0.162278 | |
4 | 0.123106 | |
5 | 0.099020 | |
6 | 0.082763 | |
7 | 0.071068 | |
8 | 0.062258 |
Show that
Use the identity in part (a)(i) to find an exact expression for .
Prove by contradiction that is irrational for every .
Hence prove that is irrational for every .
Disprove the statement: is irrational for every .
0
A student investigates the quadratic expression
where . The student claims that is prime for every .
n | Prime? | |
|---|---|---|
0 | 11 | Yes |
1 | 13 | Yes |
2 | 17 | Yes |
3 | 23 | Yes |
4 | 31 | Yes |
5 | 41 | Yes |
6 | 53 | Yes |
7 | 67 | Yes |
8 | 83 | Yes |
9 | 101 | Yes |
Calculate , and .
Explain why the calculations in part (a)(i) do not prove the student's claim.
Find and justify a counterexample to the student's claim.
Show that, for every ,
Hence explain why there are infinitely many values of for which is not prime.
0
Let . For , let denote the th derivative of . This question investigates a formula for .
Derivative order | Simplified expression |
|---|---|
0 | |
1 | |
2 | |
3 |
Find and .
Conjecture a formula for .
Use mathematical induction to prove your conjecture from part (a)(ii). If you did not obtain a conjecture, prove that .
Find the value of for which .
Explain why finding , and would not prove the formula for every .
0
Let be a real number for which and are defined.
Part (a)
Show that
Show that
Part (b)
Hence write in the form .
Solve exactly
for .
Explain why verifying the identity in part (a)(ii) at is not a proof of the identity.
0
The function is defined by
Show that
Hence prove that is even for every integer .
Solve exactly .
Explain why the identity in part (a)(i) justifies using in part (b)(i).
Check one of the non-zero solutions from part (b)(i) by substituting it into .
0
For real values of , let
State the values of for which is not defined.
Show that
for all allowed values of .
Show that
Hence prove that for .
student attempts to solve by using only the numerator of the expression in part (a)(ii). Explain why has no real solutions.
0
For , define
Find .
Verify that .
Use mathematical induction to prove that
for all .
Hence find
0
Consider the statement : is divisible by , where .
Verify and .
Use mathematical induction to prove for all .
student claims that is divisible by for every . Disprove this claim by giving a counterexample.
0
A sequence is defined by
for .
Find and .
Verify that for .
Use mathematical induction to prove that
for all .
Find the value of for which .
student claims that is divisible by for every odd positive integer . Disprove this claim by giving a counterexample.
0
For , define
Show that
Use your GDC to check the identity when . Give both values to three significant figures.
Solve exactly .
0
For , let
Show that
Use your GDC to find , giving your answer to three significant figures.
Hence show that
Prove that for all .
0
For real , define
State the values of in the interval for which is not defined.
Prove that
for all allowed values of .
Hence solve for . Give your answers in radians to three significant figures.
Use your GDC to check the identity in part (a)(ii) at , and explain why this check is not a proof.
0
A student investigates the numbers
The student claims that is prime for every .
Prime? | ||
|---|---|---|
1 | 11 | yes |
2 | 13 | yes |
3 | 17 | yes |
4 | 23 | yes |
5 | 31 | yes |
6 | 41 | yes |
7 | 53 | yes |
8 | 67 | yes |
9 | 83 | yes |
10 | not shown | not shown |
11 | not shown | not shown |
Use your GDC to find and .
State which input value of gives a counterexample.
Show that is a counterexample.
For an integer , define . Show that the statement “ is prime for every ” is false whenever is prime.
Explain why the values of for cannot prove the student’s claim.
0
This question investigates a matrix representation of the Fibonacci sequence. The Fibonacci numbers are defined by , and for . Let
n | Fibonacci terms | |
|---|---|---|
1 | 1, 1, 0 | |
2 | 1, 1, 1 | |
3 | 2, 1, 1 | |
4 | 3, 2, 1 | |
5 | 5, 3, 2 | |
6 | 8, 5, 3 |
Calculate and .
Verify, using your answers to part (a)(i), that
for and .
Use mathematical induction to prove that
for all .
Hence write down .
By considering determinants, prove Cassini's identity
for all .
0
Let , where . This question investigates powers of complex numbers on the unit circle.

Show that .
Write down in the form .
Use mathematical induction to prove De Moivre's theorem,
for all .
Let . Prove that
Hence prove that
0
For , define
This question investigates a telescoping sum and two different proof methods.
n | Exact S_n | Decimal approx. |
|---|---|---|
1 | 1/3 | 0.333333 |
2 | 11/24 | 0.458333 |
4 | 17/30 | 0.566667 |
8 | 29/45 | 0.644444 |
16 | 106/153 | 0.692810 |
32 | 404/561 | 0.720143 |
64 | 1576/2145 | 0.734732 |
Show that
for all allowed values of .
Calculate exactly.
Use part (a)(i) to show that
Prove the result in part (b) by mathematical induction. If you did not obtain the formula in part (b), use
0
This question investigates identities involving binomial coefficients. The notation has its usual meaning, and .
1 | 1 | 1 | — | — | — | — | — |
2 | 1 | 2 | 1 | — | — | — | — |
3 | 1 | 3 | 3 | 1 | — | — | — |
4 | 1 | 4 | 6 | 4 | 1 | — | — |
5 | 1 | 5 | 10 | 10 | 5 | 1 | — |
6 | 1 | 6 | 15 | 20 | 15 | 6 | 1 |
Calculate
Write down .
By considering the coefficient of in , prove that
Use mathematical induction to prove that
for all .
student claims that for all . Disprove the claim.
0
This question investigates Bernoulli's inequality:
Assume throughout parts (a), (b) and (d) that and .

Verify Bernoulli's inequality for by simplifying the difference .
State the value of for which equality holds in part (a)(i).
Use mathematical induction to prove Bernoulli's inequality for all .
Disprove the statement that Bernoulli's inequality is true for all real and all .
Use Bernoulli's inequality to show that
for all .
Explain why checking the inequality for would not prove the result in part (d)(i).
0
This question investigates a divisibility result involving powers. Define
for .
5 | 9765382 | 887762 |
6 | 244139896 | 22194536 |
3 | 15598 | 1418 |
4 | 390544 | 35504 |
Calculate and .
Verify that divides both values found in part (a)(i).
Use mathematical induction to prove that divides for all .
student claims that divides for all . Disprove this claim.
Explain why part (b) does not imply the student's claim in part (c)(i).
0
Let denote the first prime numbers, and define
This question investigates Euclid's argument for the infinitude of primes.
Nature of | |||
|---|---|---|---|
1 | 2 | 3 | Prime |
2 | 6 | 7 | Prime |
3 | 30 | 31 | Prime |
4 | 210 | 211 | Prime |
5 | 2310 | 2311 | Prime |
6 | 30030 | 30031 | Composite |
Calculate .
State whether is prime.
Use proof by contradiction to prove that there are infinitely many prime numbers.
student claims that is prime for every . Use the case to disprove the claim.
0
Let
where .
Show that , where is the complex conjugate of .
Find in the form .
Use mathematical induction to prove that
for all .
By expanding , show that the real part of is .
Hence show that
0
This question concerns irrational numbers.
Prove by contradiction that is irrational. You may use the fact that if a prime divides , then divides .
Hence prove that is irrational.
Disprove the statement: the product of any two irrational numbers is irrational.
0
This question considers Euclid's argument about prime numbers. Assume, for contradiction, that is a complete finite list of all primes, with the primes distinct, and define
Assume, for contradiction, that there are only finitely many primes, . Define
Show that none of divides .
Explain why has a prime divisor.
Hence complete the proof by contradiction that there are infinitely many primes.
student claims that for every finite set of primes, the product of the primes plus is itself prime.
Explain why the counterexample in part (b) does not invalidate the proof in part (a).
0
For , let
The formula for is assumed to have the form
Use your GDC to find , and .
Determine , and .
Use mathematical induction to prove that
for all .
Use the formula to determine the least value of for which .
0
For , define
Use your GDC to find , and .
State a conjecture about the divisibility of .
Use mathematical induction to prove your conjecture.
Hence find the remainder when is divided by .
0
Let .
Find and .
Use your answers to suggest a formula for .
Use mathematical induction to prove that
for all .
Use the formula and your GDC to find the minimum value of for , giving your answer to three significant figures.
0
You may use the fact that if a prime number divides , where , then it divides .
Use your GDC to find a decimal approximation to .
Prove by contradiction that is irrational.
Let and be rational numbers with . Prove by contradiction that is irrational.
0
Let
where and is a non-negative integer.
Use your GDC, or otherwise, to find , , and .
State a formula for in terms of .
Use mathematical induction to prove that
for all integers .
Hence determine all integers such that and .
0
A sequence is defined by
for . This question investigates bounds and the limiting behaviour suggested by the sequence.

Calculate and exactly in nested radical form.
Use your GDC to give to three significant figures.
Use mathematical induction to prove that for all .
Show that the sequence is increasing.
Assuming the sequence converges to a limit , find .
Explain why the induction proof in part (b) alone does not prove that the sequence converges.
0