Erdős problem 364 · problems.science

There is no consecutive triple of powerful numbers.

Sources

Browse retained paths and inspect the exact material available for this Problem.

3 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

364.lean

Retained formal statement3 of 3

There is no quadruple of powerful numbers, since at least one of the four numbers must be $2 \pmod{4}$ , which cannot be powerful (since $2$ divides it, but $2^2$ does not).

FormalConjectures/ErdosProblems/364.leanErdos364.erdos_364.variants.weak1 lineExact file

1¬∃ n, n.Powerful ∧ (n + 1).Powerful ∧ (n + 2).Powerful ∧ (n + 3).Powerful

TextbookStatement only, no proof

Sources

Search problems.science