[b]p1.[/b] At a certain point in time, $20\%$ of seniors, $30\%$ of juniors, and $50\%$ of sophomores at a school had a cold. If the number of sick students was the same for each grade, the fraction of sick students across all three grades can be written as $\frac{a}{b}$ , where a and b are relatively prime positive integers. Find $a + b$. [b]p2.[/b] The average score on Mr. Feng’s recent test is a $63$ out of $100$. After two students drop out of the class, the average score of the remaining students on that test is now a $72$. What is the maximum number of students that could initially have been in Mr. Feng’s class? (All of the scores on the test are integers between $0$ and $100$, inclusive.) [b]p3.[/b] Madeline is climbing Celeste Mountain. She starts at $(0, 0)$ on the coordinate plane and wants to reach the summit at $(7, 4)$. Every hour, she moves either $1$ unit up or $1$ unit to the right. A strawberry is located at each of $(1, 1)$ and $(4, 3)$. How many paths can Madeline take so that she encounters exactly one strawberry? [b]p4.[/b] Let $E$ be a point on side $AD$ of rectangle $ABCD$. Given that $AB = 3$, $AE = 4$, and $\angle BEC = \angle CED$, the length of segment $CE$ can be written as $\sqrt{a}$ for some positive integer $a$. Find $a$. [b]p5.[/b] Lucy has some spare change. If she were to convert it into quarters and pennies, the minimum number of coins she would need is $66$. If she were to convert it into dimes and pennies, the minimum number of coins she would need is $147$. How much money, in cents, does Lucy have? [b]p6.[/b] For how many positive integers $x$ does there exist a triangle with altitudes of length $20$, $22$, and $x$? [b]p7.[/b] Compute the number of positive integers $x$ for which $\frac{x^{20}}{x+22}$ is an integer. [b]p8.[/b] Vincent the Bug is crawling along an octagonal prism. He starts on a fixed vertex $A$, visits all other vertices exactly once by traveling along the edges, and returns to $A$. Find the number of paths Vincent could have taken. [b]p9.[/b] Point $U$ is chosen inside square $ALEX$ so that $\angle AUL = 90^o$. Given that $UL = 56$ and $UE = 65$, what is the sum of all possible values for the area of square $ALEX$? [b]p10.[/b] Miranda has prepared $8$ outfits, no two of which are the same quality. She asks her intern Andrea to order these outfits for the new runway show. Andrea first randomly orders the outfits in a list. She then starts removing outfits according to the following method: she chooses a random outfit which is both immediately preceded and immediately succeeded by a better outfit and then removes it. Andrea repeats this process until there are no outfits that can be removed. Given that the expected number of outfits in the final routine can be written as $\frac{a}{b}$ for some relatively prime positive integers $a$ and $b$, find $a + b$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In the coordinate plane the points with both coordinates being rational numbers are called rational points. For any positive integer $n$, is there a way to use $n$ colours to colour all rational points, every point is coloured one colour, such that any line segment with both endpoints being rational points contains the rational points of every colour?

Show that for any integer $n\geq2$ and all integers $a_{1},a_{2},...,a_{n}$ the product $\prod_{i<j}{(a_{j}-a_{i})}$ is divisible by $\prod_{i<j}{(j-i)}$ .

The Fibonacci sequence is given by $x_1 = x_2 = 1$ and $x_{k+2} = x_{k+1} + x_k$ for each $k \in N$. (a) Prove that there are Fibonacci numbes that end in a $9$ in the decimal system. (b) Determine for which $n$ can a Fibonacci number end in $n$ $9$-s in the decimal system.

Given a positive integer $N$. Prove that: there are infinitely elements of the [i]Fibonacci[/i] sequence that are divisible by $N$.

Denote by S the set of all primes such the decimal representation of $\frac{1}{p}$ has the fundamental period divisible by 3. For every $p \in S$ such that $\frac{1}{p}$ has the fundamental period $3r$ one may write \[\frac{1}{p}=0,a_{1}a_{2}\ldots a_{3r}a_{1}a_{2} \ldots a_{3r} \ldots , \] where $r=r(p)$; for every $p \in S$ and every integer $k \geq 1$ define $f(k,p)$ by \[ f(k,p)= a_{k}+a_{k+r(p)}+a_{k+2.r(p)}\] a) Prove that $S$ is infinite. b) Find the highest value of $f(k,p)$ for $k \geq 1$ and $p \in S$

Find all possible pairs of integers $ a$ and $ b$ such that $ab = 160 + 90 (a,b)$, where $(a, b)$ is the greatest common divisor of $ a$ and $ b$.

