All members of geometrical progression $(b_n)_{n\geq1}$ are members of some arithmetical progression. It is known that $b_1$ is an integer. Prove that all members of this geometrical progression are integers. (progression is infinite)

Let $f(x) = \frac{1}{1-\frac{3x}{16}}$. Consider the sequence $\{ 0, f(0), f(f(0)), f^3(0), \dots \}$ Find the smallest $L$ such that $f^n(0) \leq L$ for all $n$. If the sequence is unbounded, write none as your answer.

How many four-digit integers $abcd$, with $a \neq 0$, have the property that the three two-digit integers $ab<bc<cd$ form an increasing arithmetic sequence? One such number is $4692$, where $a=4$, $b=6$, $c=9$, and $d=2$. $\textbf{(A)}\ 9\qquad\textbf{(B)}\ 15\qquad\textbf{(C)}\ 16\qquad\textbf{(D)}\ 17\qquad\textbf{(E)}\ 20$

Points $B$,$D$ , and $J$ are midpoints of the sides of right triangle $ACG$ . Points $K$, $E$, $I$ are midpoints of the sides of triangle , etc. If the dividing and shading process is done 100 times (the first three are shown) and $ AC=CG=6 $, then the total area of the shaded triangles is nearest [asy] draw((0,0)--(6,0)--(6,6)--cycle); draw((3,0)--(3,3)--(6,3)); draw((4.5,3)--(4.5,4.5)--(6,4.5)); draw((5.25,4.5)--(5.25,5.25)--(6,5.25)); fill((3,0)--(6,0)--(6,3)--cycle,black); fill((4.5,3)--(6,3)--(6,4.5)--cycle,black); fill((5.25,4.5)--(6,4.5)--(6,5.25)--cycle,black); label("$A$",(0,0),SW); label("$B$",(3,0),S); label("$C$",(6,0),SE); label("$D$",(6,3),E); label("$E$",(6,4.5),E); label("$F$",(6,5.25),E); label("$G$",(6,6),NE); label("$H$",(5.25,5.25),NW); label("$I$",(4.5,4.5),NW); label("$J$",(3,3),NW); label("$K$",(4.5,3),S); label("$L$",(5.25,4.5),S);[/asy] $ \text{(A)}\ 6\qquad\text{(B)}\ 7\qquad\text{(C)}\ 8\qquad\text{(D)}\ 9\qquad\text{(E)}\ 10 $

Given [i]Fibonacci[/i] sequence $(F_n),$ and a positive integer $m$, denote $k(m)$ by the smallest positive integer satisfying $F_{n+k(m)}\equiv F_n(\bmod m),$ for all natural numbers $n$, $p$ is an odd prime such that $p \equiv \pm 1(\bmod 5)$. Prove that: a) ${F_{p + 1}} \equiv 0(\bmod p).$ b) $k(p)|2p+2.$ c) $k(p)$ is divisible by $4.$

9. A sequence of nonzero complex numbers $a_1, a_2, \dots, a_{2020}$ satisfies $a_3=a_2^2+2a_1a_2$ and $$\frac{a_{n+2}}{a_{n+1}}-\frac{a_{n+1}}{a_{n}}=a_n+a_{n+1},$$ for all $2018\ge n\ge 2$. Given $a_2-a_{2020}=2025$, how many integers $0\le a_1\le 2020$ are there, such that $a_1+a_2+\cdots+a_{2019}$ is a real number? [i]Proposed by winnertakeover[/i]

Let $c_n$ be a sequence which is defined recursively as follows: $c_0 = 1$, $c_{2n+1} = c_n$ for $n \geq 0$, and $c_{2n} = c_n + c_{n-2^e}$ for $n > 0$ where $e$ is the maximal nonnegative integer such that $2^e$ divides $n$. Prove that \[\sum_{i=0}^{2^n-1} c_i = \frac{1}{n+2} {2n+2 \choose n+1}.\]

Decide if the following statement is true or false: For every sequence $\{x_n\}_{n\in \mathbb{N}}$ of non-negative real numbers, there exist sequences $\{a_n\}_{n\in\mathbb{N}}$ and $\{b_n\}_{n\in\mathbb{N}}$ of non-negative real numbers such that: (a) $x_n = a_n + b_n$ for all $n$; (b) $a_1 + \cdots + a_n \le n$ for infinitely many values of $n$; (c) $b_1 + \cdots + b_n \le n$ for infinitely many values of $n$.

Let $x$ be the first term in the sequence $31, 331, 3331, . . .$ which is divisible by $17$. How many digits long is$ x$?

$a_n,b_n,c_n$ are three sequences of positive integers satisfying $$\prod_{d|n}a_d=2^n-1,\prod_{d|n}b_d=\frac{3^n-1}{2},\prod_{d|n}c_d=\gcd(2^n-1,\frac{3^n-1}{2})$$ for all $n\in \mathbb{N}$. Prove that $\gcd(a_n,b_n)|c_n$ for all $n\in \mathbb{N}$

Let $\{u_{n}\}_{n \ge 0}$ be a sequence of integers satisfying the recurrence relation $u_{n+2}=u_{n+1}^2 -u_{n}$ $(n \in \mathbb{N})$. Suppose that $u_{0}=39$ and $u_{1}=45$. Prove that $1986$ divides infinitely many terms of this sequence.

The sequence $a_1, a_2, a_3,...$ is defined by $$a_1 = 1\,\,\,, \,\,\,a_{n+1} =\frac{1}{16}(1 + 4a_n +\sqrt{1 + 24a_n}) \,\,\,(n \in N^* ).$$ Determine and prove a formula with which for every natural number $n$ the term $a_n$ can be computed directly without having to determine preceding terms of the sequence.

Given two integers $m\geq 2$ and $n\geq 2$ we consider two types of sequences of length $m\cdot n$ formed exclusively by $0$ and $1$ TYPE 1 sequences are all those that verify the following two conditions: $\bullet$ $a_ka_{k+m} = 0$ for all $k = 1, 2, 3, ...$ $\bullet$ If $a_ka_{k+1} = 1$, then $k$ is a multiple of $m$. TYPE 2 sequences are all those that verify the following two conditions: $\bullet$ $a_ka_{k+n} = 0$ for all $k = 1, 2, 3, ...$ $\bullet$ If $a_ka_{k+1} = 1$, then $k$ is a multiple of $n$. Prove that the number of sequences of type 1 is equal to the number of sequences of type 2.

A sequence $a_0,a_1,a_2,...,a_n,...$ is such that $a_0=1$ and, for each $n\ge 0$ , $a_{n+1}=m \cdot a_n$ , where $m$ is an integer between $2$ and $9$ inclusive. Also, every integer between $2$ and $9$ has even been used at least once to get $a_{n+1} $ from $a_n$ . Let $Sn$ the sum of the digits of $a_n$ , $n=0,1,2,...$ . Prove that $S_n \ge S_{n+1}$ for infinite values ​​of $n$.

