281
This number is a prime.
Single Curio View: (Seek other curios for this number)
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]
Submitted: 2026-08-23 18:40:27; Last Modified: 2026-08-23 21:12:08.
Printed from the PrimePages <t5k.org> © G. L. Honaker and Reginald McLean