Navvye/Olympiad-Problems-CSV huggingface dataset:
2021 Kosovo National Mathematical Olympiad
Let $ABC$ be a triangle with $AB<AC$. Let $D$ be the point where the bisector of angle $\angle BAC$ touches $BC$ and let $D'$ be the reflection of $D$ in the midpoint of $BC$. Let $X$ be the intersection of the bisector of angle $\angle BAC$ with the line parallel to $AB$ that passes through $D'$. Prove that the line $AC$ is tangent with the circumscribed circle of triangle $XCD'$
2021 Kosovo National Mathematical Olympiad
Each of the spots in a $8\times 8$ chessboard is occupied by either a black or white “horse”. At most how many black horses can be on the chessboard so that none of the horses attack more than one black horse?



Remark: A black horse could attack another black horse.
2021 Kosovo National Mathematical Olympiad
Find all functions $f:\mathbb R\to\mathbb R$ so that the following relation holds for all $x, y\in\mathbb R$.



$$f(f(x)f(y)-1) = xy - 1$$
2021 Kosovo National Mathematical Olympiad
Let $ABC$ be a triangle and let $O$ be the centre of its circumscribed circle. Points $X, Y$ which are neither of the points $A, B$ or $C$, lie on the circumscribed circle and are so that the angles $XOY$ and $BAC$ are equal (with the same orientation). Show that the orthocentre of the triangle that is formed by the lines $BY, CX$ and $XY$ is a fixed point.
2021 Kosovo National Mathematical Olympiad
Let $P(x)$ be a polynomial with integer coefficients. We will denote the set of all prime numbers by $\mathbb P$. Show that the set $\mathbb S := \{p\in\mathbb P : \exists\text{ }n \text{ s.t. }p\mid P(n)\}$ is finite if and only if $P(x)$ is a non-zero constant polynomial.
2019 Kürschák Competition
In an acute triangle $\bigtriangleup ABC$, $AB<AC<BC$, and $A_1,B_1,C_1$ are the projections of $A,B,C$ to the corresponding sides. Let the reflection of $B_1$ wrt $CC_1$ be $Q$, and the reflection of $C_1$ wrt $BB_1$ be $P$.

Prove that the circumcirle of $A_1PQ$ passes through the midpoint of $BC$.
2019 Kürschák Competition
Find all family $\mathcal{F}$ of subsets of $[n]$ such that for any nonempty subset $X\subseteq [n]$, exactly half of the elements $A\in \mathcal{F}$ satisfies that $|A\cap X|$ is even.
2019 Kürschák Competition
Is it true that if  $H$ and $A$ are  bounded subsets of $\mathbb{R}$, then there exists at most one set $B$ such that $a+b(a\in A,b\in B)$ are pairwise distinct and $H=A+B$.
2018 Kürschák Competition
Given a triangle $ABC$ with its incircle touching sides $BC,CA,AB$ at $A_1,B_1,C_1$, respectively. Let the median from $A$ intersects $B_1C_1$ at $M$. Show that $A_1M\perp BC$.
2018 Kürschák Competition
Given a prime number $p$ and let $\overline{v_1},\overline{v_2},\dotsc ,\overline{v_n}$ be $n$ distinct vectors of length $p$ with integer coordinates in an $\mathbb{R}^3$ Cartesian coordinate system. Suppose that for any $1\leqslant j<k\leqslant n$, there exists an integer $0<\ell <p$ such that all three coordinates of $\overline{v_j} -\ell \cdot \overline{v_k} $ is divisible by $p$. Prove that $n\leqslant 6$.
2018 Kürschák Competition
In a village (where only dwarfs live) there are $k$ streets, and there are $k(n-1)+1$ clubs each containing $n$ dwarfs. A dwarf can be in more than one clubs, and two dwarfs know each other if they live in the same street or they are in  the same club (there is a club they are both in).



