Erdős problem 366
Are there any -full such that is -full?
Sources
FormalConjectures/ErdosProblems/
366.lean
Retained formal statement
Are there infinitely many 3-full such that is 2-full?
True ↔ {n | Nat.Full 3 n ∧ Nat.Full 2 (n + 1)}.InfiniteOpenStatement only, no proof