Recent activity
Record witnesses and commentary edits, newest first.
-
edited commentary on witness #238926
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 #238925
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 #238924
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,459 with witness #238926 — |A| = 139, exponent 0.4611
-
set a record for N = 43,944 with witness #238925 — |A| = 137, exponent 0.4602
-
set a record for N = 38,211 with witness #238924 — |A| = 124, exponent 0.4569
-
edited commentary on witness #238922
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 #238923
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 #238921
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,445 with witness #238923 — |A| = 139, exponent 0.4611
-
set a record for N = 43,943 with witness #238921 — |A| = 138, exponent 0.4609
-
set a record for N = 38,204 with witness #238922 — |A| = 125, exponent 0.4576
-
edited commentary on witness #238920
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#238075. -
edited commentary on witness #238918
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 #238919
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,245 with witness #238920 — |A| = 140, exponent 0.4619
-
set a record for N = 43,941 with witness #238919 — |A| = 139, exponent 0.4616
-
set a record for N = 38,203 with witness #238918 — |A| = 124, exponent 0.4569
-
edited commentary on witness #238917
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#238074. -
edited commentary on witness #238916
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 #238915
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,235 with witness #238917 — |A| = 140, exponent 0.4620
-
set a record for N = 43,937 with witness #238915 — |A| = 138, exponent 0.4609
-
set a record for N = 38,200 with witness #238916 — |A| = 124, exponent 0.4569
-
edited commentary on witness #238914
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 #238913
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#238073. -
edited commentary on witness #238912
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,105 with witness #238913 — |A| = 140, exponent 0.4621
-
set a record for N = 43,933 with witness #238914 — |A| = 137, exponent 0.4602
-
set a record for N = 38,197 with witness #238912 — |A| = 125, exponent 0.4576