Prove that is it possible to choose $n$ different dwarfs from $n$ different clubs (one dwarf from each club), such that the $n$ dwarfs know each other!
2017 Kürschák Competition
Let $ABC$ be a triangle. Choose points $A'$, $B'$ and $C'$ independently on side segments $BC$, $CA$ and $AB$ respectively with a uniform distribution. For a point $Z$ in the plane, let $p(Z)$ denote the probability that $Z$ is contained in the triangle enclosed by lines $AA'$, $BB'$ and $CC'$. For which interior point $Z$ in triangle $ABC$ is $p(Z)$ maximised?
2017 Kürschák Competition
Do there exist polynomials $p(x)$ and $q(x)$ with real coefficients such that $p^3(x)-q^2(x)$ is linear but not constant?
2017 Kürschák Competition
An $n$ by $n$ table has an integer in each cell, such that no two cells within a row share the same number. Prove that it is possible to permute the elements within each row to obtain a table that has $n$ distinct numbers in each column.
2016 Kürschák Competition
Let $1\le k\le n$ be integers. At most how many $k$-element subsets can we select from $\{1,2,\dots,n\}$ such that for any two selected subsets, one of the subsets consists of the $k$ smallest elements of their union?
2016 Kürschák Competition
Prove that for any finite set $A$ of positive integers, there exists a subset $B$ of $A$ satisfying the following conditions:



if $b_1,b_2\in B$ are distinct, then neither $b_1$ and $b_2$ nor $b_1+1$ and $b_2+1$ are multiples of each other, and

for any $a\in A$, we can find a $b\in B$ such that $a$ divides $b$ or $b+1$ divides $a+1$.
2016 Kürschák Competition
If $p,q\in\mathbb{R}[x]$ satisfy $p(p(x))=q(x)^2$, does it follow that $p(x)=r(x)^2$ for some $r\in\mathbb{R}[x]$?
2015 Kürschák Competition
In fencing, you win a round if you are the first to reach $15$ points. Suppose that when $A$ plays against $B$, at any point during the round, $A$ scores the next point with probability $p$ and $B$ scores the next point with probability $q=1-p$. (However, they never can both score a point at the same time.)



Suppose that in this round, $A$ already has $14-k$ points, and $B$ has $14-\ell$ (where $0\le k,\ell\le 14$). By how much will the probability that $A$ wins the round increase if $A$ scores the next point?
2015 Kürschák Competition
Consider a triangle $ABC$ and a point $D$ on its side $\overline{AB}$. Let $I$ be a point inside $\triangle ABC$ on the angle bisector of $ACB$. The second intersections of lines $AI$ and $CI$ with circle $ACD$ are $P$ and $Q$, respectively. Similarly, the second intersection of lines $BI$ and $CI$ with circle $BCD$ are $R$ and $S$, respectively. Show that if $P\neq Q$ and $R\neq S$, then lines $AB$, $PQ$ and $RS$ pass through a point or are parallel.
2015 Kürschák Competition
Let $Q=\{0,1\}^n$, and let $A$ be a subset of $Q$ with $2^{n-1}$ elements. Prove that there are at least $2^{n-1}$ pairs $(a,b)\in A\times (Q\setminus A)$ for which sequences $a$ and $b$ differ in only one term.
2014 Kürschák Competition
Consider a company of $n\ge 4$ people, where everyone knows at least one other person, but everyone knows at most $n-2$ of the others. Prove that we can sit four of these people at a round table such that all four of them know exactly one of their two neighbors. (Knowledge is mutual.)
2014 Kürschák Competition
We are given an acute triangle $ABC$, and inside it a point $P$, which is not on any of the heights $AA_1$, $BB_1$, $CC_1$. The rays $AP$, $BP$, $CP$ intersect the circumcircle of $ABC$ at points $A_2$, $B_2$, $C_2$. Prove that the circles $AA_1A_2$, $BB_1B_2$ and $CC_1C_2$ are concurrent.
2014 Kürschák Competition
Let $K$ be a closed convex polygonal region, and let $X$ be a point in the plane of $K$. Show that there exists a finite sequence of reflections in the sides of $K$, such that $K$ contains the image of $X$ after these reflections.
2013 Kürschák Competition
Let $a,b$ be positive real numbers satisfying $2ab=a-b$. Denote for any positive integer $k$ $x_k$ and $y_k$ to be the closest integer to $ak$ and $bk$, respectively (if there are two closest integers, choose the larger one). Prove that any positive integer $n$ appears in the sequence $(x_k)_{k\ge 1}$ if and only if it appears at least three times in the sequence $(y_k)_{k\ge 1}$.
2013 Kürschák Competition
Consider the closed polygonal discs $P_1$, $P_2$, $P_3$ with the property that for any three points $A\in P_1$, $B\in P_2$, $C\in P_3$, we have $[\triangle ABC]\le 1$. (Here $[X]$ denotes the area of polygon $X$.)

