Erdős problem 366

Are there any $2$ -full $n$ such that $n+1$ is $3$ -full?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

FormalConjectures/ErdosProblems/366.lean

Formal Conjectures

FormalConjectures/ErdosProblems/366.leanErdos366.erdos_3661 lineExact file

1True ↔ ∃ n > 0, Nat.Full 2 n ∧ Nat.Full 3 (n + 1)

OpenStatement only, no proof

Reported by these sources. Not reviewed here.

AI alongside literature
Erdős AI contributions wiki · 14 Apr, 2026
Machine
Automated research pipeline
Open the source record