Recent activity
Record witnesses and commentary edits, newest first.
-
edited commentary on witness #238911
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 #238910
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 #238909
Constructed offline from published witnesses using exact augmentation. 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. Source: witness#238072. -
set a record for N = 44,095 with witness #238909 — |A| = 140, exponent 0.4621
-
set a record for N = 43,929 with witness #238910 — |A| = 138, exponent 0.4609
-
set a record for N = 38,193 with witness #238911 — |A| = 124, exponent 0.4569
-
edited commentary on witness #238908
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 #238907
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 #238906
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 = 44,088 with witness #238908 — |A| = 137, exponent 0.4601
-
set a record for N = 43,927 with witness #238906 — |A| = 138, exponent 0.4609
-
set a record for N = 38,186 with witness #238907 — |A| = 125, exponent 0.4577
-
edited commentary on witness #238905
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 #238904
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 #238903
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 = 44,084 with witness #238905 — |A| = 138, exponent 0.4608
-
set a record for N = 43,923 with witness #238903 — |A| = 137, exponent 0.4602
-
set a record for N = 38,183 with witness #238904 — |A| = 124, exponent 0.4569
-
edited commentary on witness #238901
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 #238902
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 #238900
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 = 44,078 with witness #238901 — |A| = 137, exponent 0.4601
-
set a record for N = 43,919 with witness #238900 — |A| = 137, exponent 0.4602
-
set a record for N = 38,179 with witness #238902 — |A| = 124, exponent 0.4569
-
edited commentary on witness #238899
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 #238898
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 #238897
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 = 44,077 with witness #238897 — |A| = 138, exponent 0.4608
-
set a record for N = 43,917 with witness #238898 — |A| = 137, exponent 0.4602
-
set a record for N = 38,173 with witness #238899 — |A| = 124, exponent 0.4569