(a) Prove that $\min\{[P_1],[P_2],[P_3]\}<4$.

(b) Give an example of polygons $P_1,P_2,P_3$ with the above property such that $[P_1]>4$ and $[P_2]>4$.
2013 Kürschák Competition
Is it true that for integer $n\ge 2$, and given any non-negative reals $\ell_{ij}$, $1\le i<j\le n$, we can find a sequence $0\le a_1,a_2,\ldots,a_n$ such that for all $1\le i<j\le n$ to have $|a_i-a_j|\ge \ell_{ij}$, yet still $\sum_{i=1}^n a_i\le \sum_{1\le i<j\le n}\ell_{ij}$?
2012 Kürschák Competition
Let $J_A$ and $J_B$ be the $A$-excenter and $B$-excenter of $\triangle ABC$. Consider a chord $\overline{PQ}$ of circle $ABC$ which is parallel to $AB$ and intersects segments $\overline{AC}$ and $\overline{BC}$. If lines $AB$ and $CP$ intersect at $R$, prove that

$$\angle J_AQJ_B+\angle J_ARJ_B=180^\circ.$$
2012 Kürschák Competition
Denote by $E(n)$ the number of $1$'s in the binary representation of a positive integer $n$. Call $n$ interesting if $E(n)$ divides $n$. Prove that

(a) there cannot be five consecutive interesting numbers, and

(b) there are infinitely many positive integers $n$ such that $n$, $n+1$ and $n+2$ are each interesting.
2012 Kürschák Competition
Consider $n$ events, each of which has probability $\frac12$. We also know that the probability of any two both happening is $\frac14$. Prove the following.

(a) The probability that none of these events happen is at most $\frac1{n+1}$.

(b) We can reach equality in (a) for infinitely many $n$.
2011 Kürschák Competition
Let $a_1, a_2,...$ be an infinite sequence of positive integers such that for any $k,\ell\in \mathbb{Z_+}$, $a_{k+\ell}$ is divisible by $\gcd(a_k,a_\ell)$. Prove that for any integers $1\leqslant k\leqslant n$, $a_na_{n-1}\dots a_{n-k+1}$ is divisible by $a_ka_{k-1}\dots a_1$.
2011 Kürschák Competition
Let $n$ be a positive integer. Denote by $a(n)$ the ways of expression $n=x_1+x_2+\dots$ where $x_1\leqslant x_2 \leqslant\dots$ are positive integers and $x_i+1$ is a power of $2$ for each $i$. Denote by $b(n)$ the ways of expression $n=y_1+y_2+\dots$ where $y_i$ is a positive integer and $2y_i\leqslant y_{i+1}$ for each $i$.

Prove that $a(n)=b(n)$.
2011 Kürschák Competition
Given $2n$ points and $3n$ lines on the plane. Prove that there is a point $P$ on the plane such that the sum of the distances of $P$ to the $3n$ lines is less than the sum of the distances of $P$ to the $2n$ points.
2010 Kürschák Competition
We have $n$ keys, each of them belonging to exactly one of $n$ locked chests. Our goal is to decide which key opens which chest. In one try we may choose a key and a chest, and check whether the chest can be opened with the key. Find the minimal number $p(n)$ with the property that using $p(n)$ tries, we can surely discover which key belongs to which chest.
2010 Kürschák Competition
Consider a triangle $ABC$, with the points $A_1$, $A_2$ on side $BC$, $B_1,B_2\in\overline{AC}$, $C_1,C_2\in\overline{AB}$ such that $AC_1<AC_2$, $BA_1<BA_2$, $CB_1<CB_2$. Let the circles $AB_1C_1$ and $AB_2C_2$ meet at $A$ and $A^*$. Similarly, let the circles $BC_1A_1$ and $BC_2A_2$ intersect at $B^*\neq B$, let $CA_1B_1$ and $CA_2B_2$ intersect at $C^*\neq C$. Prove that the lines $AA^*$, $BB^*$, $CC^*$ are concurrent.
2010 Kürschák Competition
For what positive integers $n$ and $k$ do there exits integers $a_1,a_2,\dots,a_n$ and $b_1,b_2,\dots,b_k$ such that the products $a_ib_j$ ($1\le i\le n,1\le j\le k$) give pairwise different residues modulo $nk$?
2009 Kürschák Competition
Let $n,k$ be arbitrary positive integers. We fill the entries of an $n\times k$ array with integers such that all the $n$ rows contain the integers $1,2,\dots,k$ in some order. Add up the numbers in all $k$ columns – let $S$ be the largest of these sums. What is the minimal value of $S$?
2009 Kürschák Competition
Find all positive integer pairs $(a,b)$ for which the set of positive integers can be partitioned into sets $H_1$ and $H_2$ such that neither $a$ nor $b$ can be represented as the difference of two numbers in $H_i$ for $i=1,2$.
2009 Kürschák Competition
Find all functions $f:\mathbb{Z}\to \mathbb{Q}$ with the following properties: if $f(x)<c<f(y)$ for some rational $c$, then $f$ takes on the value of $c$, and

