Each of the twenty dots on the graph below represents one of Sarah's classmates. Classmates who are friends are connected with a line segment. For her birthday party, Sarah is inviting only the following: all of her friends and all of those classmates who are friends with at least one of her friends. How many classmates will not be invited to Sarah's party? [asy]/* AMC8 2003 #18 Problem */ pair a=(102,256), b=(68,131), c=(162,101), d=(134,150); pair e=(269,105), f=(359,104), g=(303,12), h=(579,211); pair i=(534, 342), j=(442,432), k=(374,484), l=(278,501); pair m=(282,411), n=(147,451), o=(103,437), p=(31,373); pair q=(419,175), r=(462,209), s=(477,288), t=(443,358); pair oval=(282,303); draw(l--m--n--cycle); draw(p--oval); draw(o--oval); draw(b--d--oval); draw(c--d--e--oval); draw(e--f--g--h--i--j--oval); draw(k--oval); draw(q--oval); draw(s--oval); draw(r--s--t--oval); dot(a); dot(b); dot(c); dot(d); dot(e); dot(f); dot(g); dot(h); dot(i); dot(j); dot(k); dot(l); dot(m); dot(n); dot(o); dot(p); dot(q); dot(r); dot(s); dot(t); filldraw(yscale(.5)*Circle((282,606),80),white,black); label(scale(0.75)*"Sarah", oval);[/asy] $ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 7$

Find all quadruples \((a,b,c,d)\) of positive integers such that \(\displaystyle \frac{ac+bd}{a+c}\) and \(\displaystyle \frac{bc-ad}{b-d}\) are equal to the prime number \(90121\).

Suppose $a$ and $b$ are single-digit positive integers chosen independently and at random. What is the probability that the point $(a,b)$ lies above the parabola $y=ax^2-bx$? $ \textbf{(A)}\ \frac{11}{81} \qquad \textbf{(B)}\ \frac{13}{81} \qquad \textbf{(C)}\ \frac{5}{27} \qquad \textbf{(D)}\ \frac{17}{81} \qquad \textbf{(E)}\ \frac{19}{81} $

Two countries ($A$ and $B$) organize a conference, and they send an equal number of participants. Some of them have known each other from a previous conference. Prove that one can choose a nonempty subset $C$ of the participants from $A$ such that one of the following holds: [list][*]the participants from $B$ each know an even number of people in $C$, [*]the participants from $B$ each know an odd number of participants in $C$.[/list]

Let $p$ be a prime. We arrange the numbers in ${\{1,2,\ldots ,p^2} \}$ as a $p \times p$ matrix $A = ( a_{ij} )$. Next we can select any row or column and add $1$ to every number in it, or subtract $1$ from every number in it. We call the arrangement [i]good[/i] if we can change every number of the matrix to $0$ in a finite number of such moves. How many good arrangements are there?

The sequence $\{u_n\}$ is defined by $u_1 = 1, u_2 = 1, u_n = u_{n-1} + 2u_{n-2} for n \geq 3$. Prove that for any positive integers $n, p \ (p > 1), u_{n+p} = u_{n+1}u_{p} + 2u_nu_{p-1}$. Also find the greatest common divisor of $u_n$ and $u_{n+3}.$

Find the largest value for $\frac{y}{x}$ for pairs of real numbers $(x,y)$ which satisfy \[(x-3)^2 + (y-3)^2 = 6.\] $\textbf{(A) }3 + 2 \sqrt 2\qquad \textbf{(B) } 2 + \sqrt 3\qquad \textbf{(C ) }3 \sqrt 3\qquad \textbf{(D) }6\qquad \textbf{(E) }6 + 2 \sqrt 3$

