A semicircle has diameter $AB$ with $AB = 100$. Points $C$ and $D$ lie on the semicircle such that $AC = 28$ and $BD = 60$. Find $CD$.

Let $P(x)$ be a quadratic polynomial with real coefficients such that $P(3) = 7$ and \[P(x) = P(0) + P(1)x + P(2)x^2\] for all real $x$. What is $P(-1)$?

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

Evaluate $\int_0^{\infty} \frac{\ln (1+e^{4x})}{e^x}dx.$

Let $G$ be the set of points $(x, y)$ such that $x$ and $y$ are positive integers less than or equal to 6. A [i]magic grid[/i] is an assignment of an integer to each point in $G$ such that, for every square with horizontal and vertical sides and all four vertices in $G$, the sum of the integers assigned to the four vertices is the same as the corresponding sum for any other such square. A magic grid is formed so that the product of all 36 integers is the smallest possible value greater than 1. What is this product?

Consider a function $f(x)=\frac{\sin x}{9+16\sin ^ 2 x}\ \left(0\leq x\leq \frac{\pi}{2}\right).$ Let $a$ be the value of $x$ for which $f(x)$ is maximized. Evaluate $\int_a^{\frac{\pi}{2}} f(x)\ dx.$ [i]2010 Saitama University entrance exam/Mathematics[/i] Last Edited

$ ABCD$ is a convex quadrilateral for which $ AB$ is the longest side. Points $ M$ and $ N$ are located on sides $ AB$ and $ BC$ respectively, so that each of the segments $ AN$ and $ CM$ divides the quadrilateral into two parts of equal area. Prove that the segment $ MN$ bisects the diagonal $ BD$.

A certain type of Bessel function has the form $I(x) = \frac{1}{\pi} \int_0^{\pi}e^{x \cos \theta} d\theta$ for all real $x$. Evaluate $\int_0^{\infty} x I(2x) e^{-x^2}dx$.

Let $n\ge 3$ be an integer. In a country there are $n$ airports and $n$ airlines operating two-way flights. For each airline, there is an odd integer $m\ge 3$, and $m$ distinct airports $c_1, \dots, c_m$, where the flights offered by the airline are exactly those between the following pairs of airports: $c_1$ and $c_2$; $c_2$ and $c_3$; $\dots$ ; $c_{m-1}$ and $c_m$; $c_m$ and $c_1$. Prove that there is a closed route consisting of an odd number of flights where no two flights are operated by the same airline.

There are $14$ students who have particiated to a $3$ hour test consisting on $15$ short problems. Each student has solved a different number of problems and each problem has been solved by a different number of students. Prove that there exists a student who has solved exactly $5$ problems.

When a student multiplied the number $66$ by the repeating decimal, $$1. \underline{a} \underline{b} \underline{a} \underline{b} … = 1.\overline{ab},$$ where $a$ and $b$ are digits, he did not notice the notation and just multiplied $66$ times $1. \underline{a} \underline{b}.$ Later he found that his answer is $0.5$ less than the correct answer. What is the $2$- digit integer $\underline{a} \underline{b}$? $\textbf{(A)}\ 15 \qquad\textbf{(B)}\ 30 \qquad\textbf{(C)}\ 45 \qquad\textbf{(D)}\ 60 \qquad\textbf{(E)}\ 75$

[b]i)[/b] Let $0<a<b$.Prove that amongst all triangles having base $a$ and perimeter $a+b$ the triangle having two sides(other than the base) equal to $\frac {b}{2}$ has the maximum area. [b]ii)[/b]Using $i)$ or otherwise, prove that amongst all quadrilateral having give perimeter the square has the maximum area.

Find all couples of natural numbers $(a,b)$ not relatively prime ($\gcd(a,b)\neq\ 1$) such that \[\gcd(a,b)+9\operatorname{lcm}[a,b]+9(a+b)=7ab.\]

