This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 2

2017 IMO Shortlist, N7
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.$$ [i]Proposed by John Berman, United States[/i]
john berman more like jawnorz equation polynomial number theory Bézout's identity Chinese remainder theorem Euler's theorem Fermat's little theorem casework construction mathematical induction modular arithmetic p-adic valuation polynomials

2017 IMO, 6
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.$$ [i]Proposed by John Berman, United States[/i]
john berman more like jawnorz equation polynomial number theory Bézout's identity Chinese remainder theorem Euler's theorem Fermat's little theorem casework construction mathematical induction modular arithmetic p-adic valuation polynomials