Recent activity
Record witnesses and commentary edits, newest first.
-
edited commentary on witness #238881
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#238070. -
edited commentary on witness #238880
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 #238879
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,068 with witness #238881 — |A| = 139, exponent 0.4614
-
set a record for N = 43,901 with witness #238880 — |A| = 138, exponent 0.4609
-
set a record for N = 37,228 with witness #238879 — |A| = 121, exponent 0.4557
-
edited commentary on witness #238878
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 #238877
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 #238876
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,067 with witness #238878 — |A| = 137, exponent 0.4601
-
set a record for N = 43,899 with witness #238877 — |A| = 139, exponent 0.4616
-
edited commentary on witness #238874
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#238069. -
edited commentary on witness #238875
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 = 37,217 with witness #238876 — |A| = 121, exponent 0.4557
-
edited commentary on witness #238873
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,066 with witness #238874 — |A| = 139, exponent 0.4614
-
set a record for N = 43,895 with witness #238875 — |A| = 137, exponent 0.4603
-
set a record for N = 37,146 with witness #238873 — |A| = 121, exponent 0.4558
-
edited commentary on witness #238872
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 #238871
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 #238870
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,063 with witness #238871 — |A| = 138, exponent 0.4608
-
set a record for N = 43,893 with witness #238872 — |A| = 137, exponent 0.4603
-
set a record for N = 37,059 with witness #238870 — |A| = 121, exponent 0.4559
-
edited commentary on witness #238869
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 #238868
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 #238867
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,053 with witness #238868 — |A| = 137, exponent 0.4601
-
set a record for N = 43,892 with witness #238869 — |A| = 137, exponent 0.4603
-
set a record for N = 37,054 with witness #238867 — |A| = 121, exponent 0.4559