A positive integer is [i]brazilian[/i] if the first digit and the last digit are equal. For instance, $4$ and $4104$ are brazilians, but $10$ is not brazilian. A brazilian number is [i]superbrazilian[/i] if it can be written as sum of two brazilian numbers. For instance, $101=99+2$ and $22=11+11$ are superbrazilians, but $561=484+77$ is not superbrazilian, because $561$ is not brazilian. How many $4$-digit numbers are superbrazilians?

Consider function $f:\mathbb{R}\to \mathbb{R}$ with $f(x)=\frac{4^x}{4^x+2},$ for any $x\in \mathbb{R}$ a) Prove that $f(x)+f(1-x)=1,$ b) Claculate the sum $$f\left(\frac{1}{1986} \right)+f\left(\frac{2}{1986} \right)+\cdots f\left(\frac{1986}{1986} \right).$$

Let $a,b,$ and $c$ be pairwise distinct positive integers such that $\tfrac{1}{a}, \tfrac{1}{b}, \tfrac{1}{c}$ is an increasing arithmetic sequence in that order. Prove that $\gcd(a,b)>1.$

The sequence ${a_1, a_2, ..., a_{2019}}$ satisfies the following condition. $a_1=1, a_{n+1}=2019a_{n}+1$ Now let $x_1, x_2, ..., x_{2019}$ real numbers such that $x_1=a_{2019}, x_{2019}=a_1$ (The others are arbitary.) Prove that $\sum_{k=1}^{2018} (x_{k+1}-2019x_k-1)^2 \ge \sum_{k=1}^{2018} (a_{2019-k}-2019a_{2020-k}-1)^2$

Four couples play chess together. For the match, they're paired as follows: ("man Clara" indicates the husband of Clara, etc.) \[Bea \Longleftrightarrow Eddy\] \[An \Longleftrightarrow man\ Clara\] \[Freddy \Longleftrightarrow woman\ Guy\] \[Debby \Longleftrightarrow man\ An\] \[Guy \Longleftrightarrow woman\ Eddy\] Who is $Hubert$ married to?

Rectangle $ABCD$ has sides $AB = 10$ and $AD = 7$. Point $G$ lies in the interior of $ABCD$ a distance $2$ from side $\overline{CD}$ and a distance $2$ from side $\overline{BC}$. Points $H, I, J$, and $K$ are located on sides $\overline{BC}, \overline{AB}, \overline{AD}$, and $\overline{CD}$, respectively, so that the path $GHIJKG$ is as short as possible. Then $AJ = \frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Let $a, b, c$ be positive integers such that no number divides some other number. If $ab-b+1 \mid abc+1$, prove that $c \geq b$.

Let $[n] = \{1, 2, 3, ... ,n\}$ and for any set $S$, let$ P(S)$ be the set of non-empty subsets of $S$. What is the last digit of $|P(P([2013]))|$?

$A$ writes, at his choice, $8$ ones and $8$ twos on a $4\times 4$ board. Then $B$ covers the board with $8$ dominoes and for each domino she finds the smaller of the two numbers that that domino covers. Finally, $A$ adds these $8$ numbers and the result is her score. What is the highest score $A$ can secure, no matter how $B$ plays? Clarification: A domino is a $1\times 2$ or $2\times 1$ rectangle that covers exactly two squares on the board.

Find the greatest $n$ such that $(z+1)^n = z^n + 1$ has all its non-zero roots in the unitary circumference, e.g. $(\alpha+1)^n = \alpha^n + 1, \alpha \neq 0$ implies $|\alpha| = 1.$

Is it possible to arrange the numbers $1^1, 2^2,..., 2008^{2008}$ one after the other, in such a way that the obtained number is a perfect square? (Explain your answer.)

Determine all functions $f : R \to R$ such that $$f(x)f(y) = 2f(x + y) + 9xy \ \ \forall x, y \in R.$$

An arithmetic sequence has $n \geq 3$ terms, initial term $a$ and common difference $d > 1$. Carl wrote down all the terms in this sequence correctly except for one term which was off by $1$. The sum of the terms was $222$. What was $a + d + n$ $\textbf{(A) } 24 \qquad \textbf{(B) } 20 \qquad \textbf{(C) } 22 \qquad \textbf{(D) } 28 \qquad \textbf{(E) } 26$

Is it possible to cut the table of size $2007\times2007$ into figures shown here, if one has to use at least one figure of each sort? $\begin{picture}(45,25) \put(5,5){\put(0,0){\line(1,0){16}}\put(0,8){\line(1,0){24}}\put(0,16){\line(1,0){24}}\put(8,24){\line(1,0){16}}\put(0,0){\line(0,1){16}}\put(8,0){\line(0,1){24}}\put(16,0){\line(0,1){24}}\put(24,8){\line(0,1){16}}}\put(35,5){\put(0,0){\line(1,0){8}}\put(0,8){\line(1,0){8}}\put(0,16){\line(1,0){8}}\put(0,24){\line(1,0){8}}\put(0,0){\line(0,1){24}}\put(8,0){\line(0,1){24}}}\end{picture}$

