Given that $ \{a_n\}$ is a sequence in which all the terms are integers, and $ a_2$ is odd. For any natural number $ n$, $ n(a_{n \plus{} 1} \minus{} a_n \plus{} 3) \equal{} a_{n \plus{} 1} \plus{} a_n \plus{} 3$. Furthermore, $ a_{2009}$ is divisible by $ 2010$. Find the smallest integer $ n > 1$ such that $ a_n$ is divisible by $ 2010$. P.S.: I saw EVEN instead of ODD. Got only half of the points.

Is there a function $f(x)$, which satisfies both of the following conditions: a) if $x \ne y$, then $f(x)\ne f(y)$ b) for all real $x$, holds the inequality $f(x^2-1998x)-f^2(2x-1999)\ge \frac14$?

Let $ f$ be a function defined on the set of non-negative integers and taking values in the same set. Given that (a) $ \displaystyle x \minus{} f(x) \equal{} 19\left[\frac{x}{19}\right] \minus{} 90\left[\frac{f(x)}{90}\right]$ for all non-negative integers $ x$; (b) $ 1900 < f(1990) < 2000$, find the possible values that $ f(1990)$ can take. (Notation : here $ [z]$ refers to largest integer that is $ \leq z$, e.g. $ [3.1415] \equal{} 3$).

Prove the following assertion: If $c_1,c_2,\ldots ,c_n\ (n\ge 2)$ are real numbers such that \[ (n-1)(c_1^2+c_2^2+\cdots +c_n^2)=(c_1+c_2+\cdots + c_n)^2,\] then either all these numbers are nonnegative or all these numbers are nonpositive.

How many 7-element subsets of $\{1, 2, 3,\ldots , 14\}$ are there, the sum of whose elements is divisible by $14$?

Elisa adds the digits of her year of birth and observes that the result coincides with the last two digits of the year her grandfather was born. Furthermore, the last two digits of the year she was born are precisely the current age of her grandfather. Find the year Elisa was born and the year her grandfather was born.

Theo and Wendy are commuting to school from their houses. Theo travels at $x$ miles per hour, while Wendy travels at $x + 5$ miles per hour. The school is $4$ miles from Theo’s house and $10$ miles from Wendy’s house. If Wendy’s commute takes double the amount of time that Theo’s commute takes, how many minutes does it take Wendy to get to school?

Find all real solutions of the system of equations $$\begin{cases} (x_3 + x_4 + x_5)^5 = 3x_1 \\ (x_4 + x_5 + x_1)^5 = 3x_2\\ (x_5 + x _1 + x_2)^5 = 3x_3\\ (x_1 + x_2 + x_3)^5 = 3x_4\\ (x_2 + x_3 + x_4)^5 = 3x_5 \end{cases}$$ (L. Tumescu , Romania)

The domain of a function $f$ is $\mathbb{N}$ (The set of natural numbers). The function is defined as follows : $$f(n)=n+\lfloor\sqrt{n}\rfloor$$ where $\lfloor k\rfloor$ denotes the nearest integer smaller than or equal to $k$. Prove that, for every natural number $m$, the following sequence contains at least one perfect square $$m,~f(m),~f^2(m),~f^3(m),\cdots$$ The notation $f^k$ denotes the function obtained by composing $f$ with itself $k$ times.

In the following sum: $1 + 2 + 3 + 4 + 5 + 6$, if we remove the first two “+” signs, we obtain the new sum $123 + 4 + 5 + 6 = 138$. By removing three “$+$” signs, we can obtain $1 + 23 + 456 = 480$. Let us now consider the sum $1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 + 11 + 12 + 13$, in which some “$+$” signs are to be removed. What are the three smallest multiples of $100$ that we can get in this way?

