A lattice point in an $xy$-coordinate system is any point $(x,y)$ where both $x$ and $y$ are integers. The graph of $y=mx+2$ passes through no lattice point with $0<x \le 100$ for all $m$ such that $\frac{1}{2}<m<a$. What is the maximum possible value of $a$? $ \textbf{(A)}\ \frac{51}{101} \qquad \textbf{(B)}\ \frac{50}{99} \qquad \textbf{(C)}\ \frac{51}{100} \qquad \textbf{(D)}\ \frac{52}{101} \qquad \textbf{(E)}\ \frac{13}{25} $

Fix an integer $n \ge 2$, let $Q_n$ be the graph consisting of all vertices and all edges of an $n$-cube, and let $T$ be a spanning tree in $Q_n$. Show that $Q_n$ has an edge whose adjunction to $T$ produces a simple cycle of length at least $2n$.

Around a circular table sit $12$ people, and on the table there are $28$ vases. Two people can see each other, if and only if there is no vase lined with them. Prove that there are at least two people who can be seen.

[b]p1.[/b] Given that $7 \times 22 \times 13 = 2002$, compute $14 \times 11 \times 39$. [b]p2.[/b] Ariel the frog is on the top left square of a $8 \times 10$ grid of squares. Ariel can jump from any square on the grid to any adjacent square, including diagonally adjacent squares. What is the minimum number of jumps required so that Ariel reaches the bottom right corner? [b]p3.[/b] The distance between two floors in a building is the vertical distance from the bottom of one floor to the bottom of the other. In Evans hall, the distance from floor $7$ to floor $5$ is $30$ meters. There are $12$ floors on Evans hall and the distance between any two consecutive floors is the same. What is the distance, in meters, from the first floor of Evans hall to the $12$th floor of Evans hall? [b]p4.[/b] A circle of nonzero radius $ r$ has a circumference numerically equal to $\frac13$ of its area. What is its area? [b]p5.[/b] As an afternoon activity, Emilia will either play exactly two of four games (TwoWeeks, DigBuild, BelowSaga, and FlameSymbol) or work on homework for exactly one of three classes (CS61A, Math 1B, Anthro 3AC). How many choices of afternoon activities does Emilia have? [b]p6.[/b] Matthew wants to buy merchandise of his favorite show, Fortune Concave Decagon. He wants to buy figurines of the characters in the show, but he only has $30$ dollars to spend. If he can buy $2$ figurines for $4$ dollars and $5$ figurines for $8$ dollars, what is the maximum number of figurines that Matthew can buy? [b]p7.[/b] When Dylan is one mile from his house, a robber steals his wallet and starts to ride his motorcycle in the direction opposite from Dylan’s house at $40$ miles per hour. Dylan dashes home at $10$ miles per hour and, upon reaching his house, begins driving his car at $60$ miles per hour in the direction of the robber’s motorcycle. How long, starting from when the robber steals the wallet, does it take for Dylan to catch the robber? Express your answer in minutes. [b]p8.[/b] Deepak the Dog is tied with a leash of $7$ meters to a corner of his $4$ meter by $6$ meter rectangular shed such that Deepak is outside the shed. Deepak cannot go inside the shed, and the leash cannot go through the shed. Compute the area of the region that Deepak can travel to. [img]https://cdn.artofproblemsolving.com/attachments/f/8/1b9563776325e4e200c3a6d31886f4020b63fa.png[/img] [b]p9.[/b] The quadratic equation $a^2x^2 + 2ax -3 = 0$ has two solutions for x that differ by $a$, where $a > 0$. What is the value of $a$? [b]p10.[/b] Find the number of ways to color a $2 \times 2$ grid of squares with $4$ colors such that no two (nondiagonally) adjacent squares have the same color. Each square should be colored entirely with one color. Colorings that are rotations or reflections of each other should be considered different. [b]p11[/b]. Given that $\frac{1}{y^2+5} - \frac{3}{y^4-39} = 0$, and $y \ge 0$, compute $y$. [b]p12.[/b] Right triangle $ABC$ has $AB = 5$, $BC = 12$, and $CA = 13$. Point $D$ lies on the angle bisector of $\angle BAC$ such that $CD$ is parallel to $AB$. Compute the length of $BD$. [img]https://cdn.artofproblemsolving.com/attachments/c/3/d5cddb0e8ac43c35ddfc94b2a74b8d022292f2.png[/img] [b]p13.[/b] Let $x$ and $y$ be real numbers such that $xy = 4$ and $x^2y + xy^2 = 25$. Find the value of $x^3y +x^2y^2 + xy^3$. [b]p14.[/b] Shivani is planning a road trip in a car with special new tires made of solid rubber. Her tires are cylinders that are $6$ inches in width and have diameter $26$ inches, but need to be replaced when the diameter is less than $22$ inches. The tire manufacturer says that $0.12\pi$ cubic inches will wear away with every single rotation. Assuming that the tire manufacturer is correct about the wear rate of their tires, and that the tire maintains its cylindrical shape and width (losing volume by reducing radius), how many revolutions can each tire make before she needs to replace it? [b]p15.[/b] What’s the maximum number of circles of radius $4$ that fit into a $24 \times 15$ rectangle without overlap? [b]p16.[/b] Let $a_i$ for $1 \le i \le 10$ be a finite sequence of $10$ integers such that for all odd $i$, $a_i = 1$ or $-1$, and for all even $i$, $a_i = 1$, $-1$, or $0$. How many sequences a_i exist such that $a_1+a_2+a_3+...+a_{10} = 0$? [b]p17.[/b] Let $\vartriangle ABC$ be a right triangle with $\angle B = 90^o$ such that $AB$ and $BC$ have integer side lengths. Squares $ABDE$ and $BCFG$ lie outside $\vartriangle ABC$. If the area of $\vartriangle ABC$ is $12$, and the area of quadrilateral $DEFG$ is $38$, compute the perimeter of $\vartriangle ABC$. [img]https://cdn.artofproblemsolving.com/attachments/b/6/980d3ba7d0b43507856e581476e8ad91886656.png[/img] [b]p18.[/b] What is the smallest positive integer $x$ such that there exists an integer $y$ with $\sqrt{x} +\sqrt{y} = \sqrt{1025}$ ? [b]p19. [/b]Let $a =\underbrace{19191919...1919}_{19\,\, is\,\,repeated\,\, 3838\,\, times}$. What is the remainder when $a$ is divided by $13$? [b]p20.[/b] James is watching a movie at the cinema. The screen is on a wall and is $5$ meters tall with the bottom edge of the screen $1.5$ meters above the floor. The floor is sloped downwards at $15$ degrees towards the screen. James wants to find a seat which maximizes his vertical viewing angle (depicted below as $\theta$ in a two dimensional cross section), which is the angle subtended by the top and bottom edges of the screen. How far back from the screen in meters (measured along the floor) should he sit in order to maximize his vertical viewing angle? [img]https://cdn.artofproblemsolving.com/attachments/1/5/1555fb2432ee4fe4903accc3b74ea7215bc007.png[/img] PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $x+y=a$ and $xy=b$. Calculate exression $ x^4+y^4$ in terms of $a$ and $b$.

