[b]p1.[/b] Suppose $\frac{x}{y} = 0.\overline{ab}$ where $x$ and $y$ are relatively prime positive integers and $ab + a + b + 1$ is a multiple of $12$. Find the sum of all possible values of $y$. [b]p2.[/b] Let $A$ be the set of points $\{(0, 0), (2, 0), (0, 2),(2, 2),(3, 1),(1, 3)\}$. How many distinct circles pass through at least three points in $A$? [b]p3.[/b] Jack and Jill need to bring pails of water home. The river is the $x$-axis, Jack is initially at the point $(-5, 3)$, Jill is initially at the point $(6, 1)$, and their home is at the point $(0, h)$ where $h > 0$. If they take the shortest paths home given that each of them must make a stop at the river, they walk exactly the same total distance. What is $h$? [b]p4.[/b] What is the largest perfect square which is not a multiple of $10$ and which remains a perfect square if the ones and tens digits are replaced with zeroes? [b]p5.[/b] In convex polygon $P$, each internal angle measure (in degrees) is a distinct integer. What is the maximum possible number of sides $P$ could have? [b]p6.[/b] How many polynomials $p(x)$ of degree exactly $3$ with real coefficients satisfy $$p(0), p(1), p(2), p(3) \in \{0, 1, 2\}?$$ [b]p7.[/b] Six spheres, each with radius $4$, are resting on the ground. Their centers form a regular hexagon, and adjacent spheres are tangent. A seventh sphere, with radius $13$, rests on top of and is tangent to all six of these spheres. How high above the ground is the center of the seventh sphere? [b]p8.[/b] You have a paper square. You may fold it along any line of symmetry. (That is, the layers of paper must line up perfectly.) You then repeat this process using the folded piece of paper. If the direction of the folds does not matter, how many ways can you make exactly eight folds while following these rules? [b]p9.[/b] Quadrilateral $ABCD$ has $\overline{AB} = 40$, $\overline{CD} = 10$, $\overline{AD} = \overline{BC}$, $m\angle BAD = 20^o$, and $m \angle ABC = 70^o$. What is the area of quadrilateral $ABCD$? [b]p10.[/b] We say that a permutation $\sigma$ of the set $\{1, 2,..., n\}$ preserves divisibilty if $\sigma (a)$ divides $\sigma (b)$ whenever $a$ divides $b$. How many permutations of $\{1, 2,..., 40\}$ preserve divisibility? (A permutation of $\{1, 2,..., n\}$ is a function $\sigma$ from $\{1, 2,..., n\}$ to itself such that for any $b \in \{1, 2,..., n\}$, there exists some $a \in \{1, 2,..., n\}$ satisfying $\sigma (a) = b$.) [b]p11.[/b] In the diagram shown at right, how many ways are there to remove at least one edge so that some circle with an “A” and some circle with a “B” remain connected? [img]https://cdn.artofproblemsolving.com/attachments/8/7/fde209c63cc23f6d3482009cc6016c7cefc868.png[/img] [b]p12.[/b] Let $S$ be the set of the $125$ points in three-dimension space of the form $(x, y, z)$ where $x$, $y$, and $z$ are integers between $1$ and $5$, inclusive. A family of snakes lives at the point $(1, 1, 1)$, and one day they decide to move to the point $(5, 5, 5)$. Snakes may slither only in increments of $(1,0,0)$, $(0, 1, 0)$, and $(0, 0, 1)$. Given that at least one snake has slithered through each point of $S$ by the time the entire family has reached $(5, 5, 5)$, what is the smallest number of snakes that could be in the family? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose $S=\{1,2,3,...,2017\}$,for every subset $A$ of $S$,define a real number $f(A)\geq 0$ such that: $(1)$ For any $A,B\subset S$,$f(A\cup B)+f(A\cap B)\leq f(A)+f(B)$; $(2)$ For any $A\subset B\subset S$, $f(A)\leq f(B)$; $(3)$ For any $k,j\in S$,$$f(\{1,2,\ldots,k+1\})\geq f(\{1,2,\ldots,k\}\cup \{j\});$$ $(4)$ For the empty set $\varnothing$, $f(\varnothing)=0$. Confirm that for any three-element subset $T$ of $S$,the inequality $$f(T)\leq \frac{27}{19}f(\{1,2,3\})$$ holds.

