MathDB
Strange NT

Source: Romanian Masters in Mathematics 2020, Problem 6

March 1, 2020
RMMRMM 2020number theory

Problem Statement

For each integer n2n \geq 2, let F(n)F(n) denote the greatest prime factor of nn. A strange pair is a pair of distinct primes pp and qq such that there is no integer n2n \geq 2 for which F(n)F(n+1)=pqF(n)F(n+1)=pq.
Prove that there exist infinitely many strange pairs.