Erdős problem 936

Is $2^n + 1$ powerful for finitely many $n$ ?

Sources

The source's own material, retained exactly.

4 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

936.lean

Retained formal statement2 of 4

Is $n! - 1$ powerful for finitely many $n$ ?

FormalConjectures/ErdosProblems/936.leanErdos936.erdos_936.variants.factorial_sub_one1 lineExact file

1True ↔ Erdos936.EventuallyNotPowerful fun x => x.factorial - 1

OpenStatement only, no proof