[i]Version 1[/i]. Let $n$ be a positive integer, and set $N=2^{n}$. Determine the smallest real number $a_{n}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant a_{n}(x-1)^{2}+x . \] [i]Version 2[/i]. For every positive integer $N$, determine the smallest real number $b_{N}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant b_{N}(x-1)^{2}+x . \]

Find $A^2$, where $A$ is the sum of the absolute values of all roots of the following equation: \begin{eqnarray*}x &=& \sqrt{19} + \frac{91}{{\displaystyle \sqrt{19}+\frac{91}{{\displaystyle \sqrt{19}+\frac{91}{{\displaystyle \sqrt{19}+\frac{91}{{\displaystyle \sqrt{19}+\frac{91}{x}}}}}}}}}\end{eqnarray*}

[b]p1.[/b] Three camps are located in the vertices of an equilateral triangle. The roads connecting camps are along the sides of the triangle. Captain America is inside the triangle and he needs to know the distances between camps. Being able to see the roads he has found that the sum of the shortest distances from his location to the roads is 50 miles. Can you help Captain America to evaluate the distances between the camps? [b]p2.[/b] $N$ regions are located in the plane, every pair of them have a non-empty overlap. Each region is a connected set, that means every two points inside the region can be connected by a curve all points of which belong to the region. Iron Man has one charge remaining to make a laser shot. Is it possible for him to make the shot that goes through all $N$ regions? [b]p3.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. (a) What is the smallest amount of money you need to buy a slice of pizza that costs $\$1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do since the pizza man can only give you $\$5$ back. (b) Vending machines in Wonderland accept only exact payment (do not give back change). List all positive integer numbers which CANNOT be used as prices in such vending machines. (That is, find the sums of money that cannot be paid by exact change.) [b]p4.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line. (b) Do the same with $6$ points. [b]p5.[/b] Numbers $1,2,3,…,100$ are randomly divided in two groups $50$ numbers in each. In the first group the numbers are written in increasing order and denoted $a_1,a_2, ..., a_{50}$. In the second group the numberss are written in decreasing order and denoted $b_1,b_2, ..., b_{50}$. Thus $a_1<a_2<...<a_{50}$ and $ b_1>b_2>...>b_{50}$. Evaluate $|a_1-b_1|+|a_2-b_2|+...+|a_{50}-b_{50}|$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Solve the equation $\sqrt{x} = \log_2 x$.

Determine all functions $f:\mathbb{R} \to \mathbb{R}$ such that \[ f(xy+f(x)) + f(y) = xf(y) + f(x+y) \] for all real numbers $x$ and $y$.

The price for sending a packet (a rectangular cuboid) is directly proportional to the sum of its length, width, and height. Is it possible to reduce the cost of sending a packet by putting it into a cheaper packet?

okay this one is from Prof. Mircea Lascu from Zalau, Romaniaand Prof. V. Cartoaje from Ploiesti, Romania. It goes like this: given being a triangle ABC for every point M inside we construct the points A[size=67]M[/size], B[size=67]M[/size], C[size=67]M[/size] on the circumcircle of the triangle ABC such that A, A[size=67]M[/size], M are collinear and so on. Find the locus of these points M for which the area of the triangle A[size=67]M[/size] B[size=67]M[/size] C[size=67]M[/size] is bigger than the area of the triangle ABC.

Solve the equation $$(2^x-4)^3 +(4^x-2)^3=(4^x+2^x-6)^3$$ where $x$ is a real number.

Prove that the polynomial $x^{1999}+x^{1998}+...+x^3+x^2+ax+b$ for any real values of the coefficients $a>b>0$ does not have an integer root.

Find all sequences of positive integers $a_1,a_2,\dots$ such that $$(n^2+1)a_n = n(a_{n^2}+1)$$ for all positive integers $n$.

There are $2500$ people in Lexington High School, who all start out healthy. After $1$ day, $1$ person becomes infected with coronavirus. Each subsequent day, there are twice as many newly infected people as on the previous day. How many days will it be until over half the school is infected?

