A sequence of positive integers $g_1$, $g_2$, $g_3$, $. . . $ is defined as follows: $g_1 = 1$ and for every positive integer $n$, $$g_{n + 1} = g^2_n + g_n + 1.$$ Show that $g^2_{n} + 1$ divides $g^2_{n + 1}+1$ for every positive integer $n$.

Let $ a_n$ be the last nonzero digit in the decimal representation of the number $ n!.$ Does the sequence $ a_1, a_2, \ldots, a_n, \ldots$ become periodic after a finite number of terms?

Hamilton Avenue has eight houses. On one side of the street are the houses numbered 1,3,5,7 and directly opposite are houses 2,4,6,8 respectively. An eccentric postman starts deliveries at house 1 and delivers letters to each of the houses, finally returning to house 1 for a cup of tea. Throughout the entire journey he must observe the following rules. The numbers of the houses delivered to must follow an odd-even-odd-even pattern throughout, each house except house 1 is visited exactly once (house 1 is visited twice) and the postman at no time is allowed to cross the road to the house directly opposite. How many different delivery sequences are possible?

An infinite (in both directions) sequence of rooms is situated on one side of an infinite hallway. The rooms are numbered by consecutive integers and each contains a grand piano. A finite number of pianists live in these rooms. (There may be more than one of them in some of the rooms.) Every day some two pianists living in adjacent rooms (the Arth and ($k +1$)st) decide that they interfere with each other’s practice, and they move to the ($k - 1$)st and ($k + 2$)nd rooms, respectively. Prove that these moves will cease after a finite number of days. (VG Ilichev)

Let $ a_1, a_2, ..., a_k $ be distinct positive integers such that the $2^k$ sums $\displaystyle\sum\limits_{i=1}^{k}{\epsilon_i a_i}$, $\epsilon_i\in\left\{0,1\right\}$ are distinct. a) Show that $ \dfrac{1}{a_1}+\dfrac{1}{a_2}+...+\dfrac{1}{a_k}\le2(1-2^{-k}) $; b) Find the sequences $(a_1,a_2,...,a_k)$ for which the equality holds. [i]Șerban Buzețeanu[/i]

The sequence $ \{a_n\}$ of integers is defined by \[ a_1 \equal{} 2, a_2 \equal{} 7 \] and \[ \minus{} \frac {1}{2} < a_{n \plus{} 1} \minus{} \frac {a^2_n}{a_{n \minus{} 1}} \leq \frac {}{}, n \geq 2. \] Prove that $ a_n$ is odd for all $ n > 1.$

For a positive integer $n$, an [i]$n$-sequence[/i] is a sequence $(a_0,\ldots,a_n)$ of non-negative integers satisfying the following condition: if $i$ and $j$ are non-negative integers with $i+j \leqslant n$, then $a_i+a_j \leqslant n$ and $a_{a_i+a_j}=a_{i+j}$. Let $f(n)$ be the number of $n$-sequences. Prove that there exist positive real numbers $c_1$, $c_2$, and $\lambda$ such that \[c_1\lambda^n<f(n)<c_2\lambda^n\] for all positive integers $n$.

The sequence of positive integers $a_1, a_2, a_3, ...$ satisfies $a_{n+1} = a^2_{n} + 2018$ for $n \ge 1$. Prove that there exists at most one $n$ for which $a_n$ is the cube of an integer.

A sequence of integers $a_0,\ a_1,\dots a_n \dots $ is defined by the following rules: $a_0=0,\ a_1=1,\ a_{n+1} > a_n$ for each $n\in \mathbb{N}$, and $a_{n+1}$ is the minimum number such that no three numbers among $a_0,\ a_1,\dots a_{n+1}$ form an arithmetical progression. Prove that $a_{2^n}=3^n$ for each $n \in \mathbb{N}.$

