Find all integes $a,b,c,d$ that form an arithmetic progression satisfying $d-c+1$ is prime number and $a+b^2+c^3=d^2b$

Determine whether there exist two infinite point sequences $ A_1,A_2,\ldots$ and $ B_1,B_2,\ldots$ in the plane, such that for all $i,j,k$ with $ 1\le i < j < k$, (i) $ B_k$ is on the line that passes through $ A_i$ and $ A_j$ if and only if $ k=i+j$. (ii) $ A_k$ is on the line that passes through $ B_i$ and $ B_j$ if and only if $ k=i+j$. [i](Proposed by Gerhard Woeginger, Austria)[/i]

The sequence $a_1,a_2, ..., a_{2n}$ of integers is such that each number occurs in no more than $n$ times. Prove that there are two strictly increasing sequences of indices $b_1,b_2, ..., b_{n}$ and $c_1,c_2, ..., c_{n}$ are such that every positive integer from the set $\{1,2,...,2n\}$ occurs exactly in one of these two sequences, and for each $1\le i \le n$ is true the condition $a_{b_i} \ne a_{c_i}$ . (Anton Trygub)

Suppose $(a_1,a_2,a_3,a_4)$ is a 4-term sequence of real numbers satisfying the following two conditions: [list] [*] $a_3=a_2+a_1$ and $a_4=a_3+a_2$; [*] there exist real numbers $a,b,c$ such that \[an^2+bn+c=\cos(a_n)\] for all $n\in\{1,2,3,4\}$. [/list] Compute the maximum possible value of \[\cos(a_1)-\cos(a_4)\] over all such sequences $(a_1,a_2,a_3,a_4)$.

There are $2022$ signs arranged in a straight line. Mark tasks Auto to color each sign with either red or blue with the following condition: for any given sequence of length $1011$ whose each term is either red or blue, Auto can always remove $1011$ signs from the line so that the remaining $1011$ signs match the given color sequence without changing the order. Determine the number of ways Auto can color the signs to satisfy Mark's condition.

Determine if there exists an infinite sequence of positive integers $a_1,a_2, a_3, ...$ such that (i) each positive integer occurs exactly once in the sequence, and (ii) each positive integer occurs exactly once in the sequence $ |a_1 - a_2|, |a_2 - a_3|, ..., |a+k - a_{k+1}|, ...$

Let $T$ be the triangle in the coordinate plane with vertices $\left(0,0\right)$, $\left(4,0\right)$, and $\left(0,3\right)$. Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\circ}$, $180^{\circ}$, and $270^{\circ}$ counterclockwise around the origin, reflection across the $x$-axis, and reflection across the $y$-axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by a reflection across the $y$-axis will return $T$ to its original position, but a $90^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by another reflection across the $x$-axis will not return $T$ to its original position.) $\textbf{(A) } 12\qquad\textbf{(B) } 15\qquad\textbf{(C) }17 \qquad\textbf{(D) }20 \qquad\textbf{(E) }25$

Find all triples $(a,b,c)$ satisfying the following conditions: (i) $a,b,c$ are prime numbers, where $a<b<c<100$. (ii) $a+1,b+1,c+1$ form a geometric sequence.

