Laszlo went online to shop for black pepper and found thirty different black pepper options varying in weight and price, shown in the scatter plot below. In ounces, what is the weight of the pepper that offers the lowest price per ounce? [asy] //diagram by pog size(8.5cm); usepackage("mathptmx"); defaultpen(mediumgray*0.5+gray*0.5+linewidth(0.63)); add(grid(6,6)); label(scale(0.7)*"$1$", (1,-0.3), black); label(scale(0.7)*"$2$", (2,-0.3), black); label(scale(0.7)*"$3$", (3,-0.3), black); label(scale(0.7)*"$4$", (4,-0.3), black); label(scale(0.7)*"$5$", (5,-0.3), black); label(scale(0.7)*"$1$", (-0.3,1), black); label(scale(0.7)*"$2$", (-0.3,2), black); label(scale(0.7)*"$3$", (-0.3,3), black); label(scale(0.7)*"$4$", (-0.3,4), black); label(scale(0.7)*"$5$", (-0.3,5), black); label(scale(0.75)*rotate(90)*"Price (dollars)", (-1,3.2), black); label(scale(0.75)*"Weight (ounces)", (3.2,-1), black); dot((1,1.2),black); dot((1,1.7),black); dot((1,2),black); dot((1,2.8),black); dot((1.5,2.1),black); dot((1.5,3),black); dot((1.5,3.3),black); dot((1.5,3.75),black); dot((2,2),black); dot((2,2.9),black); dot((2,3),black); dot((2,4),black); dot((2,4.35),black); dot((2,4.8),black); dot((2.5,2.7),black); dot((2.5,3.7),black); dot((2.5,4.2),black); dot((2.5,4.4),black); dot((3,2.5),black); dot((3,3.4),black); dot((3,4.2),black); dot((3.5,3.8),black); dot((3.5,4.5),black); dot((3.5,4.8),black); dot((4,3.9),black); dot((4,5.1),black); dot((4.5,4.75),black); dot((4.5,5),black); dot((5,4.5),black); dot((5,5),black); [/asy] $\textbf{(A)} ~1\qquad\textbf{(B)} ~2\qquad\textbf{(C)} ~3\qquad\textbf{(D)} ~4\qquad\textbf{(E)} ~5\qquad$

The sequence $ (a_n)$ satisfies $ a_0 \equal{} 0$ and $ \displaystyle a_{n \plus{} 1} \equal{} \frac85a_n \plus{} \frac65\sqrt {4^n \minus{} a_n^2}$ for $ n\ge0$. Find the greatest integer less than or equal to $ a_{10}$.

Let $p$ be a prime number of the form $4k+1$. Show that \[\sum^{p-1}_{i=1}\left( \left \lfloor \frac{2i^{2}}{p}\right \rfloor-2\left \lfloor \frac{i^{2}}{p}\right \rfloor \right) = \frac{p-1}{2}.\]

In the diagram below, $\angle B = 43^\circ$ and $\angle D = 102^\circ$. Find $\angle A + \angle B + \angle C + \angle D + \angle E + \angle F$. [NEEDS DIAGRAM]

Given $n>3$ points in the plane such that no three of the points are collinear. Does there exist a circle passing through (at least) $3$ of the given points and not containing any other of the $n$ points in its interior ?

Define [i]glueing[/i] of positive integers as writing their base ten representations one after another and interpreting the result as the base ten representation of a single positive integer. Find all positive integers $k$ for which there exists an integer $N_k$ with the following property: for all $n \ge N_k$, we can glue the numbers $1,2,\dots,n$ in some order so that the result is a number divisible by $k$. [i]Remark[/i]. The base ten representation of a positive integer never starts with zero. [i]Example[/i]. Glueing $15, 14, 7$ in this order makes $15147$.

A triangle has two sides of lengths $1984$ and $2016$. Find the maximum possible area of the triangle. [i]Proposed by Nathan Ramesh

[b]a)[/b] Find the number of infinite sequences of integers $ \left( a_n \right)_{n\ge 1} $ that have the property that $ a_na_{n+2}a_{n+3}=-1, $ for any natural number $ n. $ [b]b)[/b] Prove that there is no infinite sequence of integers $ \left( b_n \right)_{n\ge 1} $ that have the property that $ b_nb_{n+2}b_{n+3}=2005, $ for any natural number $ n. $

Find all functions $f : R \to R$ that satisfy $f((x-y)^2)= f(x)^2 -2x f(y)+y^2$ for all $x,y \in R$

The smallest number greater than 2 that leaves a remainder of 2 when divided by 3, 4, 5, or 6 lies between what numbers? $\textbf{(A)}\hspace{.05in}40\text{ and }50 \qquad \textbf{(B)}\hspace{.05in}51\text{ and }55 \qquad \textbf{(C)}\hspace{.05in}56\text{ and }60 \qquad \textbf{(D)}\hspace{.05in} \text{61 and 65}\qquad \textbf{(E)}\hspace{.05in} \text{66 and 99}$

