Revision Library
Choose a subject
Menu
Maths
Need a new topic?
Missing a topic, found a bug, or want something added?

A Level Maths Pure Topic Workbooks · Book 1 of 2

A Level Maths Pure Topic Workbook 1

Pure: Proof, Pure: Algebra and Functions, Pure: Coordinate Geometry (Lines and Circles) and 6 more

Level
A Level · Edexcel 9MA0 · AQA 7357 · OCR H240
Series
A Level Maths Pure Topic Workbooks, book 1 of 2
Suitable for
Years 12-13, AQA / Edexcel / OCR
FreePDF download · 2027 edition · 62 A4 pages
  • One file, prints straight to A4
  • No account, no password

Workbooks like this one, with 9 topics, 86 questions and mark schemes at the back, are usually printed and sold by publishers. This one is one of 558 free PDFs on the shelf.

Pages
62 A4 pages
Chapters
9 worksheet chapters
Questions
86 · 759 marks
Answers
From page 44
Working time
About 16h 10m

What is inside

9 chapters · answers from p44

Each chapter starts with a page showing its marks and a suggested time, followed by the questions. The mark schemes for all 9 chapters are at the back, so the book works for homework, a timed test or revision.

  1. 01Pure: Proof9 questions · 68 marks · about 85 min Topic guide: Pure: Proofp3
  2. 02Pure: Algebra and Functions9 questions · 78 marks · about 100 min Topic guide: Pure: Algebra and Functionsp8
  3. 03Pure: Coordinate Geometry (Lines and Circles)9 questions · 74 marks · about 95 min Topic guide: Pure: Coordinate Geometry (Lines and Circles)p12
  4. 04Pure: Sequences and Series (incl. Binomial Expansion)10 questions · 85 marks · about 110 min Topic guide: Pure: Sequences and Series (incl. Binomial Expansion)p17
  5. 05Pure: Trigonometry9 questions · 85 marks · about 110 min Topic guide: Pure: Trigonometryp21
  6. 06Pure: Exponentials and Logarithms11 questions · 93 marks · about 120 min Topic guide: Pure: Exponentials and Logarithmsp25
  7. 07Pure: Differentiation10 questions · 90 marks · about 115 min Topic guide: Pure: Differentiationp29
  8. 08Pure: Integration10 questions · 91 marks · about 115 min Topic guide: Pure: Integrationp33
  9. 09Pure: Numerical Methods9 questions · 95 marks · about 120 min Topic guide: Pure: Numerical Methodsp38
  10. AnswersMark schemes for every chapterp44

Each chapter is drawn from one of our worksheet packs. Follow a chapter title for the full pack on its own page, or browse every A Level Maths pack. Every book on the shelf is a complete printable workbook of up to 120 A4 pages.

Explore this volume

A Level Maths Pure Topic Workbook 1 includes Pure: Proof (from page 3); Pure: Algebra and Functions (from page 8); Pure: Coordinate Geometry (Lines and Circles) (from page 12); Pure: Sequences and Series (incl. Binomial Expansion) (from page 17); Pure: Trigonometry (from page 21); Pure: Exponentials and Logarithms (from page 25); Pure: Differentiation (from page 29); Pure: Integration (from page 33); Pure: Numerical Methods (from page 38).

Worked question 9 - Pure: Proof

Open the included worksheet

This question proves, by contradiction, that there are infinitely many prime numbers.
(a)State the assumption made at the start of a proof by contradiction that there are infinitely many primes.(1)
(b)Let N = p1 x p2 x ... x pk + 1. Explain why none of p1, p2, ..., pk divides N.(2)
(c)Explain why this leads to a contradiction.(2)
(d)State the conclusion that follows from this contradiction.(1)
(e)Illustrate the argument using the first three primes, 2, 3 and 5. Calculate N = 2x3x5+1, verify that N is not divisible by 2, 3 or 5, and identify the new prime this reveals.(3)
(f)Calculate N for the first six primes, 2, 3, 5, 7, 11 and 13. Given that N = 59 x 509, explain why this shows the argument in parts (a) to (d) still works even when N itself is not prime.(2)

Answer and mark scheme

Question 9

