Let $a,b,c$ be real numbers such that $ab\not= 0$ and $c>0$. Let $(a_{n})_{n\geq 1}$ be the sequence of real numbers defined by: $a_{1}=a, a_{2}=b$ and \[a_{n+1}=\frac{a_{n}^{2}+c}{a_{n-1}}\] for all $n\geq 2$. Show that all the terms of the sequence are integer numbers if and only if the numbers $a,b$ and $\frac{a^{2}+b^{2}+c}{ab}$ are integers.

[b]p1.[/b] The remainder of a number when divided by $7$ is $5$. If I multiply the number by $32$ and add $18$ to the product, what is the new remainder when divided by $7$? [b]p2.[/b] If a fair coin is flipped $15$ times, what is the probability that there are more heads than tails? [b]p3.[/b] Let $-\frac{\sqrt{p}}{q}$ be the smallest nonzero real number such that the reciprocal of the number is equal to the number minus the square root of the square of the number, where $p$ and $q$ are positive integers and $p$ is not divisible the square of any prime. Find $p + q$. [b]p4.[/b] Rachel likes to put fertilizers on her grass to help her grass grow. However, she has cows there as well, and they eat $3$ little fertilizer balls on average. If each ball is spherical with a radius of $4$, then the total volume that each cow consumes can be expressed in the form $a\pi$ where $a$ is an integer. What is $a$? [b]p5.[/b] One day, all $30$ students in Precalc class are bored, so they decide to play a game. Everyone enters into their calculators the expression $9 \diamondsuit 9 \diamondsuit 9 ... \diamondsuit 9$, where $9$ appears $2020$ times, and each $\diamondsuit$ is either a multiplication or division sign. Each student chooses the signs randomly, but they each choose one more multiplication sign than division sign. Then all $30$ students calculate their expression and take the class average. Find the expected value of the class average. [b]p6.[/b] NaNoWriMo, or National Novel Writing Month, is an event in November during which aspiring writers attempt to produce novel-length work - formally defined as $50,000$ words or more - within the span of $30$ days. Justin wants to participate in NaNoWriMo, but he's a busy high school student: after accounting for school, meals, showering, and other necessities, Justin only has six hours to do his homework and perhaps participate in NaNoWriMo on weekdays. On weekends, he has twelve hours on Saturday and only nine hours on Sunday, because he goes to church. Suppose Justin spends two hours on homework every single day, including the weekends. On Wednesdays, he has science team, which takes up another hour and a half of his time. On Fridays, he spends three hours in orchestra rehearsal. Assume that he spends all other time on writing. Then, if November $1$st is a Friday, let $w$ be the minimum number of words per minute that Justin must type to finish the novel. Round $w$ to the nearest whole number. [b]p7.[/b] Let positive reals $a$, $b$, $c$ be the side lengths of a triangle with area $2030$. Given $ab + bc + ca = 15000$ and $abc = 350000$, find the sum of the lengths of the altitudes of the triangle. [b]p8.[/b] Find the minimum possible area of a rectangle with integer sides such that a triangle with side lengths $3$, $4$, $5$, a triangle with side lengths $4$, $5$, $6$, and a triangle with side lengths $\frac94$, $4$, $4$ all fit inside the rectangle without overlapping. [b]p9.[/b] The base $16$ number $10111213...99_{16}$, which is a concatenation of all of the (base $10$) $2$-digit numbers, is written on the board. Then, the last $2n$ digits are erased such that the base $10$ value of remaining number is divisible by $51$. Find the smallest possible integer value of $n$. [b]p10.[/b] Consider sequences that consist entirely of $X$'s, $Y$ 's and $Z$'s where runs of consecutive $X$'s, $Y$ 's, and $Z$'s are at most length $3$. How many sequences with these properties of length $8$ are there? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a_0, a_1, a_2, \ldots$ be an infinite sequence where each term is independently and uniformly at random in the set $\{1, 2, 3, 4\}.$ Define an infinite sequence $b_0, b_1, b_2, \ldots$ recursively by $b_0=1$ and $b_{i+1}=a_i^{b_i}.$ Compute the expected value of the smallest positive integer $k$ such that $b_k \equiv 1 \pmod{5}.$

Consider all finite sequences of positive real numbers each of whose terms is at most $3$ and the sum of whose terms is more than $100$. For each such sequence, let $S$ denote the sum of the subsequence whose sum is the closest to $100$, and define the [i]defect[/i] of this sequence to be the value $|S-100|$. Find the maximum possible value of the defect.

