Recent activity
Record witnesses and commentary edits, newest first.
-
edited commentary on witness #238565
Constructed offline from published witnesses using exact greedy repair of compact integer pattern. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
set a record for N = 43,207 with witness #238567 — |A| = 136, exponent 0.4603
-
set a record for N = 41,066 with witness #238566 — |A| = 128, exponent 0.4568
-
edited commentary on witness #238564
Constructed offline from published witnesses using integer-transfer. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
set a record for N = 43,153 with witness #238565 — |A| = 135, exponent 0.4596
-
set a record for N = 41,064 with witness #238564 — |A| = 128, exponent 0.4568
-
edited commentary on witness #238563
Constructed offline from published witnesses using exact greedy repair of compact integer pattern. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
edited commentary on witness #238562
Constructed offline from published witnesses using integer-transfer. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
set a record for N = 43,109 with witness #238563 — |A| = 135, exponent 0.4597
-
set a record for N = 41,058 with witness #238562 — |A| = 128, exponent 0.4568
-
edited commentary on witness #238561
Constructed offline from published witnesses using exact greedy repair of compact integer pattern. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
edited commentary on witness #238560
Constructed offline from published witnesses using integer-transfer. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
set a record for N = 42,992 with witness #238561 — |A| = 135, exponent 0.4598
-
edited commentary on witness #238559
Constructed offline from published witnesses using exact greedy repair of compact integer pattern. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
set a record for N = 41,057 with witness #238560 — |A| = 129, exponent 0.4575
-
edited commentary on witness #238558
Constructed offline from published witnesses using exact 2-3 swap. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
edited commentary on witness #238557
Constructed offline from published witnesses using exact greedy repair of compact integer pattern. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
set a record for N = 42,957 with witness #238559 — |A| = 135, exponent 0.4598
-
set a record for N = 41,055 with witness #238558 — |A| = 156, exponent 0.4754
-
edited commentary on witness #238556
Constructed offline from published witnesses using integer-transfer. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
set a record for N = 42,922 with witness #238557 — |A| = 135, exponent 0.4598
-
set a record for N = 41,054 with witness #238556 — |A| = 128, exponent 0.4568
-
edited commentary on witness #238555
Constructed offline from published witnesses using exact greedy repair of compact integer pattern. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
edited commentary on witness #238554
Constructed offline from published witnesses using integer-transfer. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
set a record for N = 42,389 with witness #238555 — |A| = 133, exponent 0.4590
-
set a record for N = 41,052 with witness #238554 — |A| = 128, exponent 0.4568
-
edited commentary on witness #238553
Constructed offline from published witnesses using exact greedy repair of compact integer pattern. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
edited commentary on witness #238552
Constructed offline from published witnesses using integer-transfer. Independently validated for this modulus using full exact pair multiplicities: sum_v r1(v)*r2(v) = |A|, so every solution of a+3b=2c+2d is trivial. -
set a record for N = 41,756 with witness #238553 — |A| = 131, exponent 0.4582
-
set a record for N = 41,051 with witness #238552 — |A| = 128, exponent 0.4568