That doesn't quite work (

, for example).
Suppose the product is a perfect square. Among the ten terms in the product:
- five are even
- at most two are odd and divisible by 3
- at most one is odd and divisible by 5
- at most one is odd and divisible by 7
So at least one term is not divisible by any of 2,3,5,7. This term is relatively prime with the others since any common divisor of two terms is at most 9. So this term is a perfect square, and at least

.
Now note that this is the only square in our product, otherwise we would have a square greater than or equal to

differing from another square by at most 9.
In particular, there must be exactly one term not divisble by any of 2,3,5,7. So we must have equality in all of our counts, and no odd term can be divisible by 15, 21, or 35.
Consider the odd terms divisible by 3. Neither are divisible by 2,5,7, and the gcd between either of these terms and any another one is at most 9, therefore a power of 3.
So we can factor out the largest power of 3 from each of these terms. Each quotient that results is relatively prime to all other terms and are both squares. So it follows that each odd term divisible by 3 is either a square or three times a square.
We know from above that neither can be squares, so both are three times a square. But this also produces two squares that are too close (in particular, they differ by 2). This is a contradiction, so the product cannot be a square.