Recent activity
Record witnesses and commentary edits, newest first.
-
edited commentary on witness #238715
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 = 43,737 with witness #238715 — |A| = 138, exponent 0.4611
-
set a record for N = 41,234 with witness #238716 — |A| = 128, exponent 0.4566
-
set a record for N = 18,727 with witness #238717 — |A| = 88, exponent 0.4551
-
edited commentary on witness #238714
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 #238713
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 #238712
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 = 18,723 with witness #238714 — |A| = 88, exponent 0.4551
-
edited commentary on witness #238711
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 = 43,735 with witness #238713 — |A| = 137, exponent 0.4604
-
set a record for N = 41,232 with witness #238712 — |A| = 128, exponent 0.4566
-
edited commentary on witness #238710
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 #238709
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 = 43,733 with witness #238709 — |A| = 139, exponent 0.4618
-
set a record for N = 41,228 with witness #238710 — |A| = 128, exponent 0.4566
-
set a record for N = 18,721 with witness #238711 — |A| = 88, exponent 0.4551
-
edited commentary on witness #238708
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 #238707
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 #238706
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 = 18,719 with witness #238708 — |A| = 88, exponent 0.4551
-
edited commentary on witness #238705
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 = 43,731 with witness #238707 — |A| = 137, exponent 0.4604
-
set a record for N = 41,226 with witness #238706 — |A| = 128, exponent 0.4566
-
edited commentary on witness #238703
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 #238704
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 = 43,727 with witness #238704 — |A| = 137, exponent 0.4604
-
set a record for N = 41,222 with witness #238703 — |A| = 128, exponent 0.4566
-
set a record for N = 18,713 with witness #238705 — |A| = 88, exponent 0.4552
-
edited commentary on witness #238702
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 #238701
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.