$$f(x)+f(y)+f(z)=f(x)f(y)f(z)$$

whenever $x+y+z=0$.
2008 Kürschák Competition
Denote by $d(n)$ the number of positive divisors of a positive integer $n$. Find the smallest constant $c$ for which $d(n)\le c\sqrt n$ holds for all positive integers $n$.
2008 Kürschák Competition
Let $n\ge 1$ and $a_1<a_2<\dots<a_n$ be integers. Let $S$ be the set of pairs $1\le i<j\le n$ for which $a_j-a_i$ is a power of $2$, and $T$ be the set of pairs $1\le i<j\le n$ with $j-i$ a power of $2$. (Here, the powers of $2$ are $1,2,4,\dots$.) Prove that $|S|\le |T|$.
2008 Kürschák Competition
In a far-away country, travel between cities is only possible by bus or by train. One can travel by train or by bus between only certain cities, and there are not necessarily rides in both directions. We know that for any two cities $A$ and $B$, one can reach $B$ from $A$, or $A$ from $B$ using only bus, or only train rides. Prove that there exists a city such that any other city can be reached using only one type of vehicle (but different cities may be reached with different vehicles).
2007 Kürschák Competition
We have placed $n>3$ cards around a circle, facing downwards. In one step we may perform the following operation with three consecutive cards. Calling the one on the center $B$, the two on the ends $A$ and $C$, we put card $C$ in the place of $A$, then move $A$ and $B$ to the places originally occupied by $B$ and $C$, respectively. Meanwhile, we flip the cards $A$ and $B$.



Using a number of these steps, is it possible to move each card to its original place, but facing upwards?
2007 Kürschák Competition
Prove that if from any $2007$ consecutive terms of an infinite arithmetic progression of integers starting with $2$, one can choose a term relatively prime to all the $2006$ other terms, then there is also a term amongst any $2008$ consecutive terms relatively prime to the rest.
2007 Kürschák Competition
Prove that any finite set $H$ of lattice points on the plane has a subset $K$ with the following properties:



any vertical or horizontal line in the plane cuts $K$ in at most $2$ points,

any point of $H\setminus K$ is contained by a segment with endpoints from $K$.
2006 Kürschák Competition
Is there a set $S\subset\mathbb{R}^3$ of $2006$ points such that not all its points are coplanar, no three of the points are collinear, and for any $A,B\in S$ we can find points $C,D\in S$ for which $AB||CD$?
2006 Kürschák Competition
Let $a,t,n$ be positive integers such that $a\le n$. Consider the subsets of $\{1,2,\dots,n\}$ whose any two elements differ by at least $t$. Prove that the number of such subsets not containing $a$ is at most $t^2$ times the number of those that do contain $a$.
2006 Kürschák Competition
We deal $n-1$ cards in some way to $n$ people sitting around a table. From then on, in one move a person with at least $2$ cards gives one card to each of his/her neighbors. Prove that eventually a state will be reached where everyone has at most one card.
2005 Kürschák Competition
Let $N>1$ and let $a_1,a_2,\dots,a_N$ be nonnegative reals with sum at most $500$. Prove that there exist integers $k\ge 1$ and $1=n_0<n_1<\dots<n_k=N$ such that