In parallellogram $ABCD$, on the arc $BC$ of the circumcircle $(ABC)$, not containing the point $A$, we take a point $P$ and on the $[AC$, we take a point $Q$ such that $\angle PBC= \angle CDQ$. Prove that $(APQ)$ is tangent to $AB$.

Let $ABCDE$ be a convex pentagon such that $AB = BC = CD$ and $\angle BDE = \angle EAC = 30 ^{\circ}$. Find the possible values of $\angle BEC$. [i]Proposed by Josef Tkadlec (Czech Republic)[/i]

Let $A=1,B=2,\ldots,Z=26$. Compute $BONANZA$, where the result is the product of the numbers represented by each letter. [i]2018 CCA Math Bonanza Lightning Round #1.1[/i]

Let $ABC$ be an acute triangle with circumcircle $\Omega$. Let $B_0$ be the midpoint of $AC$ and let $C_0$ be the midpoint of $AB$. Let $D$ be the foot of the altitude from $A$ and let $G$ be the centroid of the triangle $ABC$. Let $\omega$ be a circle through $B_0$ and $C_0$ that is tangent to the circle $\Omega$ at a point $X\not= A$. Prove that the points $D,G$ and $X$ are collinear. [i]Proposed by Ismail Isaev and Mikhail Isaev, Russia[/i]

A positive integer \(n\) is called perfect if the sum of its positive divisors \(\sigma(n)\) is twice \(n\), that is, \(\sigma(n) = 2n\). For example, \(6\) is a perfect number since the sum of its positive divisors is \(1 + 2 + 3 + 6 = 12\), which is twice \(6\). Prove that if \(n\) is a positive perfect integer, then: \[ \sum_{p|n} \frac{1}{p + 1} < \ln 2 < \sum_{p|n} \frac{1}{p - 1} \] where the sums are taken over all prime divisors \(p\) of \(n\).

Find all ordered 6-tuples satisfy following system of modular equation: $ab+a'b' \equiv 1 $(mod 15) $bc+b'c' \equiv 1 $(mod 15) $ca+c'a' \equiv 1 $(mod 15) Given that $a,b,c,a',b',c' \epsilon (0;1;2;...;14)$

In triangle $ABC$, let $O$ be the circumcenter. The incircle of $ABC$ is tangent to $\overline{BC}$, $\overline{CA},$ and $\overline{AB}$ at points $D, E$, and $F$, respectively. Let $G$ be the centroid of triangle $DEF$. Suppose the inradius and circumradius of $ABC$ is $3$ and $8$, respectively. Over all such triangles $ABC$, pick one that maximizes the area of triangle $AGO$. If we write $AG^2 =\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, then find $m$.

Let $ \sigma(\cdot): \mathbb{N}_0 \to \mathbb{N}_0$ be the function from every positive integer $ n$ to the sum of divisors $ \sum_{d \mid n}{d}$ (i.e. $ \sigma(6) \equal{} 6 \plus{} 3 \plus{} 2 \plus{} 1$ and $ \sigma(8) \equal{} 8 \plus{} 4 \plus{} 2 \plus{} 1$). Find all primes $ p$ such that $ p \mid \sigma(p \minus{} 1)$. [i](Salvatore Tringali)[/i]

Let n be a non-negative integer. Define the [i]decimal digit product[/i] \(D(n)\) inductively as follows: - If \(n\) has a single decimal digit, then let \(D(n) = n\). - Otherwise let \(D(n) = D(m)\), where \(m\) is the product of the decimal digits of \(n\). Let \(P_k(1)\) be the probability that \(D(i) = 1\) where \(i\) is chosen uniformly randomly from the set of integers between 1 and \(k\) (inclusive) whose decimal digit products are not 0. Compute \(\displaystyle\lim_{k\to\infty} P_k(1)\). [i]proposed by the ICMC Problem Committee[/i]

A polynomial of degree four with leading coefficient 1 and integer coefficients has two zeros, both of which are integers. Which of the following can also be a zero of the polynomial? $ \textbf{(A)} \ \frac {1 \plus{} i \sqrt {11}}{2} \qquad \textbf{(B)} \ \frac {1 \plus{} i}{2} \qquad \textbf{(C)} \ \frac {1}{2} \plus{} i \qquad \textbf{(D)} \ 1 \plus{} \frac {i}{2} \qquad \textbf{(E)} \ \frac {1 \plus{} i \sqrt {13}}{2}$

Let $A$ be a point in the plane, and $\ell$ a line not passing through $A$. Evan does not have a straightedge, but instead has a special compass which has the ability to draw a circle through three distinct noncollinear points. (The center of the circle is [i]not[/i] marked in this process.) Additionally, Evan can mark the intersections between two objects drawn, and can mark an arbitrary point on a given object or on the plane. (i) Can Evan construct* the reflection of $A$ over $\ell$? (ii) Can Evan construct the foot of the altitude from $A$ to $\ell$? *To construct a point, Evan must have an algorithm which marks the point in finitely many steps. [i]Proposed by Zack Chroman[/i]

Let be an $ n\times n $ positive-definite symmetric real matrix $ A. $ Prove the following equality. $$ \tiny\int_{\mathbb{R}^n} \exp\left( -\begin{pmatrix} x_1\\ x_2\\ \vdots \\ x_n\end{pmatrix}^\intercal A\begin{pmatrix} x_1\\ x_2\\ \vdots \\ x_n\end{pmatrix}\right) dx_1dx_2\cdots dx_n=\normalsize\frac{\pi^{n/2}}{\sqrt{\det A} } $$

In rectangle $ABCD$, $AB=1$, $BC=2$, and points $E$, $F$, and $G$ are midpoints of $\overline{BC}$, $\overline{CD}$, and $\overline{AD}$, respectively. Point $H$ is the midpoint of $\overline{GE}$. What is the area of the shaded region? [asy] import graph; size(9cm); pen dps = fontsize(10); defaultpen(dps); pair D = (0,0); pair F = (1/2,0); pair C = (1,0); pair G = (0,1); pair E = (1,1); pair A = (0,2); pair B = (1,2); pair H = (1/2,1); // do not look pair X = (1/3,2/3); pair Y = (2/3,2/3); draw(A--B--C--D--cycle); draw(G--E); draw(A--F--B); draw(D--H--C); filldraw(H--X--F--Y--cycle,grey); label("$A$",A,NW); label("$B$",B,NE); label("$C$",C,SE); label("$D$",D,SW); label("$E$",E,E); label("$F$",F,S); label("$G$",G,W); label("$H$",H,N); label("$\displaystyle\frac12$",(0.25,0),S); label("$\displaystyle\frac12$",(0.75,0),S); label("$1$",(1,0.5),E); label("$1$",(1,1.5),E); [/asy] $ \textbf{(A)}\ \dfrac1{12}\qquad\textbf{(B)}\ \dfrac{\sqrt3}{18}\qquad\textbf{(C)}\ \dfrac{\sqrt2}{12}\qquad\textbf{(D)}\ \dfrac{\sqrt3}{12}\qquad\textbf{(E)}\ \dfrac16 $

A sequence of natural numbers is constructed by listing the first $4$, then skipping one, listing the next $5$, skipping $2$, listing $6$, skipping $3$, and, on the $n$th iteration, listing $n+3$ and skipping $n$. The sequence begins $1,2,3,4,6,7,8,9,10,13$. What is the $500,000$th number in the sequence? $ \textbf{(A)}\ 996,506\qquad\textbf{(B)}\ 996507\qquad\textbf{(C)}\ 996508\qquad\textbf{(D)}\ 996509\qquad\textbf{(E)}\ 996510 $

A rope of length 10 [i]m[/i] is tied tautly from the top of a flagpole to the ground 6 [i]m[/i] away from the base of the pole. An ant crawls up the rope and its shadow moves at a rate of 30 [i]cm/min[/i]. How many meters above the ground is the ant after 5 minutes? (This takes place on the summer solstice on the Tropic of Cancer so that the sun is directly overhead.)

Let $ABC$ be a triangle and $\Gamma$ the $A$- exscribed circle whose center is $J$ . Let $D$ and $E$ be the touchpoints of $\Gamma$ with the lines $AB$ and $AC$, respectively. Let $S$ be the area of the quadrilateral $ADJE$, Find the maximum value that $\frac{S}{AJ^2}$ has and when equality holds.

Let $S = \{1,2,\cdots,2013\}$. Let $N$ denote the number $9$-tuples of sets $(S_1, S_2, \dots, S_9)$ such that $S_{2n-1}, S_{2n+1} \subseteq S_{2n} \subseteq S$ for $n=1,2,3,4$. Find the remainder when $N$ is divided by $1000$. [i]Proposed by Lewis Chen[/i]

Can a set of six numbers $\left\{a, b,c, \frac{a^2}{b} , \frac{b^2}{c} , \frac{c^2}{a} \right\}$ , where $a, b, c$ positive numbers, turn out to be exactly exactly three different numbers?