Assuming that $f(x)$ is continuous in the interval $(0,1)$, prove that $$\int_{x=0}^{x=1} \int_{y=x}^{y=1} \int_{z=x}^{z=y} f(x)f(y)f(z)\;dz dy dx= \frac{1}{6}\left(\int_{0}^{1} f(t)\; dt\right)^{3}.$$

Suppose that $n$ is a natural number. we call the sequence $(x_1,y_1,z_1,t_1),(x_2,y_2,z_2,t_2),.....,(x_s,y_s,z_s,t_s)$ of $\mathbb Z^4$ [b]good[/b] if it satisfies these three conditions: [b]i)[/b] $x_1=y_1=z_1=t_1=0$. [b]ii)[/b] the sequences $x_i,y_i,z_i,t_i$ be strictly increasing. [b]iii)[/b] $x_s+y_s+z_s+t_s=n$. (note that $s$ may vary). Find the number of good sequences. [i]proposed by Mohammad Ghiasi[/i]

During Christmas party Santa handed out to the children $47$ chocolates and $74$ marmalades. Each girl got $1$ more chocolate than each boy but each boy got $1$ more marmalade than each girl. What was the number of the children?

$\boxed{\text{A2}}$ Find the maximum value of $|\sqrt{x^2+4x+8}-\sqrt{x^2+8x+17}|$ where $x$ is a real number.

Let $z_0+z_1+z_2+\cdots$ be an infinite complex geometric series such that $z_0=1$ and $z_{2013}=\dfrac 1{2013^{2013}}$. Find the sum of all possible sums of this series.

Let be four functions $ f,g,s,i:\mathbb{N}\longrightarrow\mathbb{N} $ such that $ s(x)=\max (f(x),g(x)) $ and $ i(x)=\min (f(x),g(x)) , $ for any natural number $ x. $ Prove that $ f=g $ if $ s $ is surjective and $ i $ injective.

Prove that $ \forall n\in\mathbb{N}$,$ \exists a,b,c\in$$\bigcup_{k\in\mathbb{N}}(k^{2},k^{2}+k+3\sqrt 3) $ such that $n=\frac{ab}{c}$.

For some integer $n > 0$, a square paper of side length $2^{n}$ is repeatedly folded in half, right-to-left then bottom-to-top, until a square of side length 1 is formed. A hole is then drilled into the square at a point $\tfrac{3}{16}$ from the top and left edges, and then the paper is completely unfolded. The holes in the unfolded paper form a rectangular array of unevenly spaced points; when connected with horizontal and vertical line segments, these points form a grid of squares and rectangles. Let $P$ be a point chosen randomly from \textit{inside} this grid. Suppose the largest $L$ such that, for all $n$, the probability that the four segments $P$ is bounded by form a square is at least $L$ can be written in the form $\tfrac mn$ where $m$ and $n$ are positive relatively prime integers. Find $m+n$.

In a village, the maximum distance between two houses is $M$ and the minimum distance is $m$. Prove that if the village has $6$ houses, then $\frac{M}{m} \ge \sqrt3$.

The figure shows a triangular pool table with sides $a$, $b$ and $c$. Located at point $S$ on $c$ a sphere - which can be assumed as a point. After kick-off, as indicated in the figure, it runs through as a result of reflections to $a, b, a, b$ and $c$ (in $S$) always the same track. The reflection occurs according to law of reflection. Characterize entilrely all triangles $ABC$, which allow such an orbit, and determine the locus of $S$. [img]https://cdn.artofproblemsolving.com/attachments/5/b/7662943e5b9ad321226e0c5f5daa3c4ac9faaa.png[/img]

