Analyzing the Setup
The machine is defined by the quadratic rule f(x)=Ax2+Bx+C. We are given that for any integer x, the output f(x) is also an integer. Our objective is to determine the necessary and sufficient conditions for the coefficients A,B, and C.
Testing the Boundaries
Let us begin by testing the simplest inputs to constrain the coefficients. Substituting x=0 into the function, we get:
Since f(0) must be an integer, we conclude that C is an integer.
Next, we test x=1 and x=−1:
Since f(1) and f(−1) are integers, their sum and difference must also be integers. Adding these two equations yields:
Rearranging for 2A, we find:
Because f(1), f(−1), and C are integers, it follows that 2A must be an integer. Furthermore, since A+B+C is an integer and C is an integer, A+B must also be an integer.
The Algebraic Surgery
Now, we verify the converse: if 2A, A+B, and C are integers, is f(x) always an integer? We rewrite the function f(x)=Ax2+Bx+C to isolate these known integer components.
By adding and subtracting Ax, we obtain:
To introduce the 2A term, we multiply and divide the first term by 2:
f(x)=2A(2x(x−1))+(A+B)x+C
Final Conclusion
In the expression above, 2A, (A+B), and C are integers by our hypothesis. We must only confirm that 2x(x−1) is an integer.
Since x and x−1 are consecutive integers, one of them must be even. Therefore, their product x(x−1) is always divisible by 2, ensuring that 2x(x−1) is an integer.
Because f(x) is the sum of products of integers, f(x) is guaranteed to be an integer for any integer x. Thus, the necessary and sufficient conditions are that 2A, A+B, and C must all be integers.