Recent activity
Record witnesses and commentary edits, newest first.
-
edited commentary on witness #238941
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 #238940
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 #238939
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,846 with witness #238939 — |A| = 139, exponent 0.4607
-
set a record for N = 43,955 with witness #238940 — |A| = 139, exponent 0.4616
-
set a record for N = 38,663 with witness #238941 — |A| = 125, exponent 0.4571
-
edited commentary on witness #238937
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 #238938
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 #238936
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,839 with witness #238937 — |A| = 139, exponent 0.4607
-
set a record for N = 43,951 with witness #238936 — |A| = 137, exponent 0.4602
-
set a record for N = 38,244 with witness #238938 — |A| = 125, exponent 0.4576
-
edited commentary on witness #238935
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 #238934
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 #238933
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#238082. -
set a record for N = 44,665 with witness #238933 — |A| = 140, exponent 0.4615
-
set a record for N = 43,949 with witness #238935 — |A| = 137, exponent 0.4602
-
set a record for N = 38,225 with witness #238934 — |A| = 125, exponent 0.4576
-
edited commentary on witness #238932
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#238081. -
edited commentary on witness #238931
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 #238930
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,655 with witness #238932 — |A| = 140, exponent 0.4615
-
set a record for N = 43,948 with witness #238931 — |A| = 137, exponent 0.4602
-
set a record for N = 38,218 with witness #238930 — |A| = 125, exponent 0.4576
-
edited commentary on witness #238929
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#238079. -
edited commentary on witness #238928
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 #238927
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,525 with witness #238929 — |A| = 140, exponent 0.4617
-
set a record for N = 43,947 with witness #238928 — |A| = 137, exponent 0.4602
-
set a record for N = 38,214 with witness #238927 — |A| = 124, exponent 0.4569