Recent activity
Record witnesses and commentary edits, newest first.
-
edited commentary on witness #239046
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 #239044
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 #239045
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,056 with witness #239045 — |A| = 138, exponent 0.4608
-
set a record for N = 40,818 with witness #239044 — |A| = 127, exponent 0.4563
-
set a record for N = 4,896 with witness #239046 — |A| = 44, exponent 0.4454
-
edited commentary on witness #239043
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 #239042
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 #239041
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,054 with witness #239042 — |A| = 139, exponent 0.4615
-
set a record for N = 40,805 with witness #239041 — |A| = 128, exponent 0.4570
-
set a record for N = 4,892 with witness #239043 — |A| = 44, exponent 0.4454
-
edited commentary on witness #239040
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 #239039
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 #239038
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,050 with witness #239040 — |A| = 137, exponent 0.4601
-
set a record for N = 40,802 with witness #239039 — |A| = 127, exponent 0.4563
-
set a record for N = 4,888 with witness #239038 — |A| = 44, exponent 0.4455
-
edited commentary on witness #239037
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 #239036
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 #239035
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,049 with witness #239037 — |A| = 138, exponent 0.4608
-
set a record for N = 40,791 with witness #239036 — |A| = 127, exponent 0.4563
-
set a record for N = 4,884 with witness #239035 — |A| = 44, exponent 0.4455
-
edited commentary on witness #239034
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 #239033
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 #239032
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,046 with witness #239034 — |A| = 137, exponent 0.4601
-
set a record for N = 40,790 with witness #239033 — |A| = 127, exponent 0.4563
-
set a record for N = 4,881 with witness #239032 — |A| = 44, exponent 0.4456