Find all functions $f : R \to R$ with $f (x + yf(x + y))= y^2 + f(x)f(y)$ for all $x, y \in R$.

Find all pairs of real numbers $(x, y)$ that satisfy the equation $\frac{x + 6}{y}+\frac{13}{xy}=\frac{4-y}{x}$

Give the conditions under which the equation $$ \sqrt{x - a} + \sqrt{x - b} = \sqrt{x - c }$$ has roots, assuming that the numbers $ a $, $ b $, $ c $ are pairs of differences

Find all polynomials $f(x)$ with real coefficients for which \[f(x)f(2x^2) = f(2x^3 + x).\]

With expressions containing the symbol $*$, the following transformations can be performed: 1) rewrite the expression in the form $x * (y * z) as ((1 * x) * y) * z$; 2) rewrite the expression in the form $x * 1$ as $x$. Conversions can only be performed with an integer expression, but not with its parts. For example, $(1 *1) * (1 *1)$ can be rewritten according to the first rule as $((1 * (1 * 1)) * 1) * 1$ (taking $x = 1 * 1$, $y = 1$ and $z = 1$), but not as $1 * (1 * 1)$ or $(1* 1) * 1$ (in the last two cases, the second rule would be applied separately to the left or right side $1 * 1$). Find all positive integers $n$ for which the expression $\underbrace{1 * (1 * (1 * (...* (1 * 1)...))}_{n units}$ it is possible to lead to a form in which there is not a single asterisk. Note. The expressions $(x * y) * $z and $x * (y * z)$ are considered different, also, in the general case, the expressions $x * y$ and $y * x$ are different.

A function $ f: \mathbb{N} \rightarrow \mathbb{N}$ satisfies: $ (a)$ $ f(ab)\equal{}f(a)f(b)$ whenever $ a$ and $ b$ are coprime; $ (b)$ $ f(p\plus{}q)\equal{}f(p)\plus{}f(q)$ for all prime numbers $ p$ and $ q$. Prove that $ f(2)\equal{}2,f(3)\equal{}3$ and $ f(1999)\equal{}1999.$

Let $x_1,x_2, ..., x_n$ be real numbers satisfying $\sum_{k=1}^{n-1} min(x_k; x_{k+1}) = min(x_1; x_n)$. Prove that $\sum_{k=2}^{n-1} x_k \ge 0$.

Find all triplets $(x, y, z)$ of real numbers that satisfy the equation $$2^{x^2-3y+z}+2^{y^2-3z+x}+2^{z^2-3x+y}=1,5.$$

Given distinct prime numbers $p$ and $q$ and a natural number $n \geq 3$, find all $a \in \mathbb{Z}$ such that the polynomial $f(x) = x^n + ax^{n-1} + pq$ can be factored into 2 integral polynomials of degree at least 1.

On an escalator which is not moving, a person descends faster than he ascends. Is it faster for this person to descend and ascend once on an upward-moving escalator, or to descend and ascend once on a downward-moving escalator? (It is assumed that all the speeds mentioned here are constant, that the speed of the escalator is the same no matter if it is moving up or down and that the speed of the person relative to the escalator is always greater than the speed of the escalator.) (Folklore)

Recall that $[x]$ denotes the largest integer not exceeding $x$ for real $x$. For integers $a, b$ in the interval $1 \leq a<b \leq 100$, find the number of ordered pairs $(a, b)$ satisfying the following equation. $$[a+\frac{b}{a}]=[b+\frac{a}{b}]$$

Consider the set of integers $ \left \{ 1, 2, \dots , 100 \right \} $. Let $ \left \{ x_1, x_2, \dots , x_{100} \right \}$ be some arbitrary arrangement of the integers $ \left \{ 1, 2, \dots , 100 \right \}$, where all of the $x_i$ are different. Find the smallest possible value of the sum $$S = \left | x_2 - x_1 \right | + \left | x_3 - x_2 \right | + \cdots+ \left |x_{100} - x_{99} \right | + \left |x_1 - x_{100} \right | .$$