A data scientist is analyzing a secure hash algorithm that produces integer outputs defined by the function H(n)=n2+14H(n) = n^2 + 14H(n)=n2+14, where n n\,n is any integer. Use the method of proof by contradiction to show that it is impossible for any hash output H(n)H(n)H(n) to be exactly divisible by 4.
Practise AQA A Level Maths 1.4 A: Proof with exam-style questions for A Level Maths. 107 questions covering 1.4.1 Structure and methods of proof, matched to the AQA A Level Maths (7357) 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.