Let $n$ be a positive integer. Show that $${2n+1 \choose 1} -{2n+1 \choose 3}2008 + {2n+1 \choose 5}2008^2- ...+(-1)^{n}{2n+1 \choose 2n+1}2008^n $$ is not divisible by $19$.

Jack is jumping on the number line. He first jumps one unit and every jump after that he jumps one unit more than the previous jump. What is the least amount of jumps it takes to reach exactly $19999$ from his starting place? [i]2017 CCA Math Bonanza Lightning Round #2.3[/i]

A not necessary nonplanar polygon in $\mathbb{R}^3$ is called [b]Grid Polygon[/b] if each of it's edges are parallel to one of the axes. (a) There's a right angle between each two neighbour sides of the grid polygon, the plane containing this angle could be parallel to either $xy$ plane, $yz$ plane, or $xz$ plane. Prove that parity of the number of the angles that the plane containing each of them is parallel to $xy$ plane is equal to parity of the number of the angles that the plane containing each of them is parallel to $yz$ plane and parity of the number of the angles that the plane containing each of them is parallel to $zx$ plane. (b) A grid polygon is called [b]Inscribed[/b] if there's a point in the space that has an equal distance from all of the vertices of the polygon. Prove that any nonplanar grid hexagon is inscribed. (c) Does there exist a grid 2014-gon without repeated vertices such that there exists a plane that intersects all of it's edges? (d) If $a,b,c \in \mathbb{N}-\{1\}$, prove that $a,b,c$ are sidelengths of a triangle iff there exists a grid polygon in which the number of it's edges that are parallel to $x$ axis is $a$, the number of it's edges that are parallel to $y$ axis is $b$ and the number of it's edges that are parallel to $z$ axis is $c$. Time allowed for this exam was 1 hour.

