Find the largest natural number $ k $ which has the property that there is a partition of the natural numbers $ \bigcup_{1\le j\le k} V_j, $ an index $ i\in\{ 1,\ldots ,k \} $ and three natural numbers $ a,b,c\in V_i, $ satisfying $ a+2b=4c. $

Find, and write out explicitly, a permutation $\{p(1),p(2),\ldots,p(20)\}$ of $\{1,2,\ldots,20\}$ such that $k+p(k)$ is a power of $2$ for $k=1,2,\ldots,20$, and prove that only one such permutation exists.

Determine all pairs $(n,m)$ of positive integers for which there exists an infinite sequence $\{x_k\}$ of $0$'s and $1$'s with the properties that if $x_i=0$ then $x_{i+m}=1$ and if $x_i = 1$ then $x_{i+n} = 0.$

Show that there are infinitely many noncongruent triangles which satisfy the following conditions: i) the side lengths are relatively prime integers; ii)the area is an integer number; iii)the altitudes' lengths are not integer numbers.

Show that $1 \le n^{1/n} \le 2$ for all positive integers $n$. Find the smallest $k$ such that $1 \le n ^{1/n} \le k$ for all positive integers $n$.

Find all ordered triplets of positive integers $(a,\ b,\ c)$ such that $2^a+3^b+1=6^c$.

[b]p1.[/b] Let $X = 2022 + 022 + 22 + 2$. When $X$ is divided by $22$, there is a remainder of $R$. What is the value of $R$? [b]p2.[/b] When Amy makes paper airplanes, her airplanes fly $75\%$ of the time. If her airplane flies, there is a $\frac56$ chance that it won’t fly straight. Given that she makes $80$ airplanes, what is the expected number airplanes that will fly straight? [b]p3.[/b] It takes Joshua working alone $24$ minutes to build a birdhouse, and his son working alone takes $16$ minutes to build one. The effective rate at which they work together is the sum of their individual working rates. How long in seconds will it take them to make one birdhouse together? [b]p4.[/b] If Katherine’s school is located exactly $5$ miles southwest of her house, and her soccer tournament is located exactly $12$ miles northwest of her house, how long, in hours, will it take Katherine to bike to her tournament right after school given she bikes at $0.5$ miles per hour? Assume she takes the shortest path possible. [b]p5.[/b] What is the largest possible integer value of $n$ such that $\frac{4n+2022}{n+1}$ is an integer? [b]p6.[/b] A caterpillar wants to go from the park situated at $(8, 5)$ back home, located at $(4, 10)$. He wants to avoid routes through $(6, 7)$ and $(7, 10)$. How many possible routes are there if the caterpillar can move in the north and west directions, one unit at a time? [b]p7.[/b] Let $\vartriangle ABC$ be a triangle with $AB = 2\sqrt{13}$, $BC = 6\sqrt2$. Construct square $BCDE$ such that $\vartriangle ABC$ is not contained in square $BCDE$. Given that $ACDB$ is a trapezoid with parallel bases $\overline{AC}$, $\overline{BD}$, find $AC$. [b]p8.[/b] How many integers $a$ with $1 \le a \le 1000$ satisfy $2^a \equiv 1$ (mod $25$) and $3^a \equiv 1$ (mod $29$)? [b]p9.[/b] Let $\vartriangle ABC$ be a right triangle with right angle at $B$ and $AB < BC$. Construct rectangle $ADEC$ such that $\overline{AC}$,$\overline{DE}$ are opposite sides of the rectangle, and $B$ lies on $\overline{DE}$. Let $\overline{DC}$ intersect $\overline{AB}$ at $M$ and let $\overline{AE}$ intersect $\overline{BC}$ at $N$. Given $CN = 6$, $BN = 4$, find the $m+n$ if $MN^2$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$. [b]p10.[/b] An elimination-style rock-paper-scissors tournament occurs with $16$ players. The $16$ players are all ranked from $1$ to $16$ based on their rock-paper-scissor abilities where $1$ is the best and $16$ is the worst. When a higher ranked player and a lower ranked player play a round, the higher ranked player always beats the lower ranked player and moves on to the next round of the tournament. If the initial order of players are arranged randomly, and the expected value of the rank of the $2$nd place player of the tournament can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$ what is the value of $m+n$? [b]p11.[/b] Estimation (Tiebreaker) Estimate the number of twin primes (pairs of primes that differ by $2$) where both primes in the pair are less than $220022$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider the sequences $(a_n), (b_n)$ defined by \[a_1=3, \quad b_1=100 , \quad a_{n+1}=3^{a_n} , \quad b_{n+1}=100^{b_n} \] Find the smallest integer $m$ for which $b_m > a_{100}.$

