Let $S$ denote the set of fractions $\dfrac mn$ for relatively prime positive integers $m$ and $n$ with $m+n\le 10000$. The least fraction in $S$ that is strictly greater than \[\prod_{i=0}^\infty \left(1-\dfrac{1}{10^{2i+1}}\right)\] can be expressed in the form $\dfrac pq$, where $p$ and $q$ are relatively prime positive integers. Find $1000p+q$. [i]Proposed by James Lin[/i]

Baron Munchausen has a set of $50$ coins. The mass of each is a distinct positive integer not exceeding $100$, and the total mass is even. The Baron claims that it is not possible to divide the coins into two piles with equal total mass. Can the Baron be right?

Let $\Omega$ be a circle, and let $A$, $B$, $C$, $D$ and $K$ be distinct points on it, in that order, and such that lines $BC$ and $AD$ are parallel. Let $A'\neq A$ be a point on line $AK$ such that $BA=BA'$. Similarly, let $C'\neq C$ be a point on line $CK$ such that $DC=DC'$. Prove that segments $AC$ and $A'C'$ have the same length.

Find all integers $ b$ and $ c$ such that the equation $ x^2 - bx + c = 0$ has two real roots $ x_1, x_2$ satisfying $ x_1^2 + x_2^2 = 5$.

The two squares shown share the same center $O$ and have sides of length 1. The length of $\overline{AB}$ is $43/99$ and the area of octagon $ABCDEFGH$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ [asy] real alpha = 25; pair W=dir(225), X=dir(315), Y=dir(45), Z=dir(135), O=origin; pair w=dir(alpha)*W, x=dir(alpha)*X, y=dir(alpha)*Y, z=dir(alpha)*Z; draw(W--X--Y--Z--cycle^^w--x--y--z--cycle); pair A=intersectionpoint(Y--Z, y--z), C=intersectionpoint(Y--X, y--x), E=intersectionpoint(W--X, w--x), G=intersectionpoint(W--Z, w--z), B=intersectionpoint(Y--Z, y--x), D=intersectionpoint(Y--X, w--x), F=intersectionpoint(W--X, w--z), H=intersectionpoint(W--Z, y--z); dot(O); label("$O$", O, SE); label("$A$", A, dir(O--A)); label("$B$", B, dir(O--B)); label("$C$", C, dir(O--C)); label("$D$", D, dir(O--D)); label("$E$", E, dir(O--E)); label("$F$", F, dir(O--F)); label("$G$", G, dir(O--G)); label("$H$", H, dir(O--H));[/asy]

Let $S = \{1, 2, \ldots, n\}$ for some positive integer $n$, and let $A$ be an $n$-by-$n$ matrix having as entries only ones and zeroes. Define an infinite sequence $\{x_i\}_{i \ge 0}$ to be [i]strange[/i] if: [list] [*] $x_i \in S$ for all $i$, [*] $a_{x_kx_{k+1}} = 1$ for all $k$, where $a_{ij}$ denotes the element in the $i^{\text{th}}$ row and $j^{\text{th}}$ column of $A$. [/list] Prove that the set of strange sequences is empty if and only if $A$ is nilpotent, i.e. $A^m = 0$ for some integer $m$.

Point $P$ lies on the diagonal $AC$ of square $ABCD$ with $AP>CP$. Let $O_1$ and $O_2$ be the circumcenters of triangles $ABP$ and $CDP$ respectively. Given that $AB=12$ and $\angle O_1 P O_2 = 120^\circ$, then $AP=\sqrt{a}+\sqrt{b}$ where $a$ and $b$ are positive integers. Find $a+b$.

If $x$ is a positive rational number show that $x$ can be uniquely expressed in the form $x = \sum^n_{k=1} \frac{a_k}{k!}$ where $a_1, a_2, \ldots$ are integers, $0 \leq a_n \leq n - 1$, for $n > 1,$ and the series terminates. Show that $x$ can be expressed as the sum of reciprocals of different integers, each of which is greater than $10^6.$

Suppose $S= \{1,2,\dots,n\}$ and $n \geq 3$. There is $f:S^k \longmapsto S$ that if $a,b \in S^k$ and $a$ and $b$ differ in all of elements then $f(a) \neq f(b)$. Prove that $f$ is a function of one of its elements.

Evaluate the sum $$\sum_{n=0}^\infty\operatorname{arctan}\left(\frac1{1+n+n^2}\right).$$

