Erdős problem 913
Are there infinitely many such that if is the factorisation into distinct primes then all exponents are distinct?
Sources
FormalConjectures/ErdosProblems/
913.lean
Retained formal statement
Are there infinitely many such that if is the factorisation into distinct primes then all exponents are distinct?
True ↔ {n | Set.InjOn ⇑(n * (n + 1)).factorization ↑(n * (n + 1)).primeFactors}.InfiniteOpenStatement only, no proof