Let $a_1,a_2,\cdots$ be a strictly increasing sequence on positive integers. Is it always possible to partition the set of natural numbers $\mathbb{N}$ into infinitely many subsets with infinite cardinality $A_1,A_2,\cdots$, so that for every subset $A_i$, if we denote $b_1<b_2<\cdots$ be the elements of $A_i$, then for every $k\in \mathbb{N}$ and for every $1\le i\le a_k$, it satisfies $b_{i+1}-b_{i}\le k$?

The sum of the first $n$ terms of the sequence $$1,1+2,1+2+2^2,\ldots,1+2+\cdots+2^{k-1},\ldots$$ is of the form $2^{n+R}+Sn^2+Tn+U$ for all $n>0.$ Find $R,S,T,$ and $U.$

Let $p_i$ for $i=1,2,..., k$ be a sequence of smallest consecutive prime numbers ($p_1=2$, $p_2=3$, $p_3=3$ etc. ). Let $N=p_1\cdot p_2 \cdot ... \cdot p_k$. Prove that in a set $\{ 1,2,...,N \}$ there exist exactly $\frac{N}{2}$ numbers which are divisible by odd number of primes $p_i$. [hide=example]For $k=2$ $p_1=2$, $p_2=3$, $N=6$. So in set $\{ 1,2,3,4,5,6 \}$ we can find $3$ number satisfying thesis: $2$, $3$ and $4$. ($1$ and $5$ are not divisible by $2$ or $3$, and $6$ is divisible by both of them so by even number of primes )[/hide]

