Skip to content

Erdős problem 649

Let P(m)P(m) denote the greatest prime factor of mm. Is it true that, for any two primes p,qp,q, there exists some integer nn such that P(n)=pP(n)=p and P(n+1)=qP(n+1)=q?

Sources

The source's own material, retained exactly.

6 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

649.lean

Retained formal statement2 of 6

In fact, the answer to this question as written is easily seen to be no, since there are no solutions to 2k≡−1(mod7)2^k\equiv -1\pmod{7}, and hence this fails with p=2p=2 and q=7q=7.

FormalConjectures/ErdosProblems/649.leanErdos649.erdos_649.variants.no_solution_two_seven1 lineExact file
¬∃ n, n.maxPrimeFac = 2 ∧ (n + 1).maxPrimeFac = 7
TextbookStatement only, no proof