CreditAnswer or working
B1(a) states, for contradiction, that there are only finitely many primes, p1, p2, ..., pk, and that this is a complete list of every prime, oe
B1(b) states that each pi divides the product p1 x p2 x ... x pk exactly, so N leaves remainder 1 when divided by any pi, oe
B1(b) states that this holds for every i from 1 to k, so no prime in the list divides N, cso
B1(c) states that N>1, so N must have at least one prime factor, since every integer greater than 1 has a prime factor
B1(c) states that this prime factor cannot be any of p1, ..., pk (by part (b)), so it is a prime missing from the original list, contradicting the assumption that the list was complete, cso, ft
B1(d) states that the assumption of finitely many primes is false, so there are infinitely many primes, cso, ft
M1(e) calculates N=2x3x5+1=31
A1(e) verifies 31 is not divisible by 2, 3 or 5 (e.g. remainder 1 in each case)
A1(e) identifies that 31 is itself prime, a prime not in the original list {2, 3, 5}, cao
B1(f) calculates N=2x3x5x7x11x13+1=30031, and notes 30031=59x509 is composite
B1(f) states that neither 59 nor 509 is in the original list {2,3,5,7,11,13}, so N still has a prime factor missing from the list, confirming the argument holds whether or not N is prime, cso
  • (a) Answer: Assume there is a complete finite list of primes p1, p2, ..., pk
  • (b) Answer: N leaves remainder 1 on division by each pi, so no pi divides N
  • (c) Answer: N has a prime factor not in the original list, contradicting completeness of the list
  • (d) Answer: There are infinitely many primes
  • (e) Answer: N=31, which is prime and not in {2, 3, 5}
  • (f) Answer: N=30031=59x509; both 59 and 509 are new primes not in the original list

Question 8 - Pure: Proof

Open the included worksheet

This question proves that n3-n is divisible by 6 for every positive integer n.
(a)Fully factorise n3-n.(2)
(b)Explain why (n-1)n(n+1) is always divisible by 2.(2)
(c)Explain why (n-1)n(n+1) is always divisible by 3.(2)
(d)Hence prove that n3-n is divisible by 6 for every positive integer n.(2)

Answer and mark scheme

Question 8

CreditAnswer or working
M1(a) takes out a factor of n: n3-n=n(n2-1)
A1(a) factorises the difference of squares to give n(n-1)(n+1), cao
B1(b) states that n and n+1 are consecutive integers, so exactly one of them is even, oe
B1(b) states that since the product (n-1)n(n+1) contains an even factor, the whole product is divisible by 2, cso
B1(c) states that n-1, n and n+1 are three consecutive integers, and among any three consecutive integers exactly one is a multiple of 3, oe
B1(c) states that since the product contains a multiple of 3, the whole product is divisible by 3, cso
M1(d) states that 2 and 3 share no common factor other than 1, ft from (b) and (c)
A1(d) since (n-1)n(n+1) is divisible by both 2 and 3, it is divisible by 2x3=6 for every positive integer n, cso
  • (a) Answer: n3-n = (n-1)n(n+1)
  • (b) Answer: Divisible by 2 because n and n+1 are consecutive, so one is even
  • (c) Answer: Divisible by 3 because three consecutive integers include a multiple of 3
  • (d) Answer: Proof complete: n3-n is divisible by 6 for every positive integer n

Question 3 - Pure: Proof

Open the included worksheet

Priya defines f(n) = n2 - n + 11 for positive integers n. She calculates f(1)=11, f(2)=13, f(3)=17, f(4)=23 and f(5)=31, all of which are prime, and concludes: "f(n) is prime for every positive integer n."
(a)Show that f(11) = 121, and explain why this disproves Priya's conclusion.(3)
(b)Explain why testing values of n from 1 to 5, as Priya did, could never have proved her conclusion, even before a counter-example was found.(3)

Answer and mark scheme

Question 3

CreditAnswer or working
M1(a) substitutes n=11 into f(n): 112-11+11
A1(a) simplifies to 121, cso
B1(a) states 121=11x11, which is not prime, so n=11 is a counter-example that disproves the conclusion, cao
B1(b) states that Priya's conclusion is a claim about every positive integer n, an infinite set, but she only checked 5 cases
B1(b) states that finitely many successful checks (proof by exhaustion of only some cases) cannot establish a universal statement over an infinite set
B1(b) states that a single valid counter-example, such as n=11, is sufficient to disprove a universal claim, whereas no finite number of confirming cases could ever prove it, oe
  • (a) Answer: f(11)=121=11x11, not prime, so the conclusion is false
  • (b) Answer: Finitely many confirming cases can never prove a claim about all positive integers, but one counter-example disproves it

Question 7 - Pure: Numerical Methods

Open the included worksheet

Let f(x) = x3 - x - 3.
(a)Show that f(x) = 0 has a root between x = 1 and x = 2.(2)
(b)Using the iteration xn+1 = (xn + 3)1/3 with x0 = 1.5, find x1, x2, x3 and x4, giving each to 4 decimal places, and state the root correct to 4 decimal places.(4)
(c)Show that the alternative rearrangement xn+1 = xn3 - 3, using the same x0 = 1.5, does not converge to the root found in part (b) by finding x1 and x2.(3)
(d)Use the Newton-Raphson method with x0 = 1.7 to find the root of f(x) = 0 correct to 4 decimal places, showing at least two iterations.(4)
(e)By comparing your answers to parts (b) and (d), state which method reached the root to 4 decimal places using fewer iterations.(1)

