Skip to content
MathsGenie logo
Sign up

Home

Revision planner

Ask Genie AI

Worksheets

Versus

New

Daily Greens

Ideas + feedback

  1. A Level
  2. Maths AQA
  3. Question bank

1.4.1 Structure and methods of proof

EasyMedium
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
Question 48

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.

[4]
Markscheme
  1. A Level
  2. /Maths
  3. /1.4.1 Structure and methods of proof

107 exam-style questions on AQA A Level Maths 1.4.1 Structure and methods of proof. Each one has a worked solution and a mark scheme showing where the marks go.

More questions