Erdős problem 366
Are there any -full such that is -full?
Sources
FormalConjectures/ErdosProblems/
366.lean
Retained formal statement
Are there any -full such that is -full?
True ↔ ∃ n > 0, Nat.Full 2 n ∧ Nat.Full 3 (n + 1)OpenStatement only, no proof