[i]20 problems for 25 minutes.[/i] [b]p1.[/b] What is $20 \div 2 - 0 \times 1 + 2 \times 5$? [b]p2.[/b] Today is Saturday, January $25$, $2020$. Exactly four hundred years from today, January $25$, $2420$, is again a Saturday. How many weekend days (Saturdays and Sundays) are in February, $2420$? (January has $31$ days and in year $2040$, February has $29$ days.) [b]p3.[/b] Given that there are four people sitting around a circular table, and two of them stand up, what is the probability that the two of them were originally sitting next to each other? [b]p4.[/b] What is the area of a triangle with side lengths $5$, $5$, and $6$? [b]p5.[/b] Six people go to OBA Noodles on Main Street. Each person has $1/2$ probability to order Duck Noodle Soup, $1/3$ probability to order OBA Ramen, and $1/6$ probability to order Kimchi Udon Soup. What is the probability that three people get Duck Noodle Soup, two people get OBA Ramen, and one person gets Kimchi Udon Soup? [b]p6.[/b] Among all positive integers $a$ and $b$ that satisfy $a^b = 64$, what is the minimum possible value of $a+b$? [b]p7.[/b] A positive integer $n$ is called trivial if its tens digit divides $n$. How many two-digit trivial numbers are there? [b]p8.[/b] Triangle $ABC$ has $AB = 5$, $BC = 13$, and $AC = 12$. Square $BCDE$ is constructed outside of the triangle. The perpendicular line from $A$ to side $DE$ cuts the square into two parts. What is the positive difference in their areas? [b]p9.[/b] In an increasing arithmetic sequence, the first, third, and ninth terms form an increasing geometric sequence (in that order). Given that the first term is $5$, find the sum of the first nine terms of the arithmetic sequence. [b]p10.[/b] Square $ABCD$ has side length $1$. Let points $C'$ and $D'$ be the reflections of points $C$ and $D$ over lines $AB$ and $BC$, respectively. Let P be the center of square $ABCD$. What is the area of the concave quadrilateral $PD'BC'$? [b]p11.[/b] How many four-digit palindromes are multiples of $7$? (A palindrome is a number which reads the same forwards and backwards.) [b]p12.[/b] Let $A$ and $B$ be positive integers such that the absolute value of the difference between the sum of the digits of $A$ and the sum of the digits of $(A + B)$ is $14$. What is the minimum possible value for $B$? [b]p13.[/b] Clark writes the following set of congruences: $x \equiv a$ (mod $6$), $x \equiv b$ (mod $10$), $x \equiv c$ (mod $15$), and he picks $a$, $b$, and $c$ to be three randomly chosen integers. What is the probability that a solution for $x$ exists? [b]p14.[/b] Vincent the bug is crawling on the real number line starting from $2020$. Each second, he may crawl from $x$ to $x - 1$, or teleport from $x$ to $\frac{x}{3}$ . What is the least number of seconds needed for Vincent to get to $0$? [b]p15.[/b] How many positive divisors of $2020$ do not also divide $1010$? [b]p16.[/b] A bishop is a piece in the game of chess that can move in any direction along a diagonal on which it stands. Two bishops attack each other if the two bishops lie on the same diagonal of a chessboard. Find the maximum number of bishops that can be placed on an $8\times 8$ chessboard such that no two bishops attack each other. [b]p17.[/b] Let $ABC$ be a right triangle with hypotenuse $20$ and perimeter $41$. What is the area of $ABC$? [b]p18.[/b] What is the remainder when $x^{19} + 2x^{18} + 3x^{17} +...+ 20$ is divided by $x^2 + 1$? [b]p19.[/b] Ben splits the integers from $1$ to $1000$ into $50$ groups of $20$ consecutive integers each, starting with $\{1, 2,...,20\}$. How many of these groups contain at least one perfect square? [b]p20.[/b] Trapezoid $ABCD$ with $AB$ parallel to $CD$ has $AB = 10$, $BC = 20$, $CD = 35$, and $AD = 15$. Let $AD$ and $BC$ intersect at $P$ and let $AC$ and $BD$ intersect at $Q$. Line $PQ$ intersects $AB$ at $R$. What is the length of $AR$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given scales and a set of $n$ different weights. We take weights in turn and add them on one of the scales sides. Let us denote "$L$" the scales state with the left side down, and "$R$" -- with the right side down. a) Prove that you can arrange the weights in such an order, that we shall obtain the sequence $LRLRLRLR...$ of the scales states. (That means that the state of the scales will be changed after putting every new weight.) b) Prove that for every $n$-letter word containing $R$'s and $L$'s only you can arrange the weights in such an order, that the sequence of the scales states will be described by that word.

An infinite increasing sequence of positive integers $n_j (j = 1, 2, \ldots )$ has the property that for a certain $c$, \[\frac{1}{N}\sum_{n_j\le N} n_j \le c,\] for every $N >0$. Prove that there exist finitely many sequences $m^{(i)}_j (i = 1, 2,\ldots, k)$ such that \[\{n_1, n_2, \ldots \} =\bigcup_{i=1}^k\{m^{(i)}_1 ,m^{(i)}_2 ,\ldots\}\] and \[m^{(i)}_{j+1} > 2m^{(i)}_j (1 \le i \le k, j = 1, 2,\ldots).\]

Consider the sequence in which $a_1 = 1$ and $a_n$ is obtained by juxtaposing the decimal representation of $n$ at the end of the decimal representation of $a_{n-1}$. That is, $a_1 = 1$, $a_2 = 12$, $a_3 = 123$, $\dots$ , $a_9 = 123456789$, $a_{10} = 12345678910$ and so on. Prove that infinitely many numbers of this sequence are multiples of $7$.

Suppose that necklace $\, A \,$ has 14 beads and necklace $\, B \,$ has 19. Prove that for any odd integer $n \geq 1$, there is a way to number each of the 33 beads with an integer from the sequence \[ \{ n, n+1, n+2, \dots, n+32 \} \] so that each integer is used once, and adjacent beads correspond to relatively prime integers. (Here a ``necklace'' is viewed as a circle in which each bead is adjacent to two other beads.)

Do there exist two bounded sequences $a_1, a_2,\ldots$ and $b_1, b_2,\ldots$ such that for each positive integers $n$ and $m>n$ at least one of the two inequalities $|a_m-a_n|>1/\sqrt{n},$ and $|b_m-b_n|>1/\sqrt{n}$ holds?

Let $ a$ be a positive integer. Consider the sequence $ (a_n)$ defined as $ a_0\equal{}a$ and $ a_n\equal{}a_{n\minus{}1}\plus{}40^{n!}$ for $ n > 0$. Prove that the sequence $ (a_n)$ has infinitely many numbers divisible by $ 2009$.

For every sequence $p_1<p_2<\cdots<p_8$ of eight prime numbers, determine the largest integer $N$ for which the following equation has no solution in positive integers $x_1,\ldots,x_8$: $$p_1\, p_2\, \cdots\, p_8 \left( \frac{x_1}{p_1}+ \frac{x_2}{p_2}+ ~\cdots~ +\frac{x_8}{p_8} \right) ~~=~~ N $$ [i]Proposed by Gerhard Woeginger, Austria[/i]