Let $ \lfloor x \rfloor$ denote the greatest integer less than or equal to $ x.$ Pick any $ x_1$ in $ [0, 1)$ and define the sequence $ x_1, x_2, x_3, \ldots$ by $ x_{n\plus{}1} \equal{} 0$ if $ x_n \equal{} 0$ and $ x_{n\plus{}1} \equal{} \frac{1}{x_n} \minus{} \left \lfloor \frac{1}{x_n} \right \rfloor$ otherwise. Prove that \[ x_1 \plus{} x_2 \plus{} \ldots \plus{} x_n < \frac{F_1}{F_2} \plus{} \frac{F_2}{F_3} \plus{} \ldots \plus{} \frac{F_n}{F_{n\plus{}1}},\] where $ F_1 \equal{} F_2 \equal{} 1$ and $ F_{n\plus{}2} \equal{} F_{n\plus{}1} \plus{} F_n$ for $ n \geq 1.$

For a positive integer $a$, let $S_{a}$ be the set of primes $p$ for which there exists an odd integer $b$ such that $p$ divides $(2^{2^{a}})^{b}-1.$ Prove that for every $a$ there exist infinitely many primes that are not contained in $S_{a}$.

Fix a sequence $a_1,a_2,a_3\ldots$ of integers satisfying the following condition:for all prime numbers $p$ and all positive integers $k$,we have $a_{pk+1}=pa_k-3a_p+13$.Determine all possible values of $a_{2013}$.

An ancient noble family has $n$ members, each holding a different number of posts . As every year in December, they gather at a very specific place for a Council of War to be held, where also k, from the point of view of the high nobility, unimportant spammers speak up, which, due to their irrelevance, should and cannot be further differentiated. The Council is held as follows: those present speak one after the other, each one carefully put forward his request once. In addition, for reasons of respect, a nobleman never speaks right after a nobleman who holds more posts, while the common people disregarde such rules. Find the number of possible sequences of the Council of war.

Let the sequence an be defined by $a_0 = 2, a_1 = 15$, and $a_{n+2 }= 15a_{n+1} + 16a_n$ for $n \ge 0$. Show that there are infinitely many integers $k$ such that $269 | a_k$.

Call a super-integer an infinite sequence of decimal digits: $\ldots d_n \ldots d_2d_1$. (Formally speaking, it is the sequence $(d_1,d_2d_1,d_3d_2d_1,\ldots)$ ) Given two such super-integers $\ldots c_n \ldots c_2c_1$ and $\ldots d_n \ldots d_2d_1$, their product $\ldots p_n \ldots p_2p_1$ is formed by taking $p_n \ldots p_2p_1$ to be the last n digits of the product $c_n \ldots c_2c_1$ and $d_n \ldots d_2d_1$. Can we find two non-zero super-integers with zero product? (a zero super-integer has all its digits zero)

For distinct real numbers $a_1,a_2,...,a_n$, we calculate the $\frac{n(n-1)}{2}$ sums $a_i +a_j$ with $1 \le i < j \le n$, and sort them in ascending order. Find all integers $n \ge 3$ for which there exist $a_1,a_2,...,a_n$, for which this sequence of $\frac{n(n-1)}{2}$ sums form an arithmetic progression (i.e. the dierence between consecutive terms is constant).

Let $a_n$ be a sequence of natural numbers defined by $a_1 = m$ and for $n > 1$. We call apair$ (a_k, a_{\ell })$ [i]interesting [/i] if (i) $0 < \ell - k < 2016$, (ii) $a_k$ divides $a_{\ell }$. Show that there exists a $m$ such that the sequence $a_n$ contains no interesting pair.

For integers $m\geq 3$, $n$ and $x_1,x_2, \ldots , x_m$ if $x_{i+1}-x_i \equiv x_i-x_{i-1} (mod n) $ for every $2\leq i \leq m-1$, we say that the $m$-tuple $(x_1,x_2,\ldots , x_m)$ is an arithmetic sequence in $(mod n)$. Let $p\geq 5$ be a prime number and $1<a<p-1$ be an integer. Let ${a_1,a_2,\ldots , a_k}$ be the set of all possible remainders when positive powers of $a$ are divided by $p$. Show that if a permutation of ${a_1,a_2,\ldots , a_k}$ is an arithmetic sequence in $(mod p)$, then $k=p-1$.

Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.

How many $x$ are there such that $x,[x],\{x\}$ are in harmonic progression (i.e, the reciprocals are in arithmetic progression)? (Here $[x]$ is the largest integer less than equal to $x$ and $\{x\}=x-[ x]$ ) [list=1] [*] 0 [*] 1 [*] 2 [*] 3 [/list]