If $ y \equal{} \sqrt{x^2 \minus{} 2x \plus{} 1} \plus{} \sqrt{x^2 \plus{} 2x \plus{} 1}$, then $ y$ is: $ \textbf{(A)}\ 2x\qquad \textbf{(B)}\ 2(x \plus{} 1)\qquad \textbf{(C)}\ 0\qquad \textbf{(D)}\ |x \minus{} 1| \plus{} |x \plus{} 1|\qquad \textbf{(E)}\ \text{none of these}$

The altitudes $AH, CH$ of an acute-angled triangle $ABC$ meet the internal bisector of angle $B$ at points $L_1, P_1$, and the external bisector of this angle at points $L_2, P_2$. Prove that the orthocenters of triangles $HL_1P_1, HL_2P_2$ and the vertex $B$ are collinear.

Let the centroid of the triangle $ABC$ be $G$ and let the line parallel to $\overline{BC}$ that passes through $A$ be $l$. Define a point, $D$ on $l$ such that $\angle DGC=90^o$. Prove that \[2[ADCG]\leq AB\cdot DC\] For clarification, [ADGC] represents the area of the quadrilateral ADGC.

There are 1000 gentlemen listed in the register of a city with numbers from 1 to 1000. Any 720 of them form a club. The mayor wants to impose a tax on each club, which is paid by all club members in equal shares (the tax is an arbitrary non-negative real number). At the same time, the total tax paid by a gentleman should not exceed his number in the register. What is the largest tax the mayor can collect? [i]Proposed by I. Bogdanov[/i]

Let $A$ be a set of positive integers such that for any two distinct elements $x, y\in A$ we have $|x-y| \geq \frac{xy}{25}.$ Prove that $A$ contains at most nine elements. Give an example of such a set of nine elements.

Find all quadrilaterals which can be covered (without overlappings) with squares with side $ 1$ and equilateral triangles with side $ 1$. (Emanuele Tron)

(i): Prove that if $n$ is a positive integer, then $$\binom{2n}{n}=\frac{(2n)!}{(n!)^2}$$ is a positive integer that is divisible by all prime numbers $p$ with $n<p\le 2n$, and that $$\binom{2n}{n}<2^{2n}.$$ (ii): For $x$ a positive real number, let $\pi(x)$ denote the number of prime numbers $p \le x$. [Thus, $\pi(10) = 4$ since there are $4$ primes, viz., $2$, $3$, $5$, and $7$, not exceeding $10$.]Prove that if $n \ge 3$ is an integer, then (a)$$\pi(2n) < \pi(n) + {{2n}\over{\log_2(n)}};$$(b)$$\pi(2^n) < {{2^{n+1}\log_2(n-1)}\over{n}};$$(c) Deduce that, for all real numbers $x \ge 8$,$$\pi(x) < {{4x \log_2(\log_2(x))}\over{\log_2(x)}}.$$

It is known about the numbers $a, b$ and $c$ that $\frac{a}{b+c-a}=\frac{b}{a ​​+ c-b}= \frac{c}{a ​​+ b-c}$. What values ​​can an expression take $\frac{(a + b) (b + c) (a + c)}{abc}$ ?

Daphne is visited periodically by her three best friends: Alice, Beatrix, and Claire. Alice visits every third day, Beatrix visits every fourth day, and Claire visits every fifth day. All three friends visited Daphne yesterday. How many days of the next $365$-day period will exactly two friends visit her? $\textbf{(A) }48\qquad \textbf{(B) }54\qquad \textbf{(C) }60\qquad \textbf{(D) }66\qquad \textbf{(E) }72\qquad$

In a bank, only the manager knows the safe's combination, which is a five-digit number. To support this combination, each of the bank's ten employees is given a five-digit number. Each of these backup numbers has in one of the five positions the same digit as the combination and in the other four positions a different digit than the one in that position in the combination. Backup numbers are: $07344$, $14098$, $27356$, $36429$, $45374$, $52207$, $63822$, $70558$, $85237$, $97665$. What is the combination to the safe?

Senators Sernie Banders and Cedric "Ced" Truz of OMOrica are running for the office of Price Dent. The election works as follows: There are $66$ states, each composed of many adults and $2017$ children, with only the latter eligible to vote. On election day, the children each cast their vote with equal probability to Banders or Truz. A majority of votes in the state towards a candidate means they "win" the state, and the candidate with the majority of won states becomes the new Price Dent. Should both candidates win an equal number of states, then whoever had the most votes cast for him wins. Let the probability that Banders and Truz have an unresolvable election, i.e., that they tie on both the state count and the popular vote, be $\frac{p}{q}$ in lowest terms, and let $m, n$ be the remainders when $p, q$, respectively, are divided by $1009$. Find $m + n$. [i]Proposed by Ashwin Sah[/i]