Answer and mark scheme

Question 7

CreditAnswer or working
M1(a) evaluates f(1) and f(2)
A1(a) f(1) = -3, f(2) = 3; opposite signs and f continuous on [1,2], so a root lies in (1,2) cso
M1(b) correct repeated substitution into the iteration formula
A1(b) x1 = 1.6510 (awrt 4dp)
A1(b) x2 = 1.6692, x3 = 1.6714 (awrt 4dp each)
A1(b) x4 = 1.6717 and hence root = 1.6717 (4dp) cao
M1(c) correct substitution x1 = 1.53 - 3
A1(c) x1 = 0.375, x2 = 0.3753 - 3 = -2.9473 (awrt 4dp)
A1(c) the values are moving rapidly away from 1.6717, so this rearrangement diverges rather than converging cso
M1(d) states f'(x) = 3x2 - 1
M1(d) correct Newton-Raphson substitution with x0 = 1.7
A1(d) x1 = 1.6722 (awrt 4dp)
A1(d) x2 = 1.6717 and root = 1.6717 (4dp) cao
B1(e) the Newton-Raphson method (part (d)), which reached 1.6717 after 2 iterations, compared with 4 iterations needed for the rearrangement in part (b)
  • (a) Answer: f(1) = -3, f(2) = 3, sign change confirms a root in (1,2)
  • (b) Answer: x1=1.6510, x2=1.6692, x3=1.6714, x4=1.6717; root = 1.6717 (4dp)
  • (c) Answer: x1 = 0.375, x2 = -2.9473; values diverge away from the root.
  • (d) Answer: x1 = 1.672229, x2 = 1.671700, root = 1.6717 (4dp)
  • (e) Answer: Newton-Raphson converged faster (2 iterations versus 4).

Question 6 - Pure: Numerical Methods

Open the included worksheet

The equation x2 + 8x - 10 = 0 has a positive root, α. The iteration xn+1 = (10 - xn2)/8 is used to estimate α, starting from x0 = 1.
(a)Use the quadratic formula to show that the exact positive root of x2 + 8x - 10 = 0 is α = -4 + √26.(3)
(b)Show that x2 + 8x - 10 = 0 can be rearranged to give x = (10 - x2)/8.(1)
(c)Find g'(x), and show that |g'(α)| < 1.(2)
(d)By finding x1, x2, x3 and x4 (each to 4dp), show that the iteration converges to α by oscillating alternately above and below the true value (a cobweb pattern), rather than approaching α from one side only (a staircase pattern).(3)
(e)State how the resulting diagram would differ if g'(α) were positive instead of negative, with |g'(α)| still less than 1.(1)

Answer and mark scheme

Question 6

CreditAnswer or working
M1(a) correct application of the quadratic formula with a=1, b=8, c=-10
A1(a) x = (-8 ± √64+40)/2 = -4 ± √26
A1(a) takes the positive root, α = -4 + √26 cso
B1(b) correct rearrangement: 8x = 10 - x2, so x = (10-x2)/8 cso
M1(c) g'(x) = -2x/8 = -x/4
A1(c) g'(α) = -1.0990/4 = -0.2748, so |g'(α)| = 0.2748 < 1 cso
M1(d) correct repeated substitution into the iteration formula
A1(d) x1 = 1.1250, x2 = 1.0918, x3 = 1.1010, x4 = 1.0985 (awrt 4dp)
A1(d) values alternate above (1.1250, 1.1010) and below (1.0918, 1.0985) α = 1.0990, consistent with g'(α) < 0, giving a cobweb (not staircase) diagram cso
B1(e) the iteration would converge monotonically from one side only (a staircase diagram) rather than oscillating
  • (a) Answer: α = -4 + √26
  • (b) Answer: x = (10-x2)/8
  • (c) Answer: g'(x) = -x/4; |g'(α)| = 0.2748 < 1
  • (d) Answer: x1=1.1250, x2=1.0918, x3=1.1010, x4=1.0985; values oscillate either side of α, confirming a cobweb pattern.
  • (e) Answer: It would give a staircase diagram, converging from one side only.

A Level Maths Pure Topic Workbooks runs to 2 volumes

Book 1 of 2 · 124 pages in the set

Each book is a separate free PDF.

Volume 1 · this book

62 pp · 86 Qs

Pure: Proof, Pure: Algebra and Functions, Pure: Coordinate Geometry (Lines and Circles) and 6 more

Volume 2

62 pp · 82 Qs

Pure: Vectors, Pure: Functions, Graphs and Transformations, Pure: Trigonometric Graphs and 6 more

More A Level books

Want a different mix of topics?

Sitting an exam soon? Build a A Level Maths mock paper or print a ready-made one.