Skip to content

Erdős problem 913

Start work

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

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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

Exact provenance

Problem row
sha256:515965491b13bb542fa538006d91eab4e90cbb0b46f18b556dae3af881168f0a
Metadata
sha256:b3215015b0989aa05b4960402277a39617b5385fdc4c4af19372217e71c62f2f
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:d422750fd50a3fea03c7555112e9173e84caddd1164385fdccfd8b97899502cc
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON