[hide=C stands for Cantor, G stands for Gauss]they had two problem sets under those two names[/hide] [b]C1.[/b] Mr. Pham flips $2018$ coins. What is the difference between the maximum and minimum number of heads that can appear? [b]C2 / G1.[/b] Brandon wants to maximize $\frac{\Box}{\Box} +\Box$ by placing the numbers $1$, $2$, and $3$ in the boxes. If each number may only be used once, what is the maximum value attainable? [b]C3.[/b] Guang has $10$ cents consisting of pennies, nickels, and dimes. What are all the possible numbers of pennies he could have? [b]C4.[/b] The ninth edition of Campbell Biology has $1464$ pages. If Chris reads from the beginning of page $426$ to the end of page$449$, what fraction of the book has he read? [b]C5 / G2.[/b] The planet Vriky is a sphere with radius $50$ meters. Kyerk starts at the North Pole, walks straight along the surface of the sphere towards the equator, runs one full circle around the equator, and returns to the North Pole. How many meters did Kyerk travel in total throughout his journey? [b]C6 / G3.[/b] Mr. Pham is lazy and decides Stan’s quarter grade by randomly choosing an integer from $0$ to $100$ inclusive. However, according to school policy, if the quarter grade is less than or equal to $50$, then it is bumped up to $50$. What is the probability that Stan’s final quarter grade is $50$? [b]C7 / G5.[/b] What is the maximum (finite) number of points of intersection between the boundaries of a equilateral triangle of side length $1$ and a square of side length $20$? [b]C8.[/b] You enter the MBMT lottery, where contestants select three different integers from $1$ to $5$ (inclusive). The lottery randomly selects two winning numbers, and tickets that contain both of the winning numbers win. What is the probability that your ticket will win? [b]C9 / G7.[/b] Find a possible solution $(B, E, T)$ to the equation $THE + MBMT = 2018$, where $T, H, E, M, B$ represent distinct digits from $0$ to $9$. [b]C10.[/b] $ABCD$ is a unit square. Let $E$ be the midpoint of $AB$ and $F$ be the midpoint of $AD$. $DE$ and $CF$ meet at $G$. Find the area of $\vartriangle EFG$. [b]C11.[/b] The eight numbers $2015$, $2016$, $2017$, $2018$, $2019$, $2020$, $2021$, and $2022$ are split into four groups of two such that the two numbers in each pair differ by a power of $2$. In how many different ways can this be done? [b]C12 / G4.[/b] We define a function f such that for all integers $n, k, x$, we have that $$f(n, kx) = k^n f(n, x) and f(n + 1, x) = xf(n, x).$$ If $f(1, k) = 2k$ for all integers $k$, then what is $f(3, 7)$? [b]C13 / G8.[/b] A sequence of positive integers is constructed such that each term is greater than the previous term, no term is a multiple of another term, and no digit is repeated in the entire sequence. An example of such a sequence would be $4$, $79$, $1035$. How long is the longest possible sequence that satisfies these rules? [b]C14 / G11.[/b] $ABC$ is an equilateral triangle of side length $8$. $P$ is a point on side AB. If $AC +CP = 5 \cdot AP$, find $AP$. [b]C15.[/b] What is the value of $(1) + (1 + 2) + (1 + 2 + 3) + ... + (1 + 2 + ... + 49 + 50)$? [b]G6.[/b] An ant is on a coordinate plane. It starts at $(0, 0)$ and takes one step each second in the North, South, East, or West direction. After $5$ steps, what is the probability that the ant is at the point $(2, 1)$? [b]G10.[/b] Find the set of real numbers $S$ so that $$\prod_{c\in S}(x^2 + cxy + y^2) = (x^2 - y^2)(x^{12} - y^{12}).$$ [b]G12.[/b] Given a function $f(x)$ such that $f(a + b) = f(a) + f(b) + 2ab$ and $f(3) = 0$, find $f\left( \frac12 \right)$. [b]G13.[/b] Badville is a city on the infinite Cartesian plane. It has $24$ roads emanating from the origin, with an angle of $15$ degrees between each road. It also has beltways, which are circles centered at the origin with any integer radius. There are no other roads in Badville. Steven wants to get from $(10, 0)$ to $(3, 3)$. What is the minimum distance he can take, only going on roads? [b]G14.[/b] Team $A$ and Team $B$ are playing basketball. Team A starts with the ball, and the ball alternates between the two teams. When a team has the ball, they have a $50\%$ chance of scoring $1$ point. Regardless of whether or not they score, the ball is given to the other team after they attempt to score. What is the probability that Team $A$ will score $5$ points before Team $B$ scores any? [b]G15.[/b] The twelve-digit integer $$\overline{A58B3602C91D},$$ where $A, B, C, D$ are digits with $A > 0$, is divisible by $10101$. Find $\overline{ABCD}$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $z$ be a complex non-zero number such that $Re(z),Im(z)\in \mathbb{Z}$. Prove that $z$ is uniquely representable as $a_0+a_1(1+i)+a_2(1+i)^2+\dots+a_n(1+i)^n$ where $n\geq 0$ and $a_j \in \{0,1\}$ and $a_n=1$. Time allowed for this problem was 1 hour.