[hide=R stands for Ramanujan , P stands for Pascal]they had two problem sets under those two names[/hide] [u]Set 4[/u] [b]R4.16 / P1.4[/b] Adam and Becky are building a house. Becky works twice as fast as Adam does, and they both work at constant speeds for the same amount of time each day. They plan to finish building in $6$ days. However, after $2$ days, their friend Charlie also helps with building the house. Because of this, they finish building in just $5$ days. What fraction of the house did Adam build? [b]R4.17[/b] A bag with $10$ items contains both pencils and pens. Kanye randomly chooses two items from the bag, with replacement. Suppose the probability that he chooses $1$ pen and $1$ pencil is $\frac{21}{50}$ . What are all possible values for the number of pens in the bag? [b]R4.18 / P2.8[/b] In cyclic quadrilateral $ABCD$, $\angle ABD = 40^o$, and $\angle DAC = 40^o$. Compute the measure of $\angle ADC$ in degrees. (In cyclic quadrilaterals, opposite angles sum up to $180^o$.) [b]R4.19 / P2.6[/b] There is a strange random number generator which always returns a positive integer between $1$ and $7500$, inclusive. Half of the time, it returns a uniformly random positive integer multiple of $25$, and the other half of the time, it returns a uniformly random positive integer that isn’t a multiple of $25$. What is the probability that a number returned from the generator is a multiple of $30$? [b]R4.20 / P2.7[/b] Julia is shopping for clothes. She finds $T$ different tops and $S$ different skirts that she likes, where $T \ge S > 0$. Julia can either get one top and one skirt, just one top, or just one skirt. If there are $50$ ways in which she can make her choice, what is $T - S$? [u]Set 5[/u] [b]R5.21[/b] A $5 \times 5 \times 5$ cube’s surface is completely painted blue. The cube is then completely split into $ 1 \times 1 \times 1$ cubes. What is the average number of blue faces on each $ 1 \times 1 \times 1$ cube? [b]R5.22 / P2.10[/b] Find the number of values of $n$ such that a regular $n$-gon has interior angles with integer degree measures. [b]R5.23[/b] $4$ positive integers form an geometric sequence. The sum of the $4$ numbers is $255$, and the average of the second and the fourth number is $102$. What is the smallest number in the sequence? [b]R5.24[/b] Let $S$ be the set of all positive integers which have three digits when written in base $2016$ and two digits when written in base $2017$. Find the size of $S$. [b]R5.25 / P3.12[/b] In square $ABCD$ with side length $13$, point $E$ lies on segment $CD$. Segment $AE$ divides $ABCD$ into triangle $ADE$ and quadrilateral $ABCE$. If the ratio of the area of $ADE$ to the area of $ABCE$ is $4 : 11$, what is the ratio of the perimeter of $ADE$ to the perimeter of $ABCE$? [u]Set 6[/u] [b]R6.26 / P6.25[/b] Submit a decimal n to the nearest thousandth between $0$ and $200$. Your score will be $\min (12, S)$, where $S$ is the non-negative difference between $n$ and the largest number less than or equal to $n$ chosen by another team (if you choose the smallest number, $S = n$). For example, 1.414 is an acceptable answer, while $\sqrt2$ and $1.4142$ are not. [b]R6.27 / P6.27[/b] Guang is going hard on his YNA project. From $1:00$ AM Saturday to $1:00$ AM Sunday, the probability that he is not finished with his project $x$ hours after $1:00$ AM on Saturday is $\frac{1}{x+1}$ . If Guang does not finish by 1:00 AM on Sunday, he will stop procrastinating and finish the project immediately. Find the expected number of minutes $A$ it will take for him to finish his project. An estimate of $E$ will earn $12 \cdot 2^{-|E-A|/60}$ points. [b]R6.28 / P6.28[/b] All the diagonals of a regular $100$-gon (a regular polygon with $100$ sides) are drawn. Let $A$ be the number of distinct intersection points between all the diagonals. Find $A$. An estimate of $E$ will earn $12 \cdot \left(16 \log_{10}\left(\max \left(\frac{E}{A},\frac{A}{E}\right)\right)+ 1\right)^{-\frac12}$ or $0$ points if this expression is undefined. [b]R6.29 / P6.29 [/b]Find the smallest positive integer $A$ such that the following is true: if every integer $1, 2, ..., A$ is colored either red or blue, then no matter how they are colored, there are always 6 integers among them forming an increasing arithmetic progression that are all colored the same color. An estimate of $E$ will earn $12 min \left(\frac{E}{A},\frac{A}{E}\right)$ points or $0$ points if this expression is undefined. [b]R6.30 / P6.30[/b] For all integers $n \ge 2$, let $f(n)$ denote the smallest prime factor of $n$. Find $A =\sum^{10^6}_{n=2}f(n)$. In other words, take the smallest prime factor of every integer from $2$ to $10^6$ and sum them all up to get $A$. You may find the following values helpful: there are $78498$ primes below $10^6$, $9592$ primes below $10^5$, $1229$ primes below $10^4$, and $168$ primes below $10^3$. An estimate of $E$ will earn $\max \left(0, 12-4 \log_{10}(max \left(\frac{E}{A},\frac{A}{E}\right)\right)$ or $0$ points if this expression is undefined. PS. You should use hide for answers. R1-15 /P1-5 have been posted [url=https://artofproblemsolving.com/community/c3h2786721p24495629]here[/url], and P11-25 [url=https://artofproblemsolving.com/community/c3h2786880p24497350]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In the sequence of powers of $2$ (written in the decimal system, beginning with $2^1 = 2$) there are three terms of one digit, another three of two digits, another three of $3$, four out of $4$, three out of $5$, etc. Clearly reason the answers to the following questions: a) Can there be only two terms with a certain number of digits? b) Can there be five consecutive terms with the same number of digits? c) Can there be four terms of n digits, followed by four with $n + 1$ digits? d) What is the maximum number of consecutive powers of $2$ that can be found without there being four among them with the same number of digits?

Mary divides a circle into $12$ sectors. The central angles of these sectors, measured in degrees, are all integers and they form an arithmetic sequence. What is the degree measure of the smallest possible sector angle? $ \textbf{(A)}\ 5\qquad\textbf{(B)}\ 6\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 12 $

Fix a positive integer $n$. Let $a_1, a_2, \ldots$ be a sequence of positive integers such that for all $1 \leq j \leq n$, $a_j=j$, and for all $j>n$, $a_j$ is the largest value of $\min(a_i,a_{j-i})$ among $i=1,2, \ldots j-1$. For example, if $n=3$, we have $a_1=1$, $a_2=2$, $a_3=3$, and $a_4=2$ since $\min(a_1,a_3)=1$, $\min(a_2,a_2)=2$, and $\min(a_3,a_1)=1$. We will determine the values of $a_k$ for sufficiently large $k$. (a) Show that $a_i \in \{1,2,3, \ldots n\}$ for all $i$. (b) Show that if $a_x \geq n-1$ and $a_y \geq n-1$, $a_{x+y} \geq n-1$. (c) Show that for some positive integer $N$, $a_k \in \{n-1,n\}$ for all $k \geq N$. (d) Show that $a_k = n$ if and only if $n \mid k$.

The numbers, in order, of each row and the numbers, in order, of each column of a $5 \times 5$ array of integers form an arithmetic progression of length $5{.}$ The numbers in positions $(5, 5), \,(2,4),\,(4,3),$ and $(3, 1)$ are $0, 48, 16,$ and $12{,}$ respectively. What number is in position $(1, 2)?$ \[ \begin{bmatrix} . & ? &.&.&. \\ .&.&.&48&.\\ 12&.&.&.&.\\ .&.&16&.&.\\ .&.&.&.&0\end{bmatrix}\] $\textbf{(A) } 19 \qquad \textbf{(B) } 24 \qquad \textbf{(C) } 29 \qquad \textbf{(D) } 34 \qquad \textbf{(E) } 39$

Alice and Bob are playing hide and seek. Initially, Bob chooses a secret fixed point $B$ in the unit square. Then Alice chooses a sequence of points $P_0, P_1, \ldots, P_N$ in the plane. After choosing $P_k$ (but before choosing $P_{k+1}$) for $k \geq 1$, Bob tells "warmer'' if $P_k$ is closer to $B$ than $P_{k-1}$, otherwise he says "colder''. After Alice has chosen $P_N$ and heard Bob's answer, Alice chooses a final point $A$. Alice wins if the distance $AB$ is at most $\frac 1 {2020}$, otherwise Bob wins. Show that if $N=18$, Alice cannot guarantee a win.

The sequence $a_{n}$ defined as follows: $a_{1}=4, a_{2}=17$ and for any $k\geq1$ true equalities $a_{2k+1}=a_{2}+a_{4}+...+a_{2k}+(k+1)(2^{2k+3}-1)$ $a_{2k+2}=(2^{2k+2}+1)a_{1}+(2^{2k+3}+1)a_{3}+...+(2^{3k+1}+1)a_{2k-1}+k$ Find the smallest $m$ such that $(a_{1}+...a_{m})^{2012^{2012}}-1$ divided $2^{2012^{2012}}$

Define a sequence of functions recursively by $f_1(x) = |x-1|$ and $f_n(x)=f_{n-1}(|x-n|)$ for integers $n > 1$. Find the least value of $n$ such that the sum of the zeros of $f_n$ exceeds $500{,}000$.

Let $A_o =\{1, 2\}$ and for $n> 0, A_n$ results from $A_{n-1}$ by adding the natural numbers to $A_{n-1}$ which can be represented as the sum of two different numbers from $A_{n-1}$. Let $a_n = |A_n |$ be the number of numbers in $A_n$. Determine $a_n$ as a function of $n$.

Let $m_1< m_2 < \ldots m_{k-1}< m_k$ be $k$ distinct positive integers such that their reciprocals are in arithmetic progression. 1.Show that $k< m_1 + 2$. 2. Give an example of such a sequence of length $k$ for any positive integer $k$.

Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.

Find all positive integers $n$ such that there exists a sequence of positive integers $a_1$, $a_2$,$\ldots$, $a_n$ satisfying: \[a_{k+1}=\frac{a_k^2+1}{a_{k-1}+1}-1\] for every $k$ with $2\leq k\leq n-1$. [i]Proposed by North Korea[/i]