Consider the sequence $(a_n)_{n\ge 1}$ defined by $a_n=n$ for $n\in \{1,2,3.4,5,6\}$, and for $n \ge 7$: $$a_n={\lfloor}\frac{a_1+a_2+...+a_{n-1}}{2}{\rfloor}$$ where ${\lfloor}x{\rfloor}$ is the greatest integer less than or equal to $x$. For example : ${\lfloor}2.4{\rfloor} = 2, {\lfloor}3{\rfloor} = 3$ and ${\lfloor}\pi {\rfloor}= 3$. For all integers $n \ge 2$, let $S_n = \{a_1,a_1,...,a_n\}- \{r_n\}$ where $r_n$ is the remainder when $a_1 + a_2 + ... + a_n$ is divided by $3$. The minus $-$ denotes the ''[i]remove it if it is there[/i]'' notation. For example : $S_4 = {2,3,4}$ because $r_4= 1$ so $1$ is removed from $\{1,2,3,4\}$. However $S_5= \{1,2,3,4,5\}$ betawe $r_5 = 0$ and $0$ is not in the set $\{1,2,3,4,5\}$. 1. Determine $S_7,S_8,S_9$ and $S_{10}$. 2. We say that a set $S_n$ for $n\ge 6$ is well-balanced if it can be partitioned into three pairwise disjoint subsets with equal sum. For example : $S_6 = \{1,2,3,4,5,6\} =\{1,6\}\cup \{2,5\}\cup \{3,4\}$ and $1 +6 = 2 + 5 = 3 + 4$. Prove that $S_7,S_8,S_9$ and $S_{10}$ are well-balanced . 3. Is the set $S_{2019}$ well-balanced? Justify your answer.

A shop advertises everything is "half price in today's sale." In addition, a coupon gives a $20\%$ discount on sale prices. Using the coupon, the price today represents what percentage off the original price? $\textbf{(A)}\hspace{.05in}10 \qquad \textbf{(B)}\hspace{.05in}33 \qquad \textbf{(C)}\hspace{.05in}40 \qquad \textbf{(D)}\hspace{.05in}60 \qquad \textbf{(E)}\hspace{.05in}70 $

For some natural numbers $a, b, c$ and $d$ the following equations holds: $$\frac{a}{c}= \frac{b}{d}= \frac{ab + 1}{cd + 1} .$$ Prove that $a = c$ and $b = d$.

Let $A$ be a real number and $(a_{n})$ be a sequence of real numbers such that $a_{1}=1$ and \[1<\frac{a_{n+1}}{a_{n}}\leq A \mbox{ for all }n\in\mathbb{N}.\] $(a)$ Show that there is a unique non-decreasing surjective function $f: \mathbb{N}\rightarrow \mathbb{N}$ such that $1<A^{k(n)}/a_{n}\leq A$ for all $n\in \mathbb{N}$. $(b)$ If $k$ takes every value at most $m$ times, show that there is a real number $C>1$ such that $Aa_{n}\geq C^{n}$ for all $n\in \mathbb{N}$.

A sequence of positive integers $a_1,a_2,a_3,\ldots$ satisfies $$a_{n+1} = n\left \lfloor \frac{a_n}{n} \right \rfloor + 1$$ for all positive integers $n$. If $a_{30}=30$, how many possible values can $a_1$ take? (For a real number $x$, $\lfloor x \rfloor$ denotes the largest integer that is not greater than $x$.)

Let $n\geqslant 2$ and $a_1,a_2,\ldots,a_n$ be non-zero integers such that $a_1+a_2+\cdots+a_n=a_1a_2\cdots a_n.$ Prove that \[(a_1^2-1)(a_2^2-1)\cdots(a_n^2-1)\]is a perfect square.

Find all reals $\lambda$ for which there is a nonzero polynomial $P$ with real coefficients such that $$\frac{P(1)+P(3)+P(5)+\ldots+P(2n-1)}n=\lambda P(n)$$for all positive integers $n$, and find all such polynomials for $\lambda=2$.

