MathDB
exist n pairwise coprime composite integers form arithmetic progression

Source: Danube 2014 p3

July 22, 2019
coprimeArithmetic Progressionnumber theoryarithmetic sequence

Problem Statement

Given any integer n≥2n \ge 2, show that there exists a set of nn pairwise coprime composite integers in arithmetic progression.
Back to ProblemsView on AoPS