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.
107 exam-style questions on Edexcel A Level Maths 1.1 Proof by Contradiction. Each one has a worked solution and a mark scheme showing where the marks go.