For a positive integer \( n \), let \( \tau(n) \) denote the number of positive divisors of \( n \). Determine all positive integers \( K \) such that the equation \[ \tau(x) = \tau(y) = \tau(z) = \tau(2x + 3y + 3z) = K \] holds for some positive integers $x,y,z$.

Let $n_1,n_2,\ldots,n_s$ be distinct integers such that $$(n_1+k)(n_2+k)\cdots(n_s+k)$$is an integral multiple of $n_1n_2\cdots n_s$ for every integer $k$. For each of the following assertions give a proof or a counterexample: $(\text a)$ $|n_i|=1$ for some $i$ $(\text b)$ If further all $n_i$ are positive, then $$\{n_1,n_2,\ldots,n_2\}=\{1,2,\ldots,s\}.$$

Prove that the equation \[ x^z + y^z = z^z \] has no solutions in postive integers.

Let $a_1$, $a_2$, $\ldots$ be an infinite sequence of positive integers. Suppose that there is an integer $N > 1$ such that, for each $n \geq N$, the number $$\frac{a_1}{a_2} + \frac{a_2}{a_3} + \cdots + \frac{a_{n-1}}{a_n} + \frac{a_n}{a_1}$$ is an integer. Prove that there is a positive integer $M$ such that $a_m = a_{m+1}$ for all $m \geq M$. [i]Proposed by Bayarmagnai Gombodorj, Mongolia[/i]

Let $p>3$ be a prime number. The natural numbers $a,b,c, d$ are such that $a+b+c+d$ and $a^3+b^3+c^3+d^3$ are divisible by $p$. Prove that for all odd $n$, $a^n+b^n+c^n+d^n$ is divisible by $p$.

Let $n(n>1)$ be an odd. We define $x_k=(x^{(k)}_1,x^{(k)}_2,\cdots ,x^{(k)}_n)$ as follow: $x_0=(x^{(0)}_1,x^{(0)}_2,\cdots ,x^{(0)}_n)=(1,0,\cdots ,0,1)$; $ x^{(k)}_i =\begin{cases}0, \quad x^{(k-1)}_i=x^{(k-1)}_{i+1},\\ 1, \quad x^{(k-1)}_i\not= x^{(k-1)}_{i+1},\end{cases} $ $i=1,2,\cdots ,n$, where $x^{(k-1)}_{n+1}= x^{(k-1)}_1$. Let $m$ be a positive integer satisfying $x_0=x_m$. Prove that $m$ is divisible by $n$.

Let $n \geq 2$ be an integer and let \[M=\bigg\{\frac{a_1 + a_2 + ... + a_k}{k}: 1 \le k \le n\text{ and }1 \le a_1 < \ldots < a_k \le n\bigg\}\] be the set of the arithmetic means of the elements of all non-empty subsets of $\{1, 2, ..., n\}$. Find \[\min\{|a - b| : a, b \in M\text{ with } a \neq b\}.\]

For a positive integer $n$, let $S(n)$ be the sum of its decimal digits. Determine the smallest positive integer $n$ for which $4 \cdot S(n)=3 \cdot S(2n)$.

[b]p1.[/b] It takes $12$ months for Santa Claus to pack gifts. It would take $20$ months for his apprentice to do the job. If they work together, how long will it take for them to pack the gifts? [b]p2.[/b] All passengers on a bus sit in pairs. Exactly $2/5$ of all men sit with women, exactly $2/3$ of all women sit with men. What part of passengers are men? [b]p3.[/b] There are $100$ colored balls in a box. Every $10$-tuple of balls contains at least two balls of the same color. Show that there are at least $12$ balls of the same color in the box. [b]p4.[/b] There are $81$ wheels in storage marked by their two types, say first and second type. Wheels of the same type weigh equally. Any wheel of the second type is much lighter than a wheel of the first type. It is known that exactly one wheel is marked incorrectly. Show that one can determine which wheel is incorrectly marked with four measurements. [b]p5.[/b] Remove from the figure below the specified number of matches so that there are exactly $5$ squares of equal size left: (a) $8$ matches (b) $4$ matches [img]https://cdn.artofproblemsolving.com/attachments/4/b/0c5a65f2d9b72fbea50df12e328c024a0c7884.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The sequence ${a_{n}}$ $n\in \mathbb{N}$ is given in a recursive way with $a_{1}=1$, $a_{n}=\prod_{i=1}^{n-1} a_{i}+1$, for all $n\geq 2$. Determine the least number $M$, such that $\sum_{n=1}^{m} \frac{1}{a_{n}} <M$ for all $m\in \mathbb{N}$

Determine the greatest integer $N$ such that $N$ is a divisor of $n^{13}-n$ for all integers $n$.

Does there exist two infinite sets $A,B$ such that every number can be written uniquely as a sum of an element of $A$ and an element of $B$?