The summation $\sum_{k=1}^{360} \frac{1}{k \sqrt{k+1} + (k+1)\sqrt{k}}$ is the ratio of two relatively prime positive integers $m$ and $n$. Find $m + n$.

The number obtained from the last two nonzero digits of $ 90!$ is equal to $ n$. What is $ n$? $ \textbf{(A)}\ 12 \qquad \textbf{(B)}\ 32 \qquad \textbf{(C)}\ 48 \qquad \textbf{(D)}\ 52 \qquad \textbf{(E)}\ 68$

For a positive integer $k$, let $p(k)$ be the smallest prime that does not divide $k$. Given a positive integer $a$, define the infinite sequence $a_0, a_1, \ldots$ by $a_0 = a$ and, for $n > 0$, $a_n$ is the smallest positive integer with the following properties: • $a_n$ has not yet appeared in the sequence, that is, $a_n \neq a_i$ for $0 \leq i < n$; • $(a_{n-1})^{a_n} - 1$ is a multiple of $p(a_{n-1})$. Prove that every positive integer appears as a term in the sequence, that is, for every positive integer $m$ there is $n$ such that $a_n = m$.

Let $c,d \geq 2$ be naturals. Let $\{a_n\}$ be the sequence satisfying $a_1 = c, a_{n+1} = a_n^d + c$ for $n = 1,2,\cdots$. Prove that for any $n \geq 2$, there exists a prime number $p$ such that $p|a_n$ and $p \not | a_i$ for $i = 1,2,\cdots n-1$.

Find all ordered triples of positive integers $(x,y,z)$ such that \[3^{x}+11^{y}=z^{2}\]

Given are two integers $a>b>1$ such that $a+b \mid ab+1$ and $a-b \mid ab-1$. Prove that $a<\sqrt{3}b$.

Of all functions $h : Z_{>0} \to Z_{\ge 0}$, choose one satisfying $h(ab) = ah(b) + bh(a)$ for all $a, b \in Z_{>0}$ and $h(p) = p$ for all prime numbers $p$. Find the sum of all positive integers $n\le 100$ such that $h(n) = 4n$.

Using only once each of the digits $1, 2, 3, 4, 5, 6, 7$ and $ 8$, write the square and the cube of a positive integer. Determine what that number can be.

Let $n$ be a positive integer. The numbers $1,2,3,\dots, 4n$ are written in a board. Olive wants to make some "couples" of numbers, such that the product of the numbers in each couple is a perfect square. Each number is in, at most, one couple and the two numbers in each couple are distincts. Determine, for each positive integer $n$, the maximum number of couples that Olive can write.

Let $n$ be a positive integer prove that $$6\nmid \lfloor (\sqrt[3]{28}-3)^{-n} \rfloor.$$

Fourteen students each write an integer number on the board. When they later meet their math teacher Homer Grog, they tell him that no matter what number they erased on the board, then the remaining numbers could be divided into three groups at once sum. They also tell him that the numbers on the board were integer numbers. Is it now possible for Homer Grog to determine what numbers the students wrote on the board?

Compute the product of positive integers $n$ such that $n^2 + 59n + 881$ is a perfect square.

(Wolstenholme's Theorem) Prove that if \[1+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{p-1}\] is expressed as a fraction, where $p \ge 5$ is a prime, then $p^{2}$ divides the numerator.

Suppose that $p$ and $q$ are distinct primes and $S$ is a subset of $\{1, 2, ..., p-1\}$. Let $N(S)$ denote the number of ordered $q$-tuples $(x_1,x_2,...,x_q)$ with $x_i \in S$, $1 \le i \le q$, such that $x_1+x_2+...+x_q \cong 0 (mod p)$.

Let $k$ be a fixed positive integer. Prove that the sequence $\binom{2}{1},\binom{4}{2},\binom{8}{4},\ldots, \binom{2^{n+1}}{2^n},\ldots$ is eventually constant modulo $2^k$. [i]Proposed by V. Rastorguyev[/i]

A single section at a stadium can hold either $7$ adults or $11$ children. When $N$ sections are completely lled, an equal number of adults and children will be seated in them. What is the least possible value of $N$?

It is said that a positive integer $n > 1$ has the property ($p$) if in its prime factorization $n = p_1^{a_1} \cdot ... \cdot p_j^{a_j}$ at least one of the prime factors $p_1, ... , p_j$ has the exponent equal to $2$. a) Find the largest number $k$ for which there exist $k$ consecutive positive integers that do not have the property ($p$). b) Prove that there is an infinite number of positive integers $n$ such that $n, n + 1$ and $n + 2$ have the property ($p$).