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: 7

2018 Romania Team Selection Tests, 4
Let $D$ be a non-empty subset of positive integers and let $d$ be the greatest common divisor of $D$, and let $d\mathbb{Z}=[dn: n \in \mathbb{Z} ]$. Prove that there exists a bijection $f: \mathbb{Z} \rightarrow d\mathbb{Z} $ such that $| f(n+1)-f(n)|$ is member of $D$ for every integer $n$.
bezout s identity greatest common divisor number theory bijection combinatorics mathematical induction

2009 Germany Team Selection Test, 1
In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]
bezout s identity geometry pigeonhole principle extremal combinatorics combinatorics point set Bézout's identity coordinate method extremal principle invariants modular arithmetic number theory similar triangles

2008 IMO Shortlist, 3
In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]
bezout s identity geometry pigeonhole principle extremal combinatorics combinatorics point set Bézout's identity coordinate method extremal principle invariants modular arithmetic number theory similar triangles

2008 Peru Iberoamerican Team Selection Test, P3
In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]
bezout s identity geometry pigeonhole principle extremal combinatorics combinatorics point set Bézout's identity coordinate method extremal principle invariants modular arithmetic number theory similar triangles

2009 Brazil Team Selection Test, 3
In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]
bezout s identity geometry pigeonhole principle extremal combinatorics combinatorics point set Bézout's identity coordinate method extremal principle invariants modular arithmetic number theory similar triangles

2009 Belarus Team Selection Test, 2
In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]
bezout s identity geometry pigeonhole principle extremal combinatorics combinatorics point set Bézout's identity coordinate method extremal principle invariants modular arithmetic number theory similar triangles

2009 Germany Team Selection Test, 1
In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]
bezout s identity geometry pigeonhole principle extremal combinatorics combinatorics point set Bézout's identity coordinate method extremal principle invariants modular arithmetic number theory similar triangles