Let $ \left( x_n\right)_{n\ge 1} $ be a sequence of integers defined recursively as $ x_{n+2}=5x_{n+1}-x_n. $ Prove that $ \left( x_n\right)_{n\ge 1} $ has a subsequence whose terms are multiples of $ 22 $ if $ \left( x_n\right)_{n\ge 1} $ has a term that is multiple of $ 22. $

Determine all positive real numbers $ a$ such that there exists a positive integer $ n$ and sets $ A_1, A_2, \ldots, A_n$ satisfying the following conditions: (1) every set $ A_i$ has infinitely many elements; (2) every pair of distinct sets $ A_i$ and $ A_j$ do not share any common element (3) the union of sets $ A_1, A_2, \ldots, A_n$ is the set of all integers; (4) for every set $ A_i,$ the positive difference of any pair of elements in $ A_i$ is at least $ a^i.$

Sevara writes in red $8$ distinct positive integers and then writes in blue the $28$ sums of each two red numbers. At most how many of the blue numbers can be prime? [i]Marin Hristov, Bulgaria[/i]

For each positive integer $n$, let $f(n)$ be a positive integer. Show that if $f(n + 1) > f(f(n))$ for every positive integer n, then $f(x) = x$ for all positive integers $x$.

Find all integers $x,y,z$ such that $x^2(x^2+y)=y^{z+1}$.

For each positive integer $ k$ and $ n,$ let $ S_k(n)$ be the base $ k$ digit sum of $ n.$ Prove that there are at most two primes $ p$ less than $20,000$ for which $ S_{31}(p)$ are composite numbers with at least two distinct prime divisors.

Find all $3$-tuples $(a, b, c)$ of positive integers, with $a \geq b \geq c$, such that $a^2 + 3b$, $b^2 + 3c$, and $c^2 + 3a$ are all squares.

In the sequence of the natural (i.e. positive integers) numbers every member from the third equals the absolute value of the difference of the two previous. What is the maximal possible length of such a sequence, if every member is less or equal to $1967$?

Given $(2m+1)$ different integers, each absolute value is not greater than $(2m-1)$. Prove that it is possible to choose three numbers among them, with their sum equal to zero.

Let $R=(8,6)$. The lines whose equations are $8y=15x$ and $10y=3x$ contain points $P$ and $Q$, respectively, such that $R$ is the midpoint of $\overline{PQ}$. The length of $PQ$ equals $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Find all pairs of integers $x,y$ for which \[x^3+x^2+x=y^2+y.\]

An integer $n > 1$ is called $\emph{good}$ if there exists a permutation $a_1, a_2, a_3, \dots, a_n$ of the numbers $1, 2, 3, \dots, n$, such that: $(i)$ $a_i$ and $a_{i+1}$ have different parities for every $1 \leq i \leq n-1$; $(ii)$ the sum $a_1 + a_2 + \cdots + a_k$ is a quadratic residue modulo $n$ for every $1 \leq k \leq n$. Prove that there exist infinitely many good numbers, as well as infinitely many positive integers which are not good.

Given a set $S \subset N$ and a positive integer n, let $S\oplus \{n\} = \{s+n / s \in S\}$. The sequence $S_k$ of sets is defined inductively as follows: $S_1 = {1}$, $S_k=(S_{k-1} \oplus \{k\}) \cup \{2k-1\}$ for $k = 2,3,4, ...$ (a) Determine $N - \cup _{k=1}^{\infty} S_k$. (b) Find all $n$ for which $1994 \in S_n$.

Find all positive integers $n$ such that \[n=d_6^2+d_7^2-1,\] where $1 = d_1 < d_2 < \cdots < d_k = n$ are all positive divisors of the number $n.$

Let $a$ and $ b$ be even numbers, such that $M = (a + b)^2-ab$ is a multiple of $5$. Consider the following statements: I) The unit digits of $a^3$ and $b^3$ are different. II) $M$ is divisible by $100$. Please indicate which of the above statements are true with certainty.

Find all three-digit numbers that are \( 5 \) times greater than the product of their digits.

Let $a,b,c\in \mathbb N$ be such that $a,b\neq c$. Prove that there are infinitely many prime numbers $p$ for which there exists $n\in\mathbb N$ that $p|a^n+b^n-c^n$.

Positive integer $k(\ge 8)$ is given. Prove that if there exists a pair of positive integers $(x,y)$ that satisfies the conditions below, then there exists infinitely many pairs $(x,y)$. (1) $ $ $x\mid y^2-3, y\mid x^2-2$ (2) $ $ $gcd\left(3x+\frac{2(y^2-3)}{x},2y+\frac{3(x^2-2)}{y}\right)=k$ $ $