While of course, the brute force method is available to us to find out the answer, there is an elegant way of solving:
where m is a in integer.
This has to be true for any n.
That means we must have m = Q(n). So, we rewrite the equation as

By comparing the polynomials on both sides, we can see that Q(n) must be a monic quadratic polynomial (i.e. a quadratic with coefficient 1).
Since, the expression is true for infinitely many integers, it is true for any real number. So, we can replace n by x where x is a real number. So, we rewrite as:

Suppose,
are the roots of the given quadratic x2+bx+c = 0. Then, the RHS must disappear for precisely those numbers.
i.e.
are the roots of the equation x2+bx+c = 0. But
are the only roots of the quadratic
So either
or 
Suppose
, then the first option gives p= b+1 and q = c, while the second gives p = b-1 and q = c-b
Thus Q(n) is either
or 
We can eliminate the second quadratic by taking b = c = 0.
Thus
is the required quadratic.
This corresponds to Option (c) (while noting that I have used b for a and c for b!)