Skip to content
MathsGenie logo
Open app

Course home

  1. A Level
  3. Maths Edexcel
  5. Question bank

Algebraic Methods

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194
Question 173
i.

In a specific cryptographic protocol, a validation factor VVV is calculated for prime numbers ppp using the formula

V(p)=p2−1 V(p) = p^2 - 1 V(p)=p2−1

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

[3]
ii.

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

[4]

Algebraic Methods Questions

  1. A Level
  2. /Maths
  3. /Algebraic Methods

Practise Edexcel A Level Maths Algebraic Methods with exam-style questions for A Level Maths. 226 questions covering 1.1 Proof by Contradiction, 1.2 Algebraic Fractions, 1.3 Partial Fractions, 1.4 Repeated Factors, and 1.5 Algebraic Division, matched to the Edexcel A Level Maths (9MA0) specification and written in Paper 1, Paper 2 and Paper 3 style. Every question includes a full worked solution and mark scheme, so you can see where marks are awarded rather than just whether you got the answer right.

Question bank