I have the following problem:
Show that 9 consecutive integers cannot be partitioned into two sets such that the products of the first and second set are equal.
I know this question has been asked multiple times. Nearly all of the answers argue with prime factorization and I was just wondering where the flaw in my argumentation is:
Suppose such a partition exists. Then the product of the 9 consecutive integers needs to be a perfect square $n^2$. The product can also be represented as $k(k+1)\dots{}(k+8)$ which when multiplied out yields a polynomial of the form $$ k^9 + \text{polynomial of degree} \leq 8. $$ In order for this to be a perfect square, we would need to be able to represent the polynomial in the form $(\dots{})^2$. Since the degree of the polynomial is odd, we cannot do this and hence such a partition does not exist.
Edit: I know that there is a theorem (Erdos-Selfridge) that states the product of consecutive integers can never be a perfect power $x^l$. However, I was wondering if my argument about the even/odd property for this special case holds.
Consider two distinct questions about polynomials:
Your attempted proof depends on a negative answer to (2), but in fact (2) is true, for example $k^9+k^4+1$ is of odd degree, but when $k=2$ takes the value $529=23^2$.