Product of Integers in an Interval, Modulo Squares
Abstract
We prove a conjecture of Irving Kaplansky which asserts that between any pair of consecutive positive squares there is a set of distinct integers whose product is twice a square. Along similar lines, our main theorem asserts that if prime $p$ divides some integer in $[z,z+3\sqrt{z/2}+1)$ (with $z\geq 11$) then there is a set of integers in the interval whose product is $p$ times a square. This is probably best possible, because it seems likely that there are arbitrarily large counterexamples if we shorten the interval to $[z,z+3\sqrt{z/2})$.
Published
2001-01-15
How to Cite
Granville, A., & Selfridge, J. L. (2001). Product of Integers in an Interval, Modulo Squares. The Electronic Journal of Combinatorics, 8(1), R5. https://doi.org/10.37236/1549
Issue
Article Number
R5