Skip to content

Course home

Algebraic Methods

Algebraic Methods

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261
Question 192

An engineer investigating mechanical stress determines that a critical component fails only when the stress factor S=n2+7n+5S = n^2 + 7n + 5S=n2+7n+5 is a multiple of 3, where nnn is an integer. The engineer wishes to prove that the component will never fail.

A proof by contradiction is initiated as follows:

'Assume there exists an integer nnn such that n2+7n+5n^2 + 7n + 5n2+7n+5 is divisible by 3.'

Case 1: n=3kn = 3kn=3k for some integer kkk.

S=(3k)2+7(3k)+5=9k2+21k+5=3(3k2+7k+1)+2 S = (3k)^2 + 7(3k) + 5 = 9k^2 + 21k + 5 = 3(3k^2 + 7k + 1) + 2 S=(3k)2+7(3k)+5=9k2+21k+5=3(3k2+7k+1)+2

As this expression leaves a remainder of 2 when divided by 3, it is not divisible by 3, which contradicts the initial assumption for this case.

Complete the proof.

[5]
Markscheme

Algebraic Methods Questions

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

368 exam-style questions on Edexcel A Level Maths Algebraic Methods, covering 1.1 Proof by Contradiction, 1.2 Algebraic Fractions, 1.3 Partial Fractions, 1.4 Repeated Factors, and 1.5 Algebraic Division. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank