DeAndre Jordan shoots free throws that are worth $1$ point each. He makes $40\%$ of his shots. If he takes two shots find the probability that he scores at least $1$ point.

The incircle of $\triangle{ABC}$ touches $BC$, $CA$, $AB$ at $D$, $E$, $F$, respectively. Point $P$ is chosen on $EF$ such that $AP$ is parallel to $BC$, and $AD$ intersects the incircle of $\triangle{ABC}$ again at $G$. Show that $\angle AGP = 90^{\circ}$.

Given a triangle $ABC$ ($AB> AC$) and a circle circumscribed around it. Construct with a compass and a ruler the midpoint of the arc $BC$ (not containing vertex $A$), with no more than two lines (straight or circles).

(R.Pirkuliev) Prove the inequality \[ \frac1{\sqrt {2\sin A}} \plus{} \frac1{\sqrt {2\sin B}} \plus{} \frac1{\sqrt {2\sin C}}\leq\sqrt {\frac {p}{r}}, \] where $ p$ and $ r$ are the semiperimeter and the inradius of triangle $ ABC$.

What is the sum of all the integers $n$ such that $\left|n-1\right|<\pi$? [i]2016 CCA Math Bonanza Lightning #1.1[/i]

An event occurs many years ago. It occurs periodically in $x$ consecutive years, then there is a break of $y$ consecutive years. We know that the event occured in $1964$, $1986$, $1996$, $2008$ and it didn't occur in $1976$, $1993$, $2006$, $2013$. What is the first year in that the event will occur again?

In $\triangle ABC$ with side lengths $AB=13$, $BC=14$, and $CA=15$, let $M$ be the midpoint of $\overline{BC}$. Let $P$ be the point on the circumcircle of $\triangle ABC$ such that $M$ is on $\overline{AP}$. There exists a unique point $Q$ on segment $\overline{AM}$ such that $\angle PBQ = \angle PCQ$. Then $AQ$ can be written as $\frac{m}{\sqrt{n}}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Find the least possible area of a convex set in the plane that intersects both branches of the hyperbola $ xy\equal{}1$ and both branches of the hyperbola $ xy\equal{}\minus{}1.$ (A set $ S$ in the plane is called [i]convex[/i] if for any two points in $ S$ the line segment connecting them is contained in $ S.$)

At the junction of some countably infinite number of roads sits a greyhound. On one of the roads a hare runs, away from the junction. The only thing known is that the (maximal) speed of the hare is strictly less than the (maximal) speed of the greyhound (but not their precise ratio). Does the greyhound have a strategy for catching the hare in a finite amount of time? ([i]Dan Schwarz[/i])

A Pythagorean triangle is a right triangle whose three sides are integers. The best known example is the triangle with rectangular sides $3$ and $4$ and hypotenuse $5$. Determine all Pythagorean triangles whose area is twice the perimeter.

Find all points on the plane such that the sum of the distances of each of the four lines defined by the unit square of that plane is $4$.

Let $\mathcal{S}_1$ and $\mathcal{S}_2$ be two non-concentric circumferences such that $\mathcal{S}_1$ is inside $\mathcal{S}_2$. Let $K$ be a variable point on $\mathcal{S}_1$. The line tangent to $\mathcal{S}_1$ at point $K$ intersects $\mathcal{S}_2$ at points $A$ and $B$. Let $M$ be the midpoint of arc $AB$ that is in the semiplane determined by $AB$ that does not contain $\mathcal{S}_1$. Determine the locus of the point symmetric to $M$ with respect to $K.$

Let $ABC$ be a given triangle. The circumcircle of the triangle has radius $R$, the incircle has radius $r$, the longest side of the triangle is $a$, while the shortest altitude is $h$. Show that: $\frac{R}{r} > \frac{a}{h}$.

Find coordinates of a set of eight non-collinear planar points so that each has an integral distance from others.

Is it possible to arrange on a circle all composite positive integers not exceeding $ 10^6$, so that no two neighbouring numbers are coprime? [i]Author: L. Emelyanov[/i] [hide="Tuymaada 2008, Junior League, First Day, Problem 2."]Prove that all composite positive integers not exceeding $ 10^6$ may be arranged on a circle so that no two neighbouring numbers are coprime. [/hide]

For a sequence $x_1,x_2,\ldots,x_n$ of real numbers, we define its $\textit{price}$ as \[\max_{1\le i\le n}|x_1+\cdots +x_i|.\] Given $n$ real numbers, Dave and George want to arrange them into a sequence with a low price. Diligent Dave checks all possible ways and finds the minimum possible price $D$. Greedy George, on the other hand, chooses $x_1$ such that $|x_1 |$ is as small as possible; among the remaining numbers, he chooses $x_2$ such that $|x_1 + x_2 |$ is as small as possible, and so on. Thus, in the $i$-th step he chooses $x_i$ among the remaining numbers so as to minimise the value of $|x_1 + x_2 + \cdots x_i |$. In each step, if several numbers provide the same value, George chooses one at random. Finally he gets a sequence with price $G$. Find the least possible constant $c$ such that for every positive integer $n$, for every collection of $n$ real numbers, and for every possible sequence that George might obtain, the resulting values satisfy the inequality $G\le cD$. [i]Proposed by Georgia[/i]