Recent activity
Record witnesses and commentary edits, newest first.
-
edited commentary on witness #238820
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 = 19,044 with witness #238822 — |A| = 88, exponent 0.4543
-
edited commentary on witness #238819
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,849 with witness #238820 — |A| = 138, exponent 0.4610
-
set a record for N = 41,733 with witness #238821 — |A| = 131, exponent 0.4582
-
edited commentary on witness #238818
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 #238817
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,847 with witness #238818 — |A| = 137, exponent 0.4603
-
set a record for N = 41,732 with witness #238817 — |A| = 131, exponent 0.4582
-
set a record for N = 19,038 with witness #238819 — |A| = 88, exponent 0.4544
-
edited commentary on witness #238816
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 #238815
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 #238814
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 = 19,034 with witness #238816 — |A| = 88, exponent 0.4544
-
edited commentary on witness #238813
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,839 with witness #238814 — |A| = 137, exponent 0.4603
-
set a record for N = 41,731 with witness #238815 — |A| = 131, exponent 0.4582
-
edited commentary on witness #238812
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 #238811
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,837 with witness #238812 — |A| = 137, exponent 0.4603
-
set a record for N = 41,725 with witness #238811 — |A| = 131, exponent 0.4582
-
set a record for N = 19,032 with witness #238813 — |A| = 88, exponent 0.4544
-
edited commentary on witness #238810
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 #238809
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 #238808
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,836 with witness #238808 — |A| = 137, exponent 0.4603
-
set a record for N = 41,690 with witness #238809 — |A| = 131, exponent 0.4583
-
set a record for N = 19,028 with witness #238810 — |A| = 88, exponent 0.4544
-
edited commentary on witness #238807
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 #238806
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.