Erdős problem 366
Are there any -full such that is -full?
Sources
FormalConjectures/ErdosProblems/
366.lean
Retained formal statement
Note that is -full and is 2-full.
∃ n > 0, Nat.Full 3 n ∧ Nat.Full 2 (n + 1)TestStatement only, no proof
Erdős problem 366
The source's own material, retained exactly.
4 retained statements · 36c6d0fef71a
Open selected sourceFormalConjectures/ErdosProblems/
366.lean
Note that is -full and is 2-full.
1∃ n > 0, Nat.Full 3 n ∧ Nat.Full 2 (n + 1)