Recent activity
Record witnesses and commentary edits, newest first.
-
edited commentary on witness #238685
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 = 18,697 with witness #238687 — |A| = 88, exponent 0.4552
-
edited commentary on witness #238684
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,709 with witness #238685 — |A| = 139, exponent 0.4618
-
set a record for N = 41,204 with witness #238686 — |A| = 128, exponent 0.4566
-
edited commentary on witness #238683
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 #238682
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,705 with witness #238682 — |A| = 140, exponent 0.4625
-
set a record for N = 41,200 with witness #238683 — |A| = 128, exponent 0.4566
-
set a record for N = 18,693 with witness #238684 — |A| = 88, exponent 0.4552
-
edited commentary on witness #238681
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 #238680
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 #238679
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,704 with witness #238680 — |A| = 137, exponent 0.4604
-
set a record for N = 41,198 with witness #238679 — |A| = 128, exponent 0.4566
-
set a record for N = 18,691 with witness #238681 — |A| = 88, exponent 0.4552
-
edited commentary on witness #238678
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 #238677
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 #238676
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 = 18,679 with witness #238678 — |A| = 88, exponent 0.4552
-
edited commentary on witness #238675
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,695 with witness #238677 — |A| = 139, exponent 0.4618
-
set a record for N = 41,194 with witness #238676 — |A| = 128, exponent 0.4566
-
edited commentary on witness #238674
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 #238673
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,691 with witness #238673 — |A| = 140, exponent 0.4625
-
set a record for N = 41,192 with witness #238674 — |A| = 128, exponent 0.4566
-
set a record for N = 18,119 with witness #238675 — |A| = 84, exponent 0.4519
-
edited commentary on witness #238672
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 #238671
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.