Recent activity
Record witnesses and commentary edits, newest first.
-
edited commentary on witness #238894
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 #238896
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 #238895
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,076 with witness #238895 — |A| = 138, exponent 0.4608
-
set a record for N = 43,916 with witness #238896 — |A| = 137, exponent 0.4602
-
set a record for N = 38,169 with witness #238894 — |A| = 124, exponent 0.4569
-
edited commentary on witness #238893
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 #238892
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 #238891
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,074 with witness #238893 — |A| = 137, exponent 0.4601
-
set a record for N = 43,915 with witness #238892 — |A| = 138, exponent 0.4609
-
set a record for N = 37,306 with witness #238891 — |A| = 121, exponent 0.4556
-
edited commentary on witness #238890
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#238071. -
edited commentary on witness #238888
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 #238889
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,073 with witness #238890 — |A| = 139, exponent 0.4614
-
set a record for N = 43,913 with witness #238888 — |A| = 139, exponent 0.4616
-
set a record for N = 37,300 with witness #238889 — |A| = 121, exponent 0.4556
-
edited commentary on witness #238887
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 #238886
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 #238885
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,070 with witness #238885 — |A| = 138, exponent 0.4608
-
set a record for N = 43,907 with witness #238886 — |A| = 137, exponent 0.4602
-
set a record for N = 37,279 with witness #238887 — |A| = 121, exponent 0.4556
-
edited commentary on witness #238884
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 #238883
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 #238882
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,069 with witness #238883 — |A| = 138, exponent 0.4608
-
set a record for N = 43,905 with witness #238882 — |A| = 137, exponent 0.4603
-
set a record for N = 37,263 with witness #238884 — |A| = 121, exponent 0.4556