Understand the problem

Suppose 91 distinct positive integers greater than 1 are given such that there are at least 456 pairs among
them which are relatively prime. Show that one can find four integers a, b, c, d among them such that
gcd(a, b) = gcd(b, c) = gcd(c, d) = gcd(d, a) = 1.

Source of the problem
Regional Math Olympiad, 2019 Problem 6

Topic
Combinatorics

Difficulty Level

8/10

Suggested Book
Challenges and Thrills in Pre College Mathematics

Start with hints

Do you really need a hint? Try it first!

The clue: Consider the numbers as points in a graph, and some edges between the points based on their gcd. Let us consider a graph G with 91 vertices (91 distinct numbers) and connect each pair of these vertices. which corresponds to co-prime pairs implies at least 456 edges i.e. e \( \geq\) 456. Here e = number of edges. Now getting four number a,b, c, d such that gcd (a, b) = gcd (b, c) = gcd(c,d) = gcd (d,a) = 1 implies existence at a cycle of length 4.  
We will follow the contradiction method. Let us assume there is no cycle of length ‘4’. Our aim is to find a bound on e, which contradicts the 456 bound on e. Let vertex set of G be V =  {\(v_1, v_2,…,v_{91} \)}, let degree of \( v_i = d_i\). Now, observe that the number of vertex pairs {\( v_k, v_l\)}, adjacent to \(v_i\) is \({d_i}\choose{2}\). Now observe that a vertex pair {\( v_k, v_l\)} cannot be common to two vertices say \(v_i\) and \(v_j\) both, because if so, \( v_i, v_k, v_j, v_l, v_i\) will form a cycle.

So, the sum of all such vertex pairs corresponding to a vertex over all the vertex set \( \leq\) the total number of vertex pairs. \( \sum_{i=1}^{91} ({d_i}\choose{2}) \leq {{91}\choose{2}} \rightarrow \) \( \sum_{i=1}^{91} ({d_i}^2 – d_i)\leq 91.90  \rightarrow \)  \( \sum_{i=1}^{91} {d_i}^2 \leq 2e + {{91}\choose{2}}\) -> (1)  as \( \sum_{i=1}^{91} d_i = 2e \).

We will try to find a lower bound on  \( \sum_{i=1}^{91} {d_i}^2 \) w.r.t e.

By RMS – AM inequality, \( \sum_{i=1}^{91} {d_i}^2 \geq  \frac{( \sum_{i=1}^{91} {d_i})^2 }{91} = \frac{4e^2}{91} \) -> (2) Using (1) and (2), we get \( \frac{2e^2}{91} – e \leq 91.45 \) From here, by solving we get \( e \leq 91×5 =455\). This gives the contradiction.

Watch video

Connected Program at Cheenta

Math Olympiad Program

Math Olympiad is the greatest and most challenging academic contest for school students. Brilliant school students from over 100 countries participate in it every year. Cheenta works with small groups of gifted students through an intense training program. It is a deeply personalized journey toward intellectual prowess and technical sophistication.

Similar Problems

Tetrahedron Problem | AIME I, 1992 | Question 6

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1992 based on Tetrahedron Problem.

Triangle and integers | AIME I, 1995 | Question 9

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1995 based on Triangle and integers.

Functional Equation Problem from SMO, 2018 – Question 35

Try this problem from Singapore Mathematics Olympiad, SMO, 2018 based on Functional Equation. You may use sequential hints if required.

Sequence and greatest integer | AIME I, 2000 | Question 11

Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 2000 based on Sequence and the greatest integer.

Arithmetic sequence | AMC 10A, 2015 | Problem 7

Try this beautiful problem from Algebra: Arithmetic sequence from AMC 10A, 2015, Problem. You may use sequential hints to solve the problem.

Series and sum | AIME I, 1999 | Question 11

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1999 based on Series and sum.

Inscribed circle and perimeter | AIME I, 1999 | Question 12

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 2011 based on Rectangles and sides.

Problem based on Cylinder | AMC 10A, 2015 | Question 9

Try this beautiful problem from Mensuration: Problem based on Cylinder from AMC 10A, 2015. You may use sequential hints to solve the problem.

Cubic Equation | AMC-10A, 2010 | Problem 21

Try this beautiful problem from Algebra, based on the Cubic Equation problem from AMC-10A, 2010. You may use sequential hints to solve the problem.

Median of numbers | AMC-10A, 2020 | Problem 11

Try this beautiful problem from Geometry based on Median of numbers from AMC 10A, 2020. You may use sequential hints to solve the problem.