Difference between revisions of "2017 IMO Problems/Problem 6"

m (solution)
(See Also)
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
 +
==Problem==
 +
 
An ordered pair <math>(x, y)</math> of integers is a primitive point if the greatest common divisor of <math>x</math> and <math>y</math> is <math>1</math>. Given a finite set <math>S</math> of primitive points, prove that there exist a positive integer <math>n</math> and integers <math>a_0, a_1, \ldots , a_n</math> such that, for each <math>(x, y)</math> in <math>S</math>, we have:
 
An ordered pair <math>(x, y)</math> of integers is a primitive point if the greatest common divisor of <math>x</math> and <math>y</math> is <math>1</math>. Given a finite set <math>S</math> of primitive points, prove that there exist a positive integer <math>n</math> and integers <math>a_0, a_1, \ldots , a_n</math> such that, for each <math>(x, y)</math> in <math>S</math>, we have:
 
<cmath>a_0x^n + a_1x^{n-1} y + a_2x^{n-2}y^2 + \cdots + a_{n-1}xy^{n-1} + a_ny^n = 1.</cmath>
 
<cmath>a_0x^n + a_1x^{n-1} y + a_2x^{n-2}y^2 + \cdots + a_{n-1}xy^{n-1} + a_ny^n = 1.</cmath>
  
 
==Solution==
 
==Solution==
 +
{{solution}}
 +
 +
==See Also==
 +
 +
{{IMO box|year=2017|num-b=5|after=Last Problem}}

Latest revision as of 03:09, 19 November 2023

Problem

An ordered pair $(x, y)$ of integers is a primitive point if the greatest common divisor of $x$ and $y$ is $1$. Given a finite set $S$ of primitive points, prove that there exist a positive integer $n$ and integers $a_0, a_1, \ldots , a_n$ such that, for each $(x, y)$ in $S$, we have: \[a_0x^n + a_1x^{n-1} y + a_2x^{n-2}y^2 + \cdots + a_{n-1}xy^{n-1} + a_ny^n = 1.\]

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

2017 IMO (Problems) • Resources
Preceded by
Problem 5
1 2 3 4 5 6 Followed by
Last Problem
All IMO Problems and Solutions