281
This number is a prime.
Just showing those entries submitted by 'Pom': (Click here to show all)
Erdős Problem 281 asks whether finite sets of congruences can cover nearly all integers up to a small error epsilon. Solved via GPT 5.2 Pro. [Pom]
Printed from the PrimePages <t5k.org> © G. L. Honaker and Reginald McLean