Recent activity
Record witnesses and commentary edits, newest first.
-
edited commentary on witness #239001
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 #238999
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 #239000
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,015 with witness #239001 — |A| = 138, exponent 0.4608
-
set a record for N = 40,701 with witness #238999 — |A| = 127, exponent 0.4564
-
set a record for N = 4,806 with witness #239000 — |A| = 44, exponent 0.4464
-
edited commentary on witness #238998
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 #238997
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 #238996
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,011 with witness #238996 — |A| = 139, exponent 0.4615
-
set a record for N = 40,697 with witness #238997 — |A| = 127, exponent 0.4564
-
set a record for N = 4,798 with witness #238998 — |A| = 44, exponent 0.4465
-
edited commentary on witness #238995
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 #238994
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 #238993
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,008 with witness #238993 — |A| = 137, exponent 0.4601
-
set a record for N = 40,693 with witness #238995 — |A| = 127, exponent 0.4564
-
set a record for N = 4,787 with witness #238994 — |A| = 44, exponent 0.4466
-
edited commentary on witness #238992
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 #238991
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 #238990
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,004 with witness #238990 — |A| = 137, exponent 0.4602
-
set a record for N = 40,687 with witness #238992 — |A| = 127, exponent 0.4564
-
set a record for N = 4,782 with witness #238991 — |A| = 44, exponent 0.4466
-
edited commentary on witness #238989
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 #238988
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 #238987
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,000 with witness #238987 — |A| = 138, exponent 0.4608
-
set a record for N = 40,683 with witness #238988 — |A| = 127, exponent 0.4564
-
set a record for N = 4,776 with witness #238989 — |A| = 44, exponent 0.4467