Denote by $T(n)$ the sum of the digits of the decimal representation of a positive integer $n$. a) Find an integer $N$, for which $T(k \cdot N)$ is even for all $k, 1 \le k \le 1992, $ but $T(1993 \cdot N)$ is odd. b) Show that no positive integer $N$ exists such that $T(k \cdot N)$ is even for all positive integers $k$.

Barry wrote 6 different numbers, one on each side of 3 cards, and laid the cards on a table, as shown. The sums of the two numbers on each of the three cards are equal. The three numbers on the hidden sides are prime numbers. What is the average of the hidden prime numbers? [asy]path card=((0,0)--(0,3)--(2,3)--(2,0)--cycle); draw(card, linewidth(1)); draw(shift(2.5,0)*card, linewidth(1)); draw(shift(5,0)*card, linewidth(1)); label("$44$", (1,1.5)); label("$59$", shift(2.5,0)*(1,1.5)); label("$38$", shift(5,0)*(1,1.5));[/asy] $ \textbf{(A)}\ 13 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 17$

Let $ \mathbb{N}_0$ denote the set of nonnegative integers. Find all functions $ f$ from $ \mathbb{N}_0$ to itself such that \[ f(m \plus{} f(n)) \equal{} f(f(m)) \plus{} f(n)\qquad \text{for all} \; m, n \in \mathbb{N}_0. \]

Find all integer solutions $(x,y)$ of the equation $y^2=x^3-p^2x,$ where $p$ is a prime such that $p\equiv 3 \mod 4.$

Let $p,q$ be primes, where $p>q$. Define $t=\gcd(p!-1,q!-1)$. Prove that $t\le p^{\frac{p}{3}}$.

(a) Decide whether there exist two decimal digits $a$ and $b$, such that every integer with decimal representation $ab222 ... 231$ is divisible by $73$. (b) Decide whether there exist two decimal digits $c$ and $d$, such that every integer with decimal representation $cd222... 231$ is divisible by $79$.

Let $\mathbb R$ be the real numbers. Set $S = \{1, -1\}$ and define a function $\operatorname{sign} : \mathbb R \to S$ by \[ \operatorname{sign} (x) = \begin{cases} 1 & \text{if } x \ge 0; \\ -1 & \text{if } x < 0. \end{cases} \] Fix an odd integer $n$. Determine whether one can find $n^2+n$ real numbers $a_{ij}, b_i \in S$ (here $1 \le i, j \le n$) with the following property: Suppose we take any choice of $x_1, x_2, \dots, x_n \in S$ and consider the values \begin{align*} y_i &= \operatorname{sign} \left( \sum_{j=1}^n a_{ij} x_j \right), \quad \forall 1 \le i \le n; \\ z &= \operatorname{sign} \left( \sum_{i=1}^n y_i b_i \right) \end{align*} Then $z=x_1 x_2 \dots x_n$.

Determine all integers solutions of the equation $x + x^3 = 5y^2$.

The number $0$ or $1$ is to be assigned to each of the $n$ vertices of a regular polygon. In how many different ways can this be done (if we consider two assignments that can be obtained one from the other through rotation in the plane of the polygon to be identical)?

Find the last four digits of $5^{5555}$.

Find the positive integers $n$ with $n \geq 4$ such that $[\sqrt{n}]+1$ divides $n-1$ and $[\sqrt{n}]-1$ divides $n+1$. [hide="Remark"]This problem can be solved in a similar way with the one given at [url=http://www.mathlinks.ro/Forum/resources.php?c=1&cid=97&year=2006]Cono Sur Olympiad 2006[/url], problem 5.[/hide]

Solve for real $x$ : $2^{2x} \cdot 2^{3\{x\}} = 11 \cdot 2^{5\{x\}} + 5 \cdot 2^{2[x]}$ (For a real number $x, [x]$ denotes the greatest integer less than or equal to x. For instance, $[2.5] = 2$, $[-3.1] = -4$, $[\pi ] = 3$. For a real number $x, \{x\}$ is defined as $x - [x]$.)

Does there exist a sequence of natural numbers in which every natural number occurs exactly once, such that for each $k = 1, 2, 3, \dots$ the sum of the first $k$ terms of the sequence is divisible by $k$? [i]A. Shapovalov[/i]

Prove that the number $19^{1976} + 76^{1976}$: $(a)$ is divisible by the (Fermat) prime number $F_4 = 2^{2^4} + 1$; $(b)$ is divisible by at least four distinct primes other than $F_4$.

Find all real number $p$, such that the three roots of the equation $5x^3-5(p+1)x^2+(71p-1)x+1=66p$ are all positive integers.

Find the largest possible value of the positive integer $N$ given that there exist positive integers $a_1, a_2, \dots, a_N$ satisfying $$ a_n = \sqrt{(a_{n-1})^2 + 2018 \, a_{n-2}}\:, \quad \text{for } n = 3,4,\dots,N. $$

[b]p1.[/b] Solve: $INK + INK + INK + INK + INK + INK = PEN$ ($INK$ and $PEN$ are $3$-digit numbers, and different letters stand for different digits). [b]p2. [/b]Two people play a game. They put $3$ piles of matches on the table: the first one contains $1$ match, the second one $3$ matches, and the third one $4$ matches. Then they take turns making moves. In a move, a player may take any nonzero number of matches FROM ONE PILE. The player who takes the last match from the table loses the game. a) The player who makes the first move can win the game. What is the winning first move? b) How can he win? (Describe his strategy.) [b]p3.[/b] The planet Naboo is under attack by the imperial forces. Three rebellion camps are located at the vertices of a triangle. The roads connecting the camps are along the sides of the triangle. The length of the first road is less than or equal to $20$ miles, the length of the second road is less than or equal to $30$ miles, and the length of the third road is less than or equal to $45$ miles. The Rebels have to cover the area of this triangle with a defensive field. What is the maximal area that they may need to cover? [b]p4.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. What is the smallest amount of money you need to buy a slice of pizza that costs $\$ 1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do, since the pizza man can only give you $\$5$ back. [b]p5.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line. (b) Do the same with $6$ points. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that among $39$ sequential natural numbers there always is a number with the sum of its digits divisible by $11$.