[b]p1.[/b] Given that $7 \times 22 \times 13 = 2002$, compute $14 \times 11 \times 39$. [b]p2.[/b] Ariel the frog is on the top left square of a $8 \times 10$ grid of squares. Ariel can jump from any square on the grid to any adjacent square, including diagonally adjacent squares. What is the minimum number of jumps required so that Ariel reaches the bottom right corner? [b]p3.[/b] The distance between two floors in a building is the vertical distance from the bottom of one floor to the bottom of the other. In Evans hall, the distance from floor $7$ to floor $5$ is $30$ meters. There are $12$ floors on Evans hall and the distance between any two consecutive floors is the same. What is the distance, in meters, from the first floor of Evans hall to the $12$th floor of Evans hall? [b]p4.[/b] A circle of nonzero radius $ r$ has a circumference numerically equal to $\frac13$ of its area. What is its area? [b]p5.[/b] As an afternoon activity, Emilia will either play exactly two of four games (TwoWeeks, DigBuild, BelowSaga, and FlameSymbol) or work on homework for exactly one of three classes (CS61A, Math 1B, Anthro 3AC). How many choices of afternoon activities does Emilia have? [b]p6.[/b] Matthew wants to buy merchandise of his favorite show, Fortune Concave Decagon. He wants to buy figurines of the characters in the show, but he only has $30$ dollars to spend. If he can buy $2$ figurines for $4$ dollars and $5$ figurines for $8$ dollars, what is the maximum number of figurines that Matthew can buy? [b]p7.[/b] When Dylan is one mile from his house, a robber steals his wallet and starts to ride his motorcycle in the direction opposite from Dylan’s house at $40$ miles per hour. Dylan dashes home at $10$ miles per hour and, upon reaching his house, begins driving his car at $60$ miles per hour in the direction of the robber’s motorcycle. How long, starting from when the robber steals the wallet, does it take for Dylan to catch the robber? Express your answer in minutes. [b]p8.[/b] Deepak the Dog is tied with a leash of $7$ meters to a corner of his $4$ meter by $6$ meter rectangular shed such that Deepak is outside the shed. Deepak cannot go inside the shed, and the leash cannot go through the shed. Compute the area of the region that Deepak can travel to. [img]https://cdn.artofproblemsolving.com/attachments/f/8/1b9563776325e4e200c3a6d31886f4020b63fa.png[/img] [b]p9.[/b] The quadratic equation $a^2x^2 + 2ax -3 = 0$ has two solutions for x that differ by $a$, where $a > 0$. What is the value of $a$? [b]p10.[/b] Find the number of ways to color a $2 \times 2$ grid of squares with $4$ colors such that no two (nondiagonally) adjacent squares have the same color. Each square should be colored entirely with one color. Colorings that are rotations or reflections of each other should be considered different. [b]p11[/b]. Given that $\frac{1}{y^2+5} - \frac{3}{y^4-39} = 0$, and $y \ge 0$, compute $y$. [b]p12.[/b] Right triangle $ABC$ has $AB = 5$, $BC = 12$, and $CA = 13$. Point $D$ lies on the angle bisector of $\angle BAC$ such that $CD$ is parallel to $AB$. Compute the length of $BD$. [img]https://cdn.artofproblemsolving.com/attachments/c/3/d5cddb0e8ac43c35ddfc94b2a74b8d022292f2.png[/img] [b]p13.[/b] Let $x$ and $y$ be real numbers such that $xy = 4$ and $x^2y + xy^2 = 25$. Find the value of $x^3y +x^2y^2 + xy^3$. [b]p14.[/b] Shivani is planning a road trip in a car with special new tires made of solid rubber. Her tires are cylinders that are $6$ inches in width and have diameter $26$ inches, but need to be replaced when the diameter is less than $22$ inches. The tire manufacturer says that $0.12\pi$ cubic inches will wear away with every single rotation. Assuming that the tire manufacturer is correct about the wear rate of their tires, and that the tire maintains its cylindrical shape and width (losing volume by reducing radius), how many revolutions can each tire make before she needs to replace it? [b]p15.[/b] What’s the maximum number of circles of radius $4$ that fit into a $24 \times 15$ rectangle without overlap? [b]p16.[/b] Let $a_i$ for $1 \le i \le 10$ be a finite sequence of $10$ integers such that for all odd $i$, $a_i = 1$ or $-1$, and for all even $i$, $a_i = 1$, $-1$, or $0$. How many sequences a_i exist such that $a_1+a_2+a_3+...+a_{10} = 0$? [b]p17.[/b] Let $\vartriangle ABC$ be a right triangle with $\angle B = 90^o$ such that $AB$ and $BC$ have integer side lengths. Squares $ABDE$ and $BCFG$ lie outside $\vartriangle ABC$. If the area of $\vartriangle ABC$ is $12$, and the area of quadrilateral $DEFG$ is $38$, compute the perimeter of $\vartriangle ABC$. [img]https://cdn.artofproblemsolving.com/attachments/b/6/980d3ba7d0b43507856e581476e8ad91886656.png[/img] [b]p18.[/b] What is the smallest positive integer $x$ such that there exists an integer $y$ with $\sqrt{x} +\sqrt{y} = \sqrt{1025}$ ? [b]p19. [/b]Let $a =\underbrace{19191919...1919}_{19\,\, is\,\,repeated\,\, 3838\,\, times}$. What is the remainder when $a$ is divided by $13$? [b]p20.[/b] James is watching a movie at the cinema. The screen is on a wall and is $5$ meters tall with the bottom edge of the screen $1.5$ meters above the floor. The floor is sloped downwards at $15$ degrees towards the screen. James wants to find a seat which maximizes his vertical viewing angle (depicted below as $\theta$ in a two dimensional cross section), which is the angle subtended by the top and bottom edges of the screen. How far back from the screen in meters (measured along the floor) should he sit in order to maximize his vertical viewing angle? [img]https://cdn.artofproblemsolving.com/attachments/1/5/1555fb2432ee4fe4903accc3b74ea7215bc007.png[/img] PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The sequence $a_1,a_2,\dots$ of integers satisfies the conditions: (i) $1\le a_j\le2015$ for all $j\ge1$, (ii) $k+a_k\neq \ell+a_\ell$ for all $1\le k<\ell$. Prove that there exist two positive integers $b$ and $N$ for which\[\left\vert\sum_{j=m+1}^n(a_j-b)\right\vert\le1007^2\]for all integers $m$ and $n$ such that $n>m\ge N$. [i]Proposed by Ivan Guo and Ross Atkins, Australia[/i]