It is known that a polynomial $P$ with integer coefficients has degree $2022$. What is the maximum $n$ such that there exist integers $a_1, a_2, \cdots a_n$ with $P(a_i)=i$ for all $1\le i\le n$? [Extra: What happens if $P \in \mathbb{Q}[X]$ and $a_i\in \mathbb{Q}$ instead?]

Solve the functional equation $$f(x+y)+f(x-y)=2f(x)\cos{y}$$ where $x,y \in \mathbb{R}$ and $f : \mathbb{R} \rightarrow \mathbb{R}$

Let $x,y,z$ be real numbers such that the numbers $$\frac{1}{|x^2+2yz|},\quad\frac{1}{|y^2+2zx|},\quad\frac{1}{|z^2+2xy|}$$ are lengths of sides of a (non-degenerate) triangle. Determine all possible values of $xy+yz+zx$.

Let $f$ be an injective function from ${1,2,3,\ldots}$ in itself. Prove that for any $n$ we have: $\sum_{k=1}^{n} f(k)k^{-2} \geq \sum_{k=1}^{n} k^{-1}.$

Consider the equation $ x^4 \minus{} 4x^3 \plus{} 4x^2 \plus{} ax \plus{} b \equal{} 0$, where $ a,b\in\mathbb{R}$. Determine the largest value $ a \plus{} b$ can take, so that the given equation has two distinct positive roots $ x_1,x_2$ so that $ x_1 \plus{} x_2 \equal{} 2x_1x_2$.

p1. Circle $M$ is the incircle of ABC, while circle $N$ is the incircle of $ACD$. Circles $M$ and $N$ are tangent at point $E$. If side length $AD = x$ cm, $AB = y$ cm, $BC = z$ cm, find the length of side $DC$ (in terms of $x, y$, and $z$). [img]https://cdn.artofproblemsolving.com/attachments/d/5/66ddc8a27e20e5a3b27ab24ff1eba3abee49a6.png[/img] p2. The address of the house on Jalan Bahagia will be numbered with the following rules: $\bullet$ One side of the road is numbered with consecutive even numbers starting from number $2$. $\bullet$ The opposite side is numbered with an odd number starting from number $3$. $\bullet$ In a row of even numbered houses, there is some land vacant house that has not been built. $\bullet$ The first house numbered $2$ has a neighbor next door. When the RT management ordered the numbers of the house, it is known that the cost of making each digit is $12.000$ Rp. For that, the total cost to be incurred is $1.020.000$ Rp. It is also known that the cost of all even-sided house numbers is $132.000$ Rp. cheaper than the odd side. When the land is empty later a house has been built, the number of houses on the even and odd sides is the same. Determine the number of houses that are now on Jalan Bahagia . p3. Given the following problem: Each element in the set $A = \{10, 11, 12,...,2008\}$ multiplied by each element in the set $B = \{21, 22, 23,...,99\}$. The results are then added together to give value of $X$. Determine the value of $X$. Someone answers the question by multiplying $2016991$ with $4740$. How can you explain that how does that person make sense? p4. Let $P$ be the set of all positive integers between $0$ and $2008$ which can be expressed as the sum of two or more consecutive positive integers . (For example: $11 = 5 + 6$, $90 = 29 + 30 + 31$, $100 = 18 + 19 +20 + 21 + 22$. So $11, 90, 100$ are some members of $P$.) Find the sum of of all members of $P$. p5. A four-digit number will be formed from the numbers at $0, 1, 2, 3, 4, 5$ provided that the numbers in the number are not repeated, and the number formed is a multiple of $3$. What is the probability that the number formed has a value less than $3000$?

Represent the polynomial $P(X) = X^{100} + X^{20} + 1$ as the product of 4 polynomials with integer coefficients.

Find all integers $ k$ such that for infinitely many integers $ n \ge 3$ the polynomial \[ P(x) =x^{n+ 1}+ kx^n - 870x^2 + 1945x + 1995\] can be reduced into two polynomials with integer coefficients.