[u]Round 5[/u] [b]p13.[/b] Five different schools are competing in a tournament where each pair of teams plays at most once. Four pairs of teams are randomly selected and play against each other. After these four matches, what is the probability that Chad's and Jordan's respective schools have played against each other, assuming that Chad and Jordan come from different schools? [b]p14.[/b] A square of side length $1$ and a regular hexagon are both circumscribed by the same circle. What is the side length of the hexagon? [b]p15.[/b] From the list of integers $1,2, 3,...,30$ Jordan can pick at least one pair of distinct numbers such that none of the $28$ other numbers are equal to the sum or the difference of this pair. Of all possible such pairs, Jordan chooses the pair with the least sum. Which two numbers does Jordan pick? [u]Round 6[/u] [b]p16.[/b] What is the sum of all two-digit integers with no digit greater than four whose squares also have no digit greater than four? [b]p17.[/b] Chad marks off ten points on a circle. Then, Jordan draws five chords under the following constraints: $\bullet$ Each of the ten points is on exactly one chord. $\bullet$ No two chords intersect. $\bullet$ There do not exist (potentially non-consecutive) points $A, B,C,D,E$, and $F$, in that order around the circle, for which $AB$, $CD$, and $EF$ are all drawn chords. In how many ways can Jordan draw these chords? [b]p18.[/b] Chad is thirsty. He has $109$ cubic centimeters of silicon and a 3D printer with which he can print a cup to drink water in. He wants a silicon cup whose exterior is cubical, with five square faces and an open top, that can hold exactly $234$ cubic centimeters of water when filled to the rim in a rectangular-box-shaped cavity. Using all of his silicon, he prints a such cup whose thickness is the same on the five faces. What is this thickness, in centimeters? [u]Round 7[/u] [b]p19.[/b] Jordan wants to create an equiangular octagon whose side lengths are exactly the first $8$ positive integers, so that each side has a different length. How many such octagons can Jordan create? [b]p20.[/b] There are two positive integers on the blackboard. Chad computes the sum of these two numbers and tells it to Jordan. Jordan then calculates the sum of the greatest common divisor and the least common multiple of the two numbers, and discovers that her result is exactly $3$ times as large as the number Chad told her. What is the smallest possible sum that Chad could have said? [b]p21.[/b] Chad uses yater to measure distances, and knows the conversion factor from yaters to meters precisely. When Jordan asks Chad to convert yaters into meters, Chad only gives Jordan the result rounded to the nearest integer meters. At Jordan's request, Chad converts $5$ yaters into $8$ meters and $7$ yaters into $12$ meters. Given this information, how many possible numbers of meters could Jordan receive from Chad when requesting to convert $2014$ yaters into meters? [u]Round 8[/u] [b]p22.[/b] Jordan places a rectangle inside a triangle with side lengths $13$, $14$, and $15$ so that the vertices of the rectangle all lie on sides of the triangle. What is the maximum possible area of Jordan's rectangle? [b]p23.[/b] Hoping to join Chad and Jordan in the Exeter Space Station, there are $2014$ prospective astronauts of various nationalities. It is given that $1006$ of the astronaut applicants are American and that there are a total of $64$ countries represented among the applicants. The applicants are to group into $1007$ pairs with no pair consisting of two applicants of the same nationality. Over all possible distributions of nationalities, what is the maximum number of possible ways to make the $1007$ pairs of applicants? Express your answer in the form $a \cdot b!$, where $a$ and $b$ are positive integers and $a$ is not divisible by $b + 1$. Note: The expression $k!$ denotes the product $k \cdot (k - 1) \cdot ... \cdot 2 \cdot 1$. [b]p24.[/b] We say a polynomial $P$ in $x$ and $y$ is $n$-[i]good [/i] if $P(x, y) = 0$ for all integers $x$ and $y$, with $x \ne y$, between $1$ and $n$, inclusive. We also define the complexity of a polynomial to be the maximum sum of exponents of $x$ and $y$ across its terms with nonzero coeffcients. What is the minimal complexity of a nonzero $4$-good polynomial? In addition, give an example of a $4$-good polynomial attaining this minimal complexity. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2915803p26040550]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a positive integer $n$. A triangular array $(a_{i,j})$ of zeros and ones, where $i$ and $j$ run through the positive integers such that $i+j\leqslant n+1$ is called a [i]binary anti-Pascal $n$-triangle[/i] if $a_{i,j}+a_{i,j+1}+a_{i+1,j}\equiv 1\pmod{2}$ for all possible values $i$ and $j$ may take on. Determine the minimum number of ones a binary anti-Pascal $n$-triangle may contain.