Function $f$ is defined on the positive integers by $f(1)=1$, $f(2)=2$ and $$f(n+2)=f(n+2-f(n+1))+f(n+1-f(n))\enspace\text{for }n\ge1.$$ (a) Prove that $f(n+1)-f(n)\in\{0,1\}$ for each $n\ge1$. (b) Show that if $f(n)$ is odd then $f(n+1)=f(n)+1$. (c) For each positive integer $k$ find all $n$ for which $f(n)=2^{k-1}+1$.

Determine all positive integers $n$ such that $\frac{a^2+n^2}{b^2-n^2}$ is a positive integer for some $a,b\in \mathbb{N}$. $Turkey$

Andrew has a four-digit number whose last digit is $2$. Given that this number is divisible by $9$, determine the number of possible values for this number that Andrew could have. Note that leading zeros are not allowed.

In a particular European city, there are only $7$ day tickets and $30$ day tickets to the public transport. The former costs $7.03$ euro and the latter costs $30$ euro. Aina the Algebraist decides to buy at once those tickets that she can travel by the public transport the whole three year (2014-2016, 1096 days) visiting in the city. What is the cheapest solution?

Michael writes down all the integers between $1$ and $N$ inclusive on a piece of paper and discovers that exactly $40\%$ of them have leftmost digit $1$. Given that $N > 2017$, find the smallest possible value of $N$.

For real number $r$ let $f(r)$ denote the integer that is the closest to $r$ (if the fractional part of $r$ is $1/2$, let $f(r)$ be $r-1/2$). Let $a>b>c$ rational numbers such that for all integers $n$ the following is true: $f(na)+f(nb)+f(nc)=n$. What can be the values of $a$, $b$ and $c$? [i]Submitted by Gábor Damásdi, Budapest[/i]

For any positive integer $n $ let $ d(n) $ denote the number of positive divisors of $ n $. Do there exist positive integers $ a $ and $b $, such that $ d(a)=d(b)$ and $ d(a^2 ) = d(b^2 ) $, but $ d(a^3 ) \ne d(b^3 ) $ ?

Prove that for any positive integer $n$, the least common multiple of the numbers $1,2,\ldots,n$ and the least common multiple of the numbers: \[\binom{n}{1},\binom{n}{2},\ldots,\binom{n}{n}\] are equal if and only if $n+1$ is a prime number. [i]Laurentiu Panaitopol[/i]

$m, n $ are positive integers and $p$ is a prime number. Find all triples $(m, n, p)$ satisfying $(m^3+n)(n^3+m)=p^3$

If there are integers $a,b,c$ such that $a^2+b^2+c^2-ab-bc-ca$ is divisible by a prime $p$ such that $\text{gcd}(p,\frac{a^2+b^2+c^2-ab-bc-ca}{p})=1$, then prove that there are integers $x,y,z$ such that $p=x^2+y^2+z^2-xy-yz-zx$.

Let $a, b, c, d$ be positive integers such that $ab = cd$. Prove that $w = a^{2006} + b^{2006} + c^{2006} + d^{2006}$ is composite.

$n$ people sitting at a round table. In the beginning, everyone writes down a positive number $n$ on piece of paper in front of them. From now on, in every minute, they write down the number that they get if they subtract the number of their right-hand neighbour from their own number. They write down the new number and erase the original. Give those number $n$ that there exists an integer $k$ in a way that regardless of the starting numbers, after $k$ minutes, everyone will have a number that is divisible by $n$.

