Discussion: In this problem the student gives a very creative proof that the polynomial cannot be divisible by 15 making use of the representation of numbers in base 10 and reducing it to the problem of whether, modulo 10, the product of two consecutive numbers can ever be 4 and demonstrations through computation that this cannot ever be the case.

Written response: A very novel approach. Kudos.

Click the image to bring up an enlarge copy.