$$\sum_{i=1}^k n_ia_{n_{i-1}}<2005.$$
2005 Kürschák Competition
A and B play tennis. The player to first win at least four points and at least two more than the other player wins. We know that A gets a point each time with probability $p\le \frac12$, independent of the game so far. Prove that the probability that A wins is at most $2p^2$.
2005 Kürschák Competition
We build a tower of $2\times 1$ dominoes in the following way. First, we place $55$ dominoes on the table such that they cover a $10\times 11$ rectangle; this is the first story of the tower. We then build every new level with $55$ domioes above the exact same $10\times 11$ rectangle. The tower is called stable if for every non-lattice point of the $10\times 11$ rectangle, we can find a domino that has an inner point above it. How many stories is the lowest stable tower?
2004 Kürschák Competition
Given is a triangle $ABC$, its circumcircle $\omega$, and a circle $k$ that touches $\omega$ from the outside, and also touches rays $AB$ and $AC$ in $P$ and $Q$, respectively. Prove that the $A$-excenter of $\triangle ABC$ is the midpoint of $\overline{PQ}$.
2004 Kürschák Competition
Find the smallest positive integer $n\neq 2004$ for which there exists a polynomial $f\in\mathbb{Z}[x]$ such that the equation $f(x)=2004$ has at least one, and the equation $f(x)=n$ has at least $2004$ different integer solutions.
2004 Kürschák Competition
We have placed some red and blue points along a circle. The following operations are permitted:



(a) we may add a red point somewhere and switch the color of its neighbors,



(b) we may take off a red point from somewhere and switch the color of its neighbors (if there are at least $3$ points on the circle and there is a red one too).



Initially, there are two blue points on the circle. Using a number of these operations, can we reach a state with exactly two red point?
2003 Kürschák Competition
Draw a circle $k$ with diameter $\overline{EF}$, and let its tangent in $E$ be $e$. Consider all possible pairs $A,B\in e$ for which $E\in \overline{AB}$ and $AE\cdot EB$ is a fixed constant. Define $(A_1,B_1)=(AF\cap k,BF\cap k)$. Prove that the segments $\overline{A_1B_1}$ all concur in one point.
2003 Kürschák Competition
Prove that if a graph $\mathcal{G}$ on $n\ge 3$ vertices has a unique $3$-coloring, then $\mathcal{G}$ has at least $2n-3$ edges.



(A graph is $3$-colorable when there exists a coloring of its vertices with $3$ colors such that no two vertices of the same color are connected by an edge. The graph can be $3$-colored uniquely if there do not exist vertices $u$ and $v$ of the graph that are painted different colors in one $3$-coloring, yet are colored the same in another.)
2003 Kürschák Competition
Prove that the following inequality holds with the exception of finitely many positive integers $n$:



$$\sum_{i=1}^n\sum_{j=1}^n gcd(i,j)>4n^2.$$
2002 Kürschák Competition
We have an acute-angled triangle which is not isosceles. We denote the orthocenter, the circumcenter and the incenter of it by $H$, $O$, $I$ respectively. Prove that if a vertex of the triangle lies on the circle $HOI$, then there must be another vertex on this circle as well.
2002 Kürschák Competition
The Fibonacci sequence is defined as $f_1=f_2=1$, $f_{n+2}=f_{n+1}+f_n$ ($n\in\mathbb{N}$). Suppose that $a$ and $b$ are positive integers such that $\frac ab$ lies between the two fractions $\frac{f_n}{f_{n-1}}$ and $\frac{f_{n+1}}{f_{n}}$. Show that $b\ge f_{n+1}$.
2002 Kürschák Competition
Prove that the edges of a complete graph with $3^n$ vertices can be partitioned into disjoint cycles of length $3$.
2001 Kürschák Competition
$3n-1$ points are given in the plane, no three are collinear. Prove that one can select $2n$ of them whose convex hull is not a triangle.
2001 Kürschák Competition
Let $k\ge 3$ be an integer. Prove that if $n>\binom k3$, then for any $3n$ pairwise different real numbers $a_i,b_i,c_i$ ($1\le i\le n$), among the numbers $a_i+b_i$, $a_i+c_i$, $b_i+c_i$, one can find at least $k+1$ pairwise different numbers. Show that this is not always the case when $n=\binom k3$.
2001 Kürschák Competition
In a square lattice let us take a lattice triangle that has the smallest area among all the lattice triangles similar to it. Prove that the circumcenter of this triangle is not a lattice point.
2000 Kürschák Competition
Paint the grid points of $L=\{0,1,\dots,n\}^2$ with red or green in such a way that every unit lattice square in $L$ has exactly two red vertices. How many such colorings are possible?
2000 Kürschák Competition
Let $ABC$ be a non-equilateral triangle in the plane, and let $T$ be a point different from its vertices. Define $A_T$, $B_T$ and $C_T$ as the points where lines $AT$, $BT$, and $CT$ meet the circumcircle of $ABC$. Prove that there are exactly two points $P$ and $Q$ in the plane for which the triangles $A_PB_PC_P$ and $A_QB_QC_Q$ are equilateral. Prove furthermore that line $PQ$ contains the circumcenter of $\triangle ABC$.
2000 Kürschák Competition
Let $k\ge 0$ be an integer and suppose the integers $a_1,a_2,\dots,a_n$ give at least $2k$ different residues upon division by $(n+k)$. Show that there are some $a_i$ whose sum is divisible by $n+k$.
1999 Kürschák Competition
For any positive integer $m$, denote by $d_i(m)$ the number of positive divisors of $m$ that are congruent to $i$ modulo $2$. Prove that if $n$ is a positive integer, then