Let $n$ be an even positive integer. A sequence of $n$ real numbers is called complete if for every integer $m$ with $1 \leq m \leq n$ either the sum of the first $m$ terms of the sum or the sum of the last $m$ terms is integral. Determine the minimum number of integers in a complete sequence of $n$ numbers.

Given [i]Fibonacci[/i] sequence $(F_n),$ and a positive integer $m$, denote $k(m)$ by the smallest positive integer satisfying $F_{n+k(m)}\equiv F_n(\bmod m),$ for all natural numbers $n$, $p$ is an odd prime such that $p \equiv \pm 1(\bmod 5)$. Prove that: a) ${F_{p + 1}} \equiv 0(\bmod p).$ b) $k(p)|2p+2.$ c) $k(p)$ is divisible by $4.$

[b]p1.[/b] Give a fake proof that $0 = 1$ on the back of this page. The most convincing answer to this question at this test site will receive a point. [b]p2.[/b] It is often said that once you assume something false, anything can be derived from it. You may assume for this question that $0 = 1$, but you can only use other statements if they are generally accepted as true or if your prove them from this assumption and other generally acceptable mathematical statements. With this in mind, on the back of this page prove that every number is the same number. [b]p3.[/b] Suppose you write out all integers between $1$ and $1000$ inclusive. (The list would look something like $1$, $2$, $3$, $...$ , $10$, $11$, $...$ , $999$, $1000$.) Which digit occurs least frequently? [b]p4.[/b] Pick a real number between $0$ and $1$ inclusive. If your response is $r$ and the standard deviation of all responses at this site to this question is $\sigma$, you will receive $r(1 - (r - \sigma)^2)$ points. [b]p5.[/b] Find the sum of all possible values of $x$ that satisfy $243^{x+1} = 81^{x^2+2x}$. [b]p6.[/b] How many times during the day are the hour and minute hands of a clock aligned? [b]p7.[/b] A group of $N + 1$ students are at a math competition. All of them are wearing a single hat on their head. $N$ of the hats are red; one is blue. Anyone wearing a red hat can steal the blue hat, but in the process that person’s red hat disappears. In fact, someone can only steal the blue hat if they are wearing a red hat. After stealing it, they would wear the blue hat. Everyone prefers the blue hat over a red hat, but they would rather have a red hat than no hat at all. Assuming that everyone is perfectly rational, find the largest prime $N$ such that nobody will ever steal the blue hat. [b]p8.[/b] On the back of this page, prove there is no function f$(x)$ for which there exists a (finite degree) polynomial $p(x)$ such that $f(x) = p(x)(x + 3) + 8$ and $f(3x) = 2f(x)$. [b]p9.[/b] Given a cyclic quadrilateral $YALE$ with $Y A = 2$, $AL = 10$, $LE = 11$, $EY = 5$, what is the area of $YALE$? [b]p10.[/b] About how many pencils are made in the U.S. every year? If your answer to this question is $p$, and our (good) estimate is $\rho$, then you will receive $\max(0, 1 -\frac 12 | \log_{10}(p) - \log_{10}(\rho)|)$ points. [b]p11.[/b] The largest prime factor of $520, 302, 325$ has $5$ digits. What is this prime factor? [b]p12.[/b] The previous question was on the individual round from last year. It was one of the least frequently correctly answered questions. The first step to solving the problem and spotting the pattern is to divide $520, 302, 325$ by an appropriate integer. Unfortunately, when solving the problem many people divide it by $n$ instead, and then they fail to see the pattern. What is $n$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A number is called [i]purple[/i] if it can be expressed in the form $\frac{1}{2^a 5^b}$ for positive integers $a > b$. The sum of all purple numbers can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a, b$. Compute $100a + b$. [i]Proposed by Eugene Chen[/i]

Let $k > 1$ be a fixed integer. Prove that there are infinite positive integers $n$ such that $$ lcm \, (n, n + 1, n + 2, ... , n + k) > lcm \, (n + 1, n + 2, n + 3,... , n + k + 1).$$

Given an infinite positive integer sequence $\{x_i\}$ such that $$x_{n+2}=x_nx_{n+1}+1$$ Prove that for any positive integer $i$ there exists a positive integer $j$ such that $x_j^j$ is divisible by $x_i^i$. [i]Remark: Unfortunately, there was a mistake in the problem statement during the contest itself. In the last sentence, it should say "for any positive integer $i>1$ ..."[/i]

Let n is a natural number,for which $\sqrt{1+12n^2}$ is a whole number.Prove that $2+2\sqrt{1+12n^2}$ is perfect square.