Recent activity
Record witnesses and commentary edits, newest first.
-
set a record for N = 41,543 with witness #238537 — |A| = 131, exponent 0.4584
-
edited commentary on witness #238535
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,036 with witness #238536 — |A| = 128, exponent 0.4568
-
edited commentary on witness #238534
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,508 with witness #238535 — |A| = 131, exponent 0.4585
-
set a record for N = 41,033 with witness #238534 — |A| = 129, exponent 0.4575
-
edited commentary on witness #238533
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 #238532
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,466 with witness #238533 — |A| = 131, exponent 0.4585
-
set a record for N = 41,032 with witness #238532 — |A| = 128, exponent 0.4568
-
edited commentary on witness #238531
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 #238530
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,452 with witness #238531 — |A| = 131, exponent 0.4585
-
set a record for N = 41,030 with witness #238530 — |A| = 128, exponent 0.4568
-
edited commentary on witness #238529
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 #238528
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,445 with witness #238529 — |A| = 131, exponent 0.4585
-
edited commentary on witness #238527
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 #238526
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,431 with witness #238527 — |A| = 131, exponent 0.4585
-
set a record for N = 41,026 with witness #238528 — |A| = 128, exponent 0.4568
-
edited commentary on witness #238525
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,417 with witness #238525 — |A| = 131, exponent 0.4586
-
set a record for N = 41,025 with witness #238526 — |A| = 128, exponent 0.4568
-
edited commentary on witness #238524
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. -
edited commentary on witness #238523
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,365 with witness #238523 — |A| = 131, exponent 0.4586
-
set a record for N = 41,024 with witness #238524 — |A| = 128, exponent 0.4568
-
edited commentary on witness #238522
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. -
edited commentary on witness #238521
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.