Given an odd prime $p$, find all functions $f:Z \rightarrow Z$ satisfying the following two conditions: (i) $f(m)=f(n)$ for all $m,n \in Z$ such that $m\equiv n\pmod p$; (ii) $f(mn)=f(m)f(n)$ for all $m,n \in Z$.

Let $n$ be a positive integer. Prove that there exists a finite sequence $S$ consisting of only zeros and ones, satisfying the following property: for any positive integer $d \geq 2$, when $S$ is interpreted in base $d$, the resulting number is non-zero and divisible by $n$. [i]Remark: The sequence $S=s_ks_{k-1} \cdots s_1s_0$ interpreted in base $d$ is the number $\sum_{i=0}^{k}s_id^i$[/i]

How many pairs of positive integers $(x, y)$ are there, those satisfy the identity $2^x - y^2 = 1$? (A): $1$ (B): $2$ (C): $3$ (D): $4$ (E): None of the above.

For positive integers $n,d$, define $n \% d$ to be the unique value of the positive integer $r < d$ such that $n = qd + r$, for some positive integer $q$. What is the smallest value of $n$ not divisible by $5,7,11,13$ for which $n^2 \% 5 < n^2 \% 7 < n^2 \% 11 < n^2 \% 13$?

[b]p1.[/b] $\vartriangle DEF$ is constructed from equilateral $\vartriangle ABC$ by choosing $D$ on $AB$, $E$ on $BC$ and $F$ on $CA$ so that $\frac{DB}{AB}=\frac{EC}{BC}=\frac{FA}{CA}=a$, where $a$ is a number between $0$ and $1/2$. (a) Show that $\vartriangle DEF$ is also equilateral. (b) Determine the value of $a$ that makes the area of $\vartriangle DEF$ equal to one half the area of $\vartriangle ABC$. [b]p2.[/b] A bowl contains some red balls and some white balls. The following operation is repeated until only one ball remains in the bowl: Two balls are drawn at random from the bowl. If they have different colors, then the red one is discarded and the white one is returned to the bowl. If they have the same color, then both are discarded and a red ball (from an outside supply of red balls) is added to the bowl. (Note that this operation—in either case—reduces the number of balls in the bowl by one.) (a) Show that if the bowl originally contained exactly $1$ red ball and $ 2$ white balls, then the color of the ball remaining at the end (i.e., after two applications of the operation) does not depend on chance, and determine the color of this remaining ball. (b) Suppose the bowl originally contained exactly $1986$ red balls and $1986$ white balls. Show again that the color of the ball remaining at the end does not depend on chance and determine its color. [b]p3.[/b] Let $a, b$, and $c$ be three consecutive positive integers, with $a < b < c.$ (a) Show that $ab$ cannot be the square of an integer. (b) Show that $ac$ cannot be the square of an integer. (c) Show that $abc$ cannot be the square of an integer. [b]p4.[/b] Consider the system of equations $$\sqrt{x}+\sqrt{y}=2$$ $$ x^2+y^2=5$$ (a) Show (algebraically or graphically) that there are two or more solutions in real numbers $x$ and $y$. (b) The graphs of the two given equations intersect in exactly two points. Find the equation of the straight line passing through these two points of intersection. [b]p5.[/b] Let $n$ and $m$ be positive integers. An $n \times m $ rectangle is tiled with unit squares. Let $r(n, m)$ denote the number of rectangles formed by the edges of these unit squares. Thus, for example, $r(2, 1) = 3$. (a) Find $r(2, 3)$. (b) Find $r(n, 1)$. (c) Find, with justification, a formula for $r(n, m)$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We are given the sequence $a_1,a_2,a_3,\ldots$, for which: $$a_n=\frac{a^2_{n-1}+c}{a_{n-2}}\enspace\text{for all }n>2.$$ Prove that the numbers $a_1$, $a_2$ and $\frac{a_1^2+a_2^2+c}{a_1a_2}$ are whole numbers.

How many integer pairs $(x,y)$ satisfy $x^2+4y^2-2xy-2x-4y-8=0$?

Find all integers $x,y,z$ such that: $7^x+13^y=2^z$

Consider the system \begin{align*}x + y &= z + u,\\2xy & = zu.\end{align*} Find the greatest value of the real constant $m$ such that $m \leq x/y$ for any positive integer solution $(x,y,z,u)$ of the system, with $x \geq y$.

Suppose $\tan \alpha = \dfrac{p}{q}$, where $p$ and $q$ are integers and $q \neq 0$. Prove that the number $\tan \beta$ for which $\tan {2 \beta} = \tan {3 \alpha}$ is rational only when $p^2 + q^2$ is the square of an integer.

For any integer $n$ greater than $1$, the number of prime numbers greater than $n!+1$ and less than $n!+n$ is: $\textbf{(A) }0\qquad \textbf{(B) }1\qquad \textbf{(C) }\dfrac n2\text{ for }n\text{ even,}\,\dfrac{n+1}2\text{ for }n\text{ odd}$ $\textbf{(D) }n-1\qquad \textbf{(E) }n$