Let a sequence of integers $\{a_n\}$, $n \in \mathbb{N}$ be given, defined by \[a_0 = 1, a_n= a_{n-1} + a_{[n/3]}\] for all $n \in \mathbb{N}^{*}$. Show that for all primes $p \leq 13$, there are infinitely many integer numbers $k$ such that $a_k$ is divided by $p$. (Here $[x]$ denotes the integral part of real number $x$).

Find the value of \[\sum_{a = 1}^{\infty} \sum_{b = 1}^{\infty} \sum_{c = 1}^{\infty} \frac{ab(3a + c)}{4^{a+b+c} (a+b)(b+c)(c+a)}.\]

[b]p1.[/b] The Evergreen School booked buses for a field trip. Altogether, $138$ people went to West Lake, while $115$ people went to East Lake. The buses all had the same number of seats, and every bus has more than one seat. All seats were occupied and everybody had a seat. How many seats were there in each bus? [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $50$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a 6 cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $150$ coins? [b]p3.[/b] Pinocchio multiplied two $2$ digit numbers. But witch Masha erased some of the digits. The erased digits are the ones marked with a $*$. Could you help Pinocchio to restore all the erased digits? $\begin{tabular}{ccccc} & & & 9 & 5 \\ x & & & * & * \\ \hline & & & * & * \\ + & 1 & * & * & \\ \hline & * & * & * & * \\ \end{tabular}$ Find all solutions. [b]p4.[/b] There are $50$ senators and $435$ members of House of Representatives. On Friday all of them voted a very important issue. Each senator and each representative was required to vote either "yes" or "no". The announced results showed that the number of "yes" votes was greater than the number of "no" votes by $24$. Prove that there was an error in counting the votes. [b]p5.[/b] Was there a year in the last millennium (from $1000$ to $2000$) such that the sum of the digits of that year is equal to the product of the digits? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If $a,b,c$ are the roots of $x^3+20x^2+1x+5$, compute $(a^2+1)(b^2+1)(c^2+1)$. [i]2015 CCA Math Bonanza Tiebreaker Round #2[/i]

A non-zero polynomial $ S\in\mathbb{R}[X,Y]$ is called homogeneous of degree $ d$ if there is a positive integer $ d$ so that $ S(\lambda x,\lambda y)\equal{}\lambda^dS(x,y)$ for any $ \lambda\in\mathbb{R}$. Let $ P,Q\in\mathbb{R}[X,Y]$ so that $ Q$ is homogeneous and $ P$ divides $ Q$ (that is, $ P|Q$). Prove that $ P$ is homogeneous too.

Real constants $ a, b, c$ are such that there is exactly one square all of whose vertices lie on the cubic curve $ y \equal{} x^3 \plus{} ax^2 \plus{} bx \plus{} c.$ Prove that the square has sides of length $ \sqrt[4]{72}.$

Let $P(x)= x^n+a_{1}x^{n-1}+...+a_{n-1}x+(-1)^{n}$ , $a_{i} \in C$ , $n\geq 2$ with all roots having same modulo. Prove that $P(-1) \in R$

Let $P(x)=x^6-x^5-x^3-x^2-x$ and $a,b,c$ and $d$ be the roots of the equation $x^4-x^3-x^2-1=0$, then determine the value of $P(a)+P(b)+P(c)+P(d)$ (A)$5$ (B)$6$ (C)$7$ (D)$8$

Let $f : Q \to Q$ be a function satisfying the equation $f(x + y) = f(x) + f(y) + 2547$ for all rational numbers $x, y$. If $f(2004) = 2547$, find $f(2547)$.

Find all positive integers $p$ and $q$ such that all the roots of the polynomial $(x^2 - px+q)(x^2 -qx+ p)$ are positive integers.

For each positive integer $p$, let $b(p)$ denote the unique positive integer $k$ such that $|k-\sqrt{p}|<\frac{1}{2}$. For example, $b(6) = 2$ and $b(23)=5$. If $S = \textstyle\sum_{p=1}^{2007}b(p)$, find the remainder when S is divided by 1000.

Let $Q^+$ denote the set of positive rationals. Determine all functions $f : Q^+ \to Q^+$ that satisfy both of these conditions: (i) $f(x)$ is an integer if and only if $x$ is an integer; (ii) $f(f(xf(y)) + x) = yf(x) + x$ for all $x, y \in Q^+$.

Find all natural numbers $ n $ for which there exists two natural numbers $ a,b $ such that $$ n=S(a)=S(b)=S(a+b) , $$ where $ S(k) $ denotes the sum of the digits of $ k $ in base $ 10, $ for any natural number $ k. $ [i]Vasile Zidaru[/i] and [i]Mircea Lascu[/i]

Let $m$, $n$ be positive integers. Prove that, for some positive integer $a$, each of $\phi(a)$, $\phi(a+1)$, $\cdots$, $\phi(a+n)$ is a multiple of $m$.

Suppose $P(x)$ is a quadratic polynomial with integer coefficients satisfying the identity \[P(P(x)) - P(x)^2 = x^2+x+2016\] for all real $x$. What is $P(1)$?

Decompose the expression into real factors: \[E = 1 - \sin^5(x) - \cos^5(x).\]

Let $a$, $b$ and $c$ be positive real numbers such that $ab+bc+ca=1$. Prove the inequality: $$\frac{1}{a}+\frac{1}{b}+\frac{1}{c} \geq 3(a+b+c)$$

Let $ a_{0} \equal{} 1994$ and $ a_{n \plus{} 1} \equal{} \frac {a_{n}^{2}}{a_{n} \plus{} 1}$ for each nonnegative integer $ n$. Prove that $ 1994 \minus{} n$ is the greatest integer less than or equal to $ a_{n}$, $ 0 \leq n \leq 998$

Let $n$ be a positive integer and $a_1,a_2,\ldots a_{2n+1}$ be positive reals. For $k=1,2,\ldots ,2n+1$, denote $b_k = \max_{0\le m\le n}\left(\frac{1}{2m+1} \sum_{i=k-m}^{k+m} a_i \right)$, where indices are taken modulo $2n+1$. Prove that the number of indices $k$ satisfying $b_k\ge 1$ does not exceed $2\sum_{i=1}^{2n+1} a_i$.

Determine graphically the number of roots of the equation $\sin x = \lg x$.

Determine all functions $ f: \mathbb{R} \mapsto \mathbb{R}$ such that \[ x f(x \plus{} xy) \equal{} x f(x) \plus{} f \left( x^2 \right) f(y) \quad \forall x,y \in \mathbb{R}.\]

a) Find all real numbers $k$ such that there exists a positive constant $c_k$ satisfying $$(x^2 + 1)(y^2 + 1)(z^2 + 1) \ge c_k(x + y + z)^k$$ for all positive real numbers. b) Given the numbers $k$ found, determine the largest number $c_k$.

Find the least value of $k\in \mathbb{N}$ with the following property: There doesn’t exist an arithmetic progression with 2019 members, from which exactly $k$ are integers.

Given that $(1+\sin t)(1+\cos t)=5/4$ and \[ (1-\sin t)(1-\cos t)=\frac mn-\sqrt{k}, \] where $k, m,$ and $n$ are positive integers with $m$ and $n$ relatively prime, find $k+m+n.$

Solve: \[ \begin{cases}x_{2}x_{3}x_{4}\cdots x_{n}=a_{1}x_{1}\\ x_{1}x_{3}x_{4}\cdots x_{n}=a_{2}x_{2}\\x_{1}x_{2}x_{4}\cdots x_{n}=a_{3}x_{3}\\ \ldots\\x_{1}x_{2}x_{3}\cdots x_{n-1}=a_{n-1}x_{n-1} \end{cases} \]