Let $ N \equal{} \{1,2 \ldots, n\}, n \geq 2.$ A collection $ F \equal{} \{A_1, \ldots, A_t\}$ of subsets $ A_i \subseteq N,$ $ i \equal{} 1, \ldots, t,$ is said to be separating, if for every pair $ \{x,y\} \subseteq N,$ there is a set $ A_i \in F$ so that $ A_i \cap \{x,y\}$ contains just one element. $ F$ is said to be covering, if every element of $ N$ is contained in at least one set $ A_i \in F.$ What is the smallest value $ f(n)$ of $ t,$ so there is a set $ F \equal{} \{A_1, \ldots, A_t\}$ which is simultaneously separating and covering?

The players on a basketball team made some three-point shots, some two-point shots, and some one-point free throws. They scored as many points with two-point shots as with three-point shots. Their number of successful free throws was one more than their number of successful two-point shots. The team's total score was 61 points. How many free throws did they make? $\textbf{(A)}\,13 \qquad\textbf{(B)}\,14 \qquad\textbf{(C)}\,15 \qquad\textbf{(D)}\,16 \qquad\textbf{(E)}\,17$

Let $n $ be a positive integer. Let $f $ be a function from nonnegative integers to themselves. Let $f (0,i)=f (i,0)=0$, $f (1, 1)=n $, and $ f(i, j)= [\frac {f(i-1,j)}{2}]+ [\frac {f(i, j-1)}{2}] $ for positive integers $i, j$ such that $i*j>1$. Find the number of pairs $(i,j) $ such that $f (i, j) $ is an odd number.( $[x]$ is the floor function).

Arianna and Brianna play a game in which they alternate turns writing numbers on a paper. Before the game begins, a referee randomly selects an integer $N$ with $1 \leq N \leq 2019$, such that $i$ has probability $\frac{i}{1 + 2 + \dots + 2019}$ of being chosen. First, Arianna writes $1$ on the paper. On any move thereafter, the player whose turn it is writes $a+1$ or $2a$, where $a$ is any number on the paper, under the conditions that no number is ever written twice and any number written does not exceed $N$. No number is ever erased. The winner is the person who first writes the number $N$. Assuming both Arianna and Brianna play optimally, the probability that Brianna wins can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Compute $m + n.$ [i]Proposed by Edward Wan[/i]

Prove that there exist a set of $2010$ natural numbers such that product of any $1006 $ numbers is divisible by product of remaining $1004$ numbers.

The numbers $1,2,\dots, 49$ are written on unit squares of a $7\times 7$ chessboard such that consequtive numbers are on unit squares sharing a common edge. At most how many prime numbers can a row have? $ \textbf{(A)}\ 7 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 3 $

Let $m>1$ be a fixed positive integer. For a nonempty string of base-ten digits $S$, let $c(S)$ be the number of ways to split $S$ into contiguous nonempty strings of digits such that the base-ten number represented by each string is divisible by $m$. These strings are allowed to have leading zeroes. In terms of $m$, what are the possible values that $c(S)$ can take? For example, if $m=2$, then $c(1234)=2$ as the splits $1234$ and $12|34$ are valid, while the other six splits are invalid.

Find the largest integer such that every number after the first is one less than the previous one and is divisible by each of its own numbers.