A finite set of integers is called bad if its elements add up to 2010. A finite set of integers is a Benelux-set if none of its subsets is bad. Determine the smallest integer $n$ such that the set $\{502,503,504, \ldots, 2009\}$ can be partitioned into $n$ Benelux-sets. (A partition of a set $S$ into $n$ subsets is a collection of $n$ pairwise disjoint subsets of $S$, the union of which equals $S$.)

Find all polynomials $p(x)$ with real coefficients such that

$$p(a+b-2 c)+p(b+c-2 a)+p(c+a-2 b)=3 p(a-b)+3 p(b-c)+3 p(c-a)$$

for all $a, b, c \in \mathbb{R}$.

On a line $l$ there are three different points $A, B$ and $P$ in that order. Let $a$ be the line through $A$ perpendicular to $l$, and let $b$ be the line through $B$ perpendicular to $l$. A line through $P$, not coinciding with $l$, intersects $a$ in $Q$ and $b$ in $R$. The line through $A$ perpendicular to $B Q$ intersects $B Q$ in $L$ and $B R$ in $T$. The line through $B$ perpendicular to $A R$ intersects $A R$ in $K$ and $A Q$ in $S$. (a) Prove that $P, T, S$ are collinear. (b) Prove that $P, K, L$ are collinear.

Find all quadruples $(a, b, p, n)$ of positive integers, such that $p$ is a prime and

$$a^{3}+b^{3}=p^{n}$$