Erdős problem 913 · problems.science

Are there infinitely many $n$ such that if $n(n + 1) = \prod_i p_i^{k_i}$ is the factorisation into distinct primes then all exponents $k_i$ are distinct?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:515965491b13bb542fa538006d91eab4e90cbb0b46f18b556dae3af881168f0a
Metadata: sha256:b3215015b0989aa05b4960402277a39617b5385fdc4c4af19372217e71c62f2f
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:d422750fd50a3fea03c7555112e9173e84caddd1164385fdccfd8b97899502cc

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207

Upstream source Inspect records Source JSON

Result history

Correction history

Exact provenance

Search problems.science