Let $X$ be a point on the segment $[BC]$ of an equilateral triangle $ABC$ and let $Y$ and $Z$ be points on the rays $[BA$ and $[CA$ such that the lines $AX, BZ, CY$ are parallel. If the intersection of $XY$ and $AC$ is $M$ and the intersection of $XZ$ and $AB$ is $N$, prove that $MN$ is tangent to the incenter of $ABC$.

There are $2015$ points on a plane and no two distances between them are equal. We call the closest $22$ points to a point its $neighbours$. If $k$ points share the same neighbour, what is the maximum value of $k$?

Let $ABC$ be an acute triangle with $\angle B > \angle C$. On the circle $\mathcal{C}(O, R)$ circumscribed to this triangle points $D, E, J, K, S$ are chosen such that $A, E, J$ and $K$ are on the same side of the line $BC$, the diameter $DE$ is perpendicular on the chord $BC$, $S\in \overarc{EK},\overarc{AE}=\overarc{BJ}=\overarc{CK}=\dfrac{1}{4}\overarc{CE}$ . Let $\{F\}=AC\cap DE, \{M\}=BK\cap AD, \{P\}=BK\cap AC$ and $\{Q\}=CJ\cap BF$. If $\angle SMK =30^{\circ}$ and $\angle AQP = 90^{\circ}$, show that the line $MS$ is tangent to the circumscribed circle of triangle $AOF$.

Consider a $100 \times 100$ table, and identify the cell in row $a$ and column $b$, $1 \leq a, b \leq 100$, with the ordered pair $(a, b)$. Let $k$ be an integer such that $51 \leq k \leq 99$. A $k$-knight is a piece that moves one cell vertically or horizontally and $k$ cells to the other direction; that is, it moves from $(a, b)$ to $(c, d)$ such that $(|a-c|, |b - d|)$ is either $(1, k)$ or $(k, 1)$. The $k$-knight starts at cell $(1, 1)$, and performs several moves. A sequence of moves is a sequence of cells $(x_0, y_0)= (1, 1)$, $(x_1, y_1), (x_2, y_2)$, $\ldots, (x_n, y_n)$ such that, for all $i = 1, 2, \ldots, n$, $1 \leq x_i , y_i \leq 100$ and the $k$-knight can move from $(x_{i-1}, y_{i-1})$ to $(x_i, y_i)$. In this case, each cell $(x_i, y_i)$ is said to be reachable. For each $k$, find $L(k)$, the number of reachable cells.

Mr. Murgatroyd decides to throw his class a pizza party, but he's going to make them hunt for it first. He chooses eleven locations in the school, which we'll call $1, 2, \ldots, 11$. His plan is to tell students to start at location $1$, and at each location $n$ from $1$ to $10$, they will find a message directing them to go to location $n+1$; at location $11$, there's pizza! Mr. Murgatroyd sends his teaching assistant to post the ten messages in locations $1$ to $10$. Unfortunately, the assistant jumbles up the message cards at random before posting them. If the students begin at location $1$ as planned and follow the directions at each location, show that they will still get to the pizza.

Suppose two circles $\Omega_1$ and $\Omega_2$ with centers $O_1$ and $O_2$ have radii $3$ and $4$, respectively. Suppose that points $A$ and $B$ lie on circles $\Omega_1$ and $\Omega_2$, respectively, such that segments $AB$ and $O_1O_2$ intersect and that $AB$ is tangent to $\Omega_1$ and $\Omega_2$. If $O_1O_2=25$, find the area of quadrilateral $O_1AO_2B$. [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */ import graph; size(12cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -12.81977592804657, xmax = 32.13023014338037, ymin = -14.185056097058798, ymax = 12.56855801985179; /* image dimensions */ /* draw figures */ draw(circle((-3.4277328104418046,-1.4524996726688195), 3), linewidth(1.2)); draw(circle((21.572267189558197,-1.4524996726688195), 4), linewidth(1.2)); draw((-2.5877328104418034,1.4275003273311748)--(20.452267189558192,-5.2924996726687885), linewidth(1.2)); /* dots and labels */ dot((-3.4277328104418046,-1.4524996726688195),linewidth(3pt) + dotstyle); label("$O_1$", (-4.252707018231291,-1.545940604327141), N * labelscalefactor); dot((21.572267189558197,-1.4524996726688195),linewidth(3pt) + dotstyle); label("$O_2$", (21.704189347819636,-1.250863978037686), NE * labelscalefactor); dot((-2.5877328104418034,1.4275003273311748),linewidth(3pt) + dotstyle); label("$A$", (-2.3937351324858342,1.6999022848568643), NE * labelscalefactor); dot((20.452267189558192,-5.2924996726687885),linewidth(3pt) + dotstyle); label("$B$", (20.671421155806545,-4.9885012443707835), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] [i]Proposed by Deyuan Li and Andrew Milas[/i]

The edges of $K_{2017}$ are each labeled with $1,2,$ or $3$ such that any triangle has sum of labels at least $5.$ Determine the minimum possible average of all $\dbinom{2017}{2}$ labels. (Here $K_{2017}$ is defined as the complete graph on 2017 vertices, with an edge between every pair of vertices.) [i]Proposed by Michael Ma[/i]

Camilla had twice as many blueberry jelly beans as cherry jelly beans. After eating $10$ pieces of each kind, she now has three times as many blueberry jelly beans as cherry jelly beans. How many blueberry jelly beans did she originally have? $\textbf{(A) } 10\qquad \textbf{(B) } 20\qquad \textbf{(C) } 30\qquad \textbf{(D) } 40\qquad \textbf{(E) } 50$

Given a (not necessarily regular) tetrahedron, all of its sides are equal in area. Prove that the following points then coincide: a) the center of the inscribed sphere, i.e. all four side surfaces internally touching sphere, b) the center of the surrounding sphere, i.e. the sphere passing through the four vertixes.

Show that among any five points $ P_1,...,P_5$ with integer coordinates in the plane, there exists at least one pair $ (P_i,P_j)$, with $ i \not\equal{} j$ such that the segment $ P_i P_j$ contains a point $ Q$ with integer coordinates other than $ P_i, P_j$.

Find all triples $(a, b, c)$ of positive integers such that: $$a + b + c = 24$$ $$a^2 + b^2 + c^2 = 210$$ $$abc = 440$$

Evaluate $\frac{\frac{1}{\frac{1}{10} - \frac{1}{12}}}{\frac{1}{\frac{1}{8} - \frac{1}{6}} + \frac{1}{\frac{1}{5} - \frac{1}{6}}}$.

Find all four digit positive integers such that the sum of the squares of the digits equals twice the sum of the digits.

[hide=R stands for Ramanujan , P stands for Pascal]they had two problem sets under those two names[/hide] [u] Set 1[/u] [b]R1.1 / P1.1[/b] Find $291 + 503 - 91 + 492 - 103 - 392$. [b]R1.2[/b] Let the operation $a$ & $b$ be defined to be $\frac{a-b}{a+b}$. What is $3$ & $-2$? [b]R1.3[/b]. Joe can trade $5$ apples for $3$ oranges, and trade $6$ oranges for $5$ bananas. If he has $20$ apples, what is the largest number of bananas he can trade for? [b]R1.4[/b] A cone has a base with radius $3$ and a height of $5$. What is its volume? Express your answer in terms of $\pi$. [b]R1.5[/b] Guang brought dumplings to school for lunch, but by the time his lunch period comes around, he only has two dumplings left! He tries to remember what happened to the dumplings. He first traded $\frac34$ of his dumplings for Arman’s samosas, then he gave $3$ dumplings to Anish, and lastly he gave David $\frac12$ of the dumplings he had left. How many dumplings did Guang bring to school? [u]Set 2[/u] [b]R2.6 / P1.3[/b] In the recording studio, Kanye has $10$ different beats, $9$ different manuscripts, and 8 different samples. If he must choose $1$ beat, $1$ manuscript, and $1$ sample for his new song, how many selections can he make? [b]R2.7[/b] How many lines of symmetry does a regular dodecagon (a polygon with $12$ sides) have? [b]R2.8[/b] Let there be numbers $a, b, c$ such that $ab = 3$ and $abc = 9$. What is the value of $c$? [b]R2.9[/b] How many odd composite numbers are there between $1$ and $20$? [b]R2.10[/b] Consider the line given by the equation $3x - 5y = 2$. David is looking at another line of the form ax - 15y = 5, where a is a real number. What is the value of a such that the two lines do not intersect at any point? [u]Set 3[/u] [b]R3.11[/b] Let $ABCD$ be a rectangle such that $AB = 4$ and $BC = 3$. What is the length of BD? [b]R3.12[/b] Daniel is walking at a constant rate on a $100$-meter long moving walkway. The walkway moves at $3$ m/s. If it takes Daniel $20$ seconds to traverse the walkway, find his walking speed (excluding the speed of the walkway) in m/s. [b]R3.13 / P1.3[/b] Pratik has a $6$ sided die with the numbers $1, 2, 3, 4, 6$, and $12$ on the faces. He rolls the die twice and records the two numbers that turn up on top. What is the probability that the product of the two numbers is less than or equal to $12$? [b]R3.14 / P1.5[/b] Find the two-digit number such that the sum of its digits is twice the product of its digits. [b]R3.15[/b] If $a^2 + 2a = 120$, what is the value of $2a^2 + 4a + 1$? PS. You should use hide for answers. R16-30 /P6-10/ P26-30 have been posted [url=https://artofproblemsolving.com/community/c3h2786837p24497019]here[/url], and P11-25 [url=https://artofproblemsolving.com/community/c3h2786880p24497350]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ n$ be an even positive integer. Prove that there exists a positive inter $ k$ such that \[ k \equal{} f(x) \cdot (x\plus{}1)^n \plus{} g(x) \cdot (x^n \plus{} 1)\] for some polynomials $ f(x), g(x)$ having integer coefficients. If $ k_0$ denotes the least such $ k,$ determine $ k_0$ as a function of $ n,$ i.e. show that $ k_0 \equal{} 2^q$ where $ q$ is the odd integer determined by $ n \equal{} q \cdot 2^r, r \in \mathbb{N}.$ Note: This is variant A6' of the three variants given for this problem.