p1. Nurbaya's rectangular courtyard will be covered by a number of paving blocks in the form of a regular hexagon or its pieces like the picture below. The length of the side of the hexagon is $ 12$ cm. [img]https://cdn.artofproblemsolving.com/attachments/6/1/281345c8ee5b1e80167cc21ad39b825c1d8f7b.png[/img] Installation of other paving blocks or pieces thereof so that all fully covered page surface. To cover the entire surface The courtyard of the house required $603$ paving blocks. How many paving blocks must be cut into models $A, B, C$, and $D$ for the purposes of closing. If $17$ pieces of model $A$ paving blocks are needed, how many the length and width of Nurbaya's yard? Count how much how many pieces of each model $B, C$, and $D$ paving blocks are used. p2. Given the square $PQRS$. If one side lies on the line $y = 2x - 17$ and its two vertices lie on the parabola $y = x^2$, find the maximum area of possible squares $PQRS$ . p3. In the triangular pyramid $T.ABC$, the points $E, F, G$, and $H$ lie at , respectively $AB$, $AC$, $TC$, and $TB$ so that $EA : EB = FA : FC = HB : HT = GC : GT = 2:1$. Determine the ratio of the volumes of the two halves of the divided triangular pyramid by the plane $EFGH$. p4. We know that $x$ is a non-negative integer and $y$ is an integer. Define all pair $(x, y)$ that satisfy $1 + 2^x + 2^{2x + 1} = y^2$. p5. The coach of the Indonesian basketball national team will select the players for become a member of the core team. The coach will judge five players $A, B, C, D$ and $E$ in one simulation (or trial) match with total time $80$ minute match. At any time there is only one in five players that is playing. There is no limit to the number of substitutions during the match. Total playing time for each player $A, B$, and $C$ are multiples of $5$ minutes, while the total playing time of each players $D$ and $E$ are multiples of $7$ minutes. How many ways each player on the field based on total playing time?

A lock has $16$ keys arranged in a $4\times 4$ array, each key oriented either horizontally or vertically. In order to open it, all the keys must be vertically oriented. When a key is switched to another position, all the other keys in the same row and column automatically switch their positions too. Show that no matter what the starting positions are, it is always possible to open this lock. (Only one key at a time can be switched.)

Prove tha number $19 \cdot 8^n +17$ is composite for every positive integer $n$

Compute the remainder when $2^{30}$ is divided by $1000$.

If $x,y,z$ are real numbers satisfying relations \[x+y+z = 1 \quad \textrm{and} \quad \arctan x + \arctan y + \arctan z = \frac{\pi}{4},\] prove that $x^{2n+1} + y^{2n+1} + z^{2n+1} = 1$ holds for all positive integers $n$.

An [i]$n$-folding process[/i] on a rectangular piece of paper with sides aligned vertically and horizontally consists of repeating the following process $n$ times: [list] [*]Take the piece of paper and fold it in half vertically (choosing to either fold the right side over the left, or the left side over the right). [*]Rotate the paper $90^\circ$ clockwise. [/list] A $10$-folding process is performed on a piece of paper, resulting in a $1$-by-$1$ square base consisting of many stacked layers of paper. Let $d(i,j)$ be the Euclidean distance between the center of the $i$th square from the top and the center of the $j$th square from the top when the paper is unfolded. Determine the maximum possible value of $\sum_{i=1}^{1023} d(i, i+1).$

Given a triangle $ABC$ inscribed in circle $c(O,R)$ (with center $O$ and radius $R$) with $AB<AC<BC$ and let $BD$ be a diameter of the circle $c$. The perpendicular bisector of $BD$ intersects line $AC$ at point $M$ and line $AB$ at point $N$. Line $ND$ intersects the circle $c$ at point $T$. Let $S$ be the second intersection point of cicumcircles $c_1$ of triangle $OCM$, and $c_2$ of triangle $OAD$. Prove that lines $AD, CT$ and $OS$ pass through the same point.

Let $a,b$ be two positive integers and $b^2+a-1|a^2+b-1$. Prove that $b^2+a-1$ has at least two prime divisors.

Two circles $C_1$ and $C_2$ are tangent at a point $P$. The straight line at $D$ is tangent at $A$ to one of the circles and cuts the other circle at the points $B$ and $C$. Prove that the straight line $PA$ is a bisector (interior or exterior) of the angle $BPC$.

The normals to a surface all intersect a fixed straight line. Show that the surface is a portion of a surface of revolution.

Let $ S \equal{} \{0,1,2,\ldots,1999\}$ and $ T \equal{} \{0,1,2,\ldots \}.$ Find all functions $ f: T \mapsto S$ such that [b](i)[/b] $ f(s) \equal{} s \quad \forall s \in S.$ [b](ii)[/b] $ f(m\plus{}n) \equal{} f(f(m)\plus{}f(n)) \quad \forall m,n \in T.$

Aaron has a coin that is slightly unbalanced. The odds of getting heads are $60\%$. What are the odds that if he flips it endlessly, at some point during his flipping he has a total of three more tails than heads?

Two triangles are said to be [i]twins [/i] if one of them is an image of the other one under a parallel projection. Prove that two triangles are twins if and only if either at least a side of one of them equals a side of another or both the triangles have equal segments that connect the corresponding vertices with some points on the opposite sides which divide these sides in the same ratio. (E. Barabanov)

There are $n$ circles drawn on a piece of paper in such a way that any two circles intersect in two points, and no three circles pass through the same point. Turbo the snail slides along the circles in the following fashion. Initially he moves on one of the circles in clockwise direction. Turbo always keeps sliding along the current circle until he reaches an intersection with another circle. Then he continues his journey on this new circle and also changes the direction of moving, i.e. from clockwise to anticlockwise or $\textit{vice versa}$. Suppose that Turbo’s path entirely covers all circles. Prove that $n$ must be odd. [i]Proposed by Tejaswi Navilarekallu, India[/i]

Let $ \left( c_n \right)_{n\ge 1} $ be a sequence of real numbers. Prove that the sequences $ \left( c_n\sin n \right)_{n\ge 1} ,\left( c_n\cos n \right)_{n\ge 1} $ are both convergent if and only if $ \left( c_n \right)_{n\ge 1} $ converges to $ 0. $ [i]Mihai Piticari[/i] and [i]Vladimir Cerbu[/i]