[b]p1.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square? [b]p2.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from $1$ to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number $3$? The total number of all obtained points is $264$. [b]p2.[/b] There are exactly $n$ students in a high school. Girls send messages to boys. The first girl sent messages to $5$ boys, the second to $7$ boys, the third to $6$ boys, the fourth to $8$ boys, the fifth to $7$ boys, the sixth to $9$ boys, the seventh to $8$, etc. The last girl sent messages to all the boys. Prove that $n$ is divisible by $3$. [b]p4.[/b] In what minimal number of triangles can one cut a $25 \times 12$ rectangle in such a way that one can tile by these triangles a $20 \times 15$ rectangle. [b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $N$ be the number of sequences $a_1, a_2, . . . , a_{10}$ of ten positive integers such that (i) the value of each term of the sequence at most $30$, (ii) the arithmetic mean of any three consecutive terms of the sequence is an integer, and (iii) the arithmetic mean of any five consecutive terms of the sequence is an integer. Compute $\sqrt{N}$.

Find the ordered quadruple of digits $(A,B,C,D)$ with $A > B > C > D$, such that $$\begin{tabular}{ccccc} & A & B & C & D \\ - & D & C & B & A \\ \hline = & B & D & A & C \\ \end{tabular}$$

The sequence of Fibonnaci's numbers if defined from the two first digits $f_1=f_2=1$ and the formula $f_{n+2}=f_{n+1}+f_n$, $\forall n \in N$. [b](a)[/b] Prove that $f_{2010} $ is divisible by $10$. [b](b)[/b] Is $f_{1005}$ divisible by $4$? Albanian National Mathematical Olympiad 2010---12 GRADE Question 4.

Let $ m$ a positive integer and $ p$ a prime number, both fixed. Define $ S$ the set of all $ m$-uple of positive integers $ \vec{v} \equal{} (v_1,v_2,\ldots,v_m)$ such that $ 1 \le v_i \le p$ for all $ 1 \le i \le m$. Define also the function $ f(\cdot): \mathbb{N}^m \to \mathbb{N}$, that associates every $ m$-upla of non negative integers $ (a_1,a_2,\ldots,a_m)$ to the integer $ \displaystyle f(a_1,a_2,\ldots,a_m) \equal{} \sum_{\vec{v} \in S} \left(\prod_{1 \le i \le m}{v_i^{a_i}} \right)$. Find all $ m$-uple of non negative integers $ (a_1,a_2,\ldots,a_m)$ such that $ p \mid f(a_1,a_2,\ldots,a_m)$. [i](Pierfrancesco Carlucci)[/i]

[b]p1.[/b] Compute $2020 \cdot \left( 2^{(0\cdot1)} + 9 - \frac{(20^1)}{8}\right)$. [b]p2.[/b] Nathan has five distinct shirts, three distinct pairs of pants, and four distinct pairs of shoes. If an “outfit” has a shirt, pair of pants, and a pair of shoes, how many distinct outfits can Nathan make? [b]p3.[/b] Let $ABCD$ be a rhombus such that $\vartriangle ABD$ and $\vartriangle BCD$ are equilateral triangles. Find the angle measure of $\angle ACD$ in degrees. [b]p4.[/b] Find the units digit of $2019^{2019}$. [b]p5.[/b] Determine the number of ways to color the four vertices of a square red, white, or blue if two colorings that can be turned into each other by rotations and reflections are considered the same. [b]p6.[/b] Kathy rolls two fair dice numbered from $1$ to $6$. At least one of them comes up as a $4$ or $5$. Compute the probability that the sumof the numbers of the two dice is at least $10$. [b]p7.[/b] Find the number of ordered pairs of positive integers $(x, y)$ such that $20x +19y = 2019$. [b]p8.[/b] Let $p$ be a prime number such that both $2p -1$ and $10p -1$ are prime numbers. Find the sum of all possible values of $p$. [b]p9.[/b] In a square $ABCD$ with side length $10$, let $E$ be the intersection of $AC$ and $BD$. There is a circle inscribed in triangle $ABE$ with radius $r$ and a circle circumscribed around triangle $ABE$ with radius $R$. Compute $R -r$ . [b]p10.[/b] The fraction $\frac{13}{37 \cdot 77}$ can be written as a repeating decimal $0.a_1a_2...a_{n-1}a_n$ with $n$ digits in its shortest repeating decimal representation. Find $a_1 +a_2 +...+a_{n-1}+a_n$. [b]p11.[/b] Let point $E$ be the midpoint of segment $AB$ of length $12$. Linda the ant is sitting at $A$. If there is a circle $O$ of radius $3$ centered at $E$, compute the length of the shortest path Linda can take from $A$ to $B$ if she can’t cross the circumference of $O$. [b]p12.[/b] Euhan and Minjune are playing tennis. The first one to reach $25$ points wins. Every point ends with Euhan calling the ball in or out. If the ball is called in, Minjune receives a point. If the ball is called out, Euhan receives a point. Euhan always makes the right call when the ball is out. However, he has a $\frac34$ chance of making the right call when the ball is in, meaning that he has a $\frac14$ chance of calling a ball out when it is in. The probability that the ball is in is equal to the probability that the ball is out. If Euhan won, determine the expected number of wrong callsmade by Euhan. [b]p13.[/b] Find the number of subsets of $\{1, 2, 3, 4, 5, 6,7\}$ which contain four consecutive numbers. [b]p14.[/b] Ezra and Richard are playing a game which consists of a series of rounds. In each round, one of either Ezra or Richard receives a point. When one of either Ezra or Richard has three more points than the other, he is declared the winner. Find the number of games which last eleven rounds. Two games are considered distinct if there exists a round in which the two games had different outcomes. [b]p15.[/b] There are $10$ distinct subway lines in Boston, each of which consists of a path of stations. Using any $9$ lines, any pair of stations are connected. However, among any $8$ lines there exists a pair of stations that cannot be reached from one another. It happens that the number of stations is minimized so this property is satisfied. What is the average number of stations that each line passes through? [b]p16.[/b] There exist positive integers $k$ and $3\nmid m$ for which $$1 -\frac12 + \frac13 - \frac14 +...+ \frac{1}{53}-\frac{1}{54}+\frac{1}{55}=\frac{3^k \times m}{28\times 29\times ... \times 54\times 55}.$$ Find the value $k$. [b]p17.[/b] Geronimo the giraffe is removing pellets from a box without replacement. There are $5$ red pellets, $10$ blue pellets, and $15$ white pellets. Determine the probability that all of the red pellets are removed before all the blue pellets and before all of the white pellets are removed. [b]p18.[/b] Find the remainder when $$70! \left( \frac{1}{4 \times 67}+ \frac{1}{5 \times 66}+...+ \frac{1}{66\times 5}+ \frac{1}{67\times 4} \right)$$ is divided by $71$. [b]p19.[/b] Let $A_1A_2...A_{12}$ be the regular dodecagon. Let $X$ be the intersection of $A_1A_2$ and $A_5A_{11}$. Given that $X A_2 \cdot A_1A_2 = 10$, find the area of dodecagon. [b]p20.[/b] Evaluate the following infinite series: $$\sum^{\infty}_{n=1}\sum^{\infty}_{m=1} \frac{n \sec^2m -m \tan^2 n}{3^{m+n}(m+n)}$$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a, b$ be integers, and let $P(x) = ax^3+bx.$ For any positive integer $n$ we say that the pair $(a,b)$ is $n$-good if $n | P(m)-P(k)$ implies $n | m - k$ for all integers $m, k.$ We say that $(a,b)$ is $very \ good$ if $(a,b)$ is $n$-good for infinitely many positive integers $n.$ [list][*][b](a)[/b] Find a pair $(a,b)$ which is 51-good, but not very good. [*][b](b)[/b] Show that all 2010-good pairs are very good.[/list] [i]Proposed by Okan Tekman, Turkey[/i]

Does there exist an integer $z$ that can be written in two different ways as $z = x! + y!$, where $x, y$ are natural numbers with $x \le y$ ?

The natural numbers $t{}$ and $q{}$ are given. For an integer $s{}$, we denote by $f(s)$ the number of lattice points lying in the triangle with vertices $(0;-t/q), (0; t/q)$ and $(t; ts/q)$. Suppose that $q{}$ divides $rs-1{}$. Prove that $f(r) = f(s)$.

Define the functions $g_k \colon \mathbb{Z} \to \mathbb{Z}$, $g_k(x) = x^k$, where $k$ is a positive integer. Find the set $M_k$ of positive integers $n$ for which there exist injective functions $f_1,f_2, \dots ,f_n \colon \mathbb{Z} \to \mathbb{Z}$ such that $g_k=f_1\cdot f_2 \cdot \ldots \cdot f_n$. (Here, $\cdot$ denotes component-wise function multiplication)

Let $n$ be an integer greater than $2$ and consider the set \begin{align*} A = \{2^n-1,3^n-1,\dots,(n-1)^n-1\}. \end{align*} Given that $n$ does not divide any element of $A$, prove that $n$ is a square-free number. Does it necessarily follow that $n$ is a prime?

Given 11 natural numbers under 21, show that you can choose two such that one divides the other.

Bamicin is initially at $(20, 20)$ in a cartesian plane. Every minute, if Bamicin is at point $P$, Bamicin can move to a lattice point exactly $37$ units from $P$. Determine all lattice points Bamicin can visit.