olymmath

RMM 2020 Problem 6

  • Day 2

For each integer n≥2n \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 n≥2n \geq 2 for which F(n)F(n+1)=pqF(n)F(n+1)=pq .

Prove that there exist infinitely many strange pairs.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator rmm/2020/p6 · Tag DA8B2P9SNH · Edit this page on GitHub · Keys: j next, k previous