[b][b]p1.[/b][/b] Find the perimeter of a regular hexagon with apothem $3$. [b]p2.[/b] Concentric circles of radius $1$ and r are drawn on a circular dartboard of radius $5$. The probability that a randomly thrown dart lands between the two circles is $0.12$. Find $r$. [b]p3.[/b] Find all ordered pairs of integers $(x, y)$ with $0 \le x \le 100$, $0 \le y \le 100$ satisfying $$xy = (x - 22) (y + 15) .$$ [b]p4.[/b] Points $A_1$,$A_2$,$...$,$A_{12}$ are evenly spaced around a circle of radius $1$, but not necessarily in order. Given that chords $A_1A_2$, $A_3A_4$, and $A_5A_6$ have length $2$ and chords $A_7A_8$ and $A_9A_{10}$ have length $2 sin (\pi / 12)$, find all possible lengths for chord $A_{11}A_{12}$. [b]p5.[/b] Let $a$ be the number of digits of $2^{1998}$, and let $b$ be the number of digits in $5^{1998}$. Find $a + b$. [b]p6.[/b] Find the volume of the solid in $R^3$ defined by the equations $$x^2 + y^2 \le 2$$ $$x + y + |z| \le 3.$$ [b]p7.[/b] Positive integer $n$ is such that $3n$ has $28$ positive divisors and $4n$ has $36$ positive divisors. Find the number of positive divisors of $n$. [b]p8.[/b] Define functions $f$ and $g$ by $f (x) = x +\sqrt{x}$ and $g (x) = x + 1/4$. Compute $$g(f(g(f(g(f(g(f(3)))))))).$$ (Your answer must be in the form $a + b \sqrt{ c}$ where $a$, $b$, and $c$ are rational.) [b]p9.[/b] Sequence $(a_1, a_2,...)$ is defined recursively by $a_1 = 0$, $a_2 = 100$, and $a_n = 2a_{n-1}-a_{n-2}-3$. Find the greatest term in the sequence $(a_1, a_2,...)$. [b]p10.[/b] Points $X = (3/5, 0)$ and $Y = (0, 4/5)$ are located on a Cartesian coordinate system. Consider all line segments which (like $\overline{XY}$ ) are of length 1 and have one endpoint on each axis. Find the coordinates of the unique point $P$ on $\overline{XY}$ such that none of these line segments (except $\overline{XY}$ itself) pass through $P$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The roots of the equation $x^5-180x^4+Ax^3+Bx^2+Cx+D=0$ are in geometric progression. The sum of their reciprocals is $20$. Compute $|D|$.

Let $(a_n)_{n = 0}^{\infty} $ be a sequence of positive integers such that for every $n \geq 0$ it is true that $$a_{n+2} = a_0 a_1 + a_1 a_2 + ... + a_n a_{n+1} - 1 $$ a) Prove that there exist a prime number which divides infinitely many $a_n$ b) Prove that there exist infinitely many such prime numbers

A group of nine math team members like to play Survev.io. They noticed that the number of hours each of them played this week forms an arithmetic progression. The person who played the least played for $1$ hour, while the most played for $9.$ Find the total number of hours all nine group members spent playing Survev.io this week.

What is the difference between the sum of the first $ 2003$ even counting numbers and the sum of the first $ 2003$ odd counting numbers? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 2003 \qquad \textbf{(E)}\ 4006$

Let $a, b$ be two co-prime positive integers. A number is called [i]good [/i] if it can be written in the form $ax + by$ for non-negative integers $x, y$. Define the function $f : Z\to Z $as $f(n) = n - n_a - n_b$, where $s_t$ represents the remainder of $s$ upon division by $t$. Show that an integer $n$ is [i]good [/i]if and only if the infinite sequence $n, f(n), f(f(n)), ...$ contains only non-negative integers.

For a sequence of zeros and ones Vasya makes move of the following form until the process doesn't halt 1. If the first digit of the sequence is zero, this digit is erased. 2. If the first digit is one and there are at least two digits, Vasya swaps first two digits, reverses the sequence and replaces ones with zeros and zeros with ones. 3. If the sequence is empty or consists of a single one, the process stops. Find the number of sequences of length 2025 starting from which Vasya can get to the empty sequence. [i]M. Zorka[/i]