$$\left|\sum_{k=1}^n \left(d_0(k)-d_1(k)\right)\right|\le n.$$
1999 Kürschák Competition
Given a triangle on the plane, construct inside the triangle the point $P$ for which the centroid of the triangle formed by the three projections of $P$ onto the sides of the triangle happens to be $P$.
1999 Kürschák Competition
We are given more than $2^k$ integers, where $k\in\mathbb{N}$. Prove that we can choose $k+2$ of them such that if some of our selected numbers satisfy

$$x_1+x_2+\dots+x_m=y_1+y_2+\dots+y_m$$

where $x_1<\dots<x_m$ and $y_1<\dots<y_m$, then $x_i=y_i$ for any $1\le i\le m$.
1998 Kürschák Competition
Is there an infinite sequence of positive integers where no two terms are relatively prime, no term divides any other term, and there is no integer larger than $1$ that divides every term of the sequence?
1998 Kürschák Competition
Prove that for every positive integer $n$, there exists a polynomial with integer coefficients whose values at points $1,2,\dots,n$ are pairwise different powers of $2$.
1998 Kürschák Competition
For which integers $N\ge 3$ can we find $N$ points on the plane such that no three are collinear, and for any triangle formed by three vertices of the points’ convex hull, there is exactly one point within that triangle?
1997 Kürschák Competition
Let $p>2$ be a prime number and let $L=\{0,1,\dots,p-1\}^2$. Prove that we can find $p$ points in $L$ with no three of them collinear.
1997 Kürschák Competition
The center of the circumcircle of $\triangle ABC$ is $O$. The incenter of the triangle is $I$, and the intouch triangle is $A_1B_1C_1$. Let $H_1$ be the orthocenter of $\triangle A_1B_1C_1$. Prove that $O$, $I$, and $H_1$ are collinear.
1997 Kürschák Competition
Prove that the vertices of any planar graph can be colored with $3$ colors such that there is no monochromatic cycle.
1996 Kürschák Competition
Prove that in a trapezoid with perpendicular diagonals, the product of the legs is at least as much as the product of the bases.
1996 Kürschák Competition
Two countries ($A$ and $B$) organize a conference, and they send an equal number of participants. Some of them have known each other from a previous conference. Prove that one can choose a nonempty subset $C$ of the participants from $A$ such that one of the following holds:



the participants from $B$ each know an even number of people in $C$,

the participants from $B$ each know an odd number of participants in $C$.
1996 Kürschák Competition
Let $n$ and $k$ be arbitrary non-negative integers. Suppose we have drawn $2kn+1$ (different) diagonals of a convex $n$-gon. Show that there exists a broken line formed by $2k+1$ of these diagonals that passes through no point more than once. Prove also that this is not necessarily true when we draw only $kn$ diagonals.
1995 Kürschák Competition
Given in the plane is a lattice and a grid rectangle with sides parallel to the coordinate axes. We divide the rectangle into grid triangles with area $\frac12$. Prove that the number of right angled triangles is at least twice as much as the shorter side of the rectangle.



(A grid polygon is a polygon such that both coordinates of each vertex is an integer.)
1995 Kürschák Competition
Consider a polynomial in $n$ variables with real coefficients. We know that if every variable is $\pm1$, the value of the polynomial is positive, or negative if the number of $-1$'s is even, or odd, respectively. Prove that the degree of this polynomial is at least $n$.