Wanda the Worm likes to eat Pascal's triangle. One day, she starts at the top of the triangle and eats $\textstyle\binom{0}{0}=1$. Each move, she travels to an adjacent positive integer and eats it, but she can never return to a spot that she has previously eaten. If Wanda can never eat numbers $a,b,c$ such that $a+b=c$, prove that it is possible for her to eat 100,000 numbers in the first 2011 rows given that she is not restricted to traveling only in the first 2011 rows. (Here, the $n+1$st row of Pascal's triangle consists of entries of the form $\textstyle\binom{n}{k}$ for integers $0\le k\le n$. Thus, the entry $\textstyle\binom{n}{k}$ is considered adjacent to the entries $\textstyle\binom{n-1}{k-1}$, $\textstyle\binom{n-1}{k}$, $\textstyle\binom{n}{k-1}$, $\textstyle\binom{n}{k+1}$, $\textstyle\binom{n+1}{k}$, $\textstyle\binom{n+1}{k+1}$.) [i]Linus Hamilton.[/i]

A cubic function $f(x)$ satisfies the equation $\sin 3t=f(\sin t)$ for all real numbers $t$. Evaluate $\int_0^1 f(x)^2\sqrt{1-x^2}\ dx$.

In the Quadrilateral $ABCD$ we have $ \measuredangle B=\measuredangle D = 60^\circ $.$M$ is midpoint of side $AD$.The line through $M$ parallel to $CD$ meets $BC$ at $P$.Point $X$ lying on $CD$ such that $BX=MX$.Prove that $AB=BP$ if and only if $\measuredangle MXB=60^\circ$. Author: Davoud Vakili, Iran

Let $P$ equal the product of $3,659,893,456,789,325,678$ and $342,973,489,379,256$. The number of digits in $P$ is: $\textbf{(A) }36\qquad \textbf{(B) }35\qquad \textbf{(C) }34\qquad \textbf{(D) }33\qquad \textbf{(E) }32$

$ a,b,c>0 $ and $ abc=1 $. Prove that $\frac{1}{2}\ (\sqrt{a}\ +\sqrt{b}\ + \sqrt{c}\ ) +\frac{1}{1+a}\ + \frac{1}{1+b}\ + \frac{1}{1+c}\ge\ 3 $. ( The official problem is with $ abc = 1 $ but it can be proved without using it. )

Three circles with centres A, B, C touch each other pairwise externally, and touch circle c from inside. Prove that if the centre of c coincideswith the orthocentre of triangle ABC, then ABC is equilateral.

Source: 2018 Canadian Open Math Challenge Part C Problem 4 ----- Given a positive integer $N$, Matt writes $N$ in decimal on a blackboard, without writing any of the leading 0s. Every minute he takes two consicutive digits, erases them, and replaces them with the last digit of their product. Any leading zeroes created this way are also erased. He repeats this process for as long as he likes. We call the positive integer $M$ [i]obtainable[/i] from $N$ if starting from $N$, there is a finite sequence of moves that Matt can make to produce the number $M$. For example, 10 is obtainible from 251023 via \[2510\underline{23}\rightarrow\underline{25} 106\rightarrow 1\underline{06}\rightarrow 10\] $\text{(a)}$ Show that 2018 is obtainablefrom 2567777899. $\text{(b)}$ Find two positive integers $A$ and $B$ for which there is no positive integer $C$ [color=transparent](B.)[/color] such that both $A$ and $B$ are obtainablefrom $C$ $\text{(c)}$ Let $S$ be any finite set of positive integers, none of which contains the digit 5 [color=transparent](C.)[/color] in its decimal representation. Prove that there exists a positive integer $N$ [color=transparent](C.)[/color] for which all elements of $S$ are obtainable from $N$.

Lisa and Bart are playing a game. A round table has $n$ lights evenly spaced around its circumference. Some of the lights are on and some of them off; the initial configuration is random. Lisa wins if she can get all of the lights turned on; Bart wins if he can prevent this from happening. On each turn, Lisa chooses the positions at which to flip the lights, but before the lights are flipped, Bart, knowing Lisa’s choices, can rotate the table to any position that he chooses (or he can leave the table as is). Then the lights in the positions that Lisa chose are flipped: those that are off are turned on and those that are on are turned off. Here is an example turn for $n = 5$ (a white circle indicates a light that is on, and a black circle indicates a light that is off): [asy] size(250); defaultpen(linewidth(1)); picture p = new picture; real r = 0.2; pair s1=(0,-4), s2=(0,-8); int[][] filled = {{1,2,3},{1,2,5},{2,3,4,5}}; draw(p,circle((0,0),1)); for(int i = 0; i < 5; ++i) { pair P = dir(90-72*i); filldraw(p,circle(P,r),white); label(p,string(i+1),P,2*P,fontsize(10)); } add(p); add(shift(s1)*p); add(shift(s2)*p); for(int j = 0; j < 3; ++j) for(int i = 0; i < filled[j].length; ++i) filldraw(circle(dir(90-72*(filled[j][i]-1))+j*s1,r)); label("$\parbox{15em}{Initial Position.}$", (-4.5,0)); label("$\parbox{15em}{Lisa says ``1,3,4.'' \\ Bart rotates the table one \\ position counterclockwise. }$", (-4.5,0)+s1); label("$\parbox{15em}{Lights in positions 1,3,4 are \\ flipped.}$", (-4.5,0)+s2);[/asy] Lisa can take as many turns as she needs to win, or she can give up if it becomes clear to her that Bart can prevent her from winning. (a) Show that if $n = 7$ and initially at least one light is on and at least one light is off, then Bart can always prevent Lisa from winning. (b) Show that if $n = 8$, then Lisa can always win in at most 8 turns.

Three circles $S_A, S_B$, and $S_C$ in the plane with centers in $A, B$, and $C$, respectively, are mutually tangential on the outside. The touchpoint between $S_A$ and $S_B$ we call $C'$, the one $S_A$ between $S_C$ we call $B'$, and the one between $S_B$ and $S_C$ we call $A'$. The common tangent between $S_A$ and $S_C$ (passing through B') we call $\ell_B$, and the common tangent between $S_B$ and $S_C$ (passing through $A'$) we call $\ell_A$. The intersection point of $\ell_A$ and $\ell_B$ is called $X$. The point $Y$ is located so that $\angle XBY$ and $\angle YAX$ are both right angles. Show that the points $X, Y$, and $C'$ lie on a line if and only if $AC = BC$.

[b]2.[/b] Omit the vertices of a closed rectangle; the configuration obtained in such a way will be called a reduced rectangle. Prove tha the set-union of any system of reduced rectangles with parallel sides is equal to the union of countably many elements of the system. [b](St. 3)[/b]

If you roll four fair $6$-sided dice, what is the probability that at least three of them will show the same value?

Find all positive integers $r$ with the property that there exists positive prime numbers $p$ and $q$ so that $$p^2 + pq + q^2 = r^2 .$$

The graph of $y=C\sin x$, where $C>0$ is a constant, is drawn on the interval $[0,\pi]$. Suppose that there exists a point $P$ on the graph such that the triangle with vertices $(0,0)$, $(\pi,0)$, and $P$ is equilateral. Find $C^2$.

Show that in each set of ten consecutive integers there is one that is coprime with each of the other integers. (For example, in the set $ \{ 114,115,...,123 \}$ there are two such numbers: $ 119$ and $ 121.)$

In an electronic game of questions and answers, for each correct answer the player adds $5$ points on the screen, for each incorrect answer $2$ points are subtracted and when the player does not answer, no score is added or subtracted. Each game has $30$ questions. Francisco played $5$ games and in all of them he obtained the same number of points, greater than zero, but the number of correct answers, errors and unanswered questions in each game was different. Give all the possible scores that Francisco could obtain.

Let $c$ be a positive real number. Find all functions $f:\mathbb{R}^+\to\mathbb{R}^+$ that satisfy $$x^2f(xf(y))f(x)f(y)=c$$ for all positive reals $x$ and $y$.

The planet Caramelo is a cube with a $1$ km edge. This planet is going to be wrapped with foam anti-gluttons in order to prevent the presence of greedy ships less than $500$ meters from the planet. What the minimum volume of foam that must surround the planet?

Determine the sign of $ \int_{\frac{1}{2}}^2 \frac{\ln t}{1\plus{}t^n}\ dt\ (n\equal{}1, 2, \cdots)$.

Given is a acute angled triangle $ABC$. The lengths of the altitudes from $A, B$ and $C$ are successively $h_A, h_B$ and $h_C$. Inside the triangle is a point $P$. The distance from $P$ to $BC$ is $1/3 h_A$ and the distance from $P$ to $AC$ is $1/4 h_B$. Express the distance from $P$ to $AB$ in terms of $h_C$.

For some fixed positive integer $n>2$, suppose $x_1$, $x_2$, $x_3$, $\ldots$ is a nonconstant sequence of real numbers such that $x_i=x_j$ if $i \equiv j \pmod{n}$. Let $f(i)=x_i + x_i x_{i+1} + \dots + x_i x_{i+1} \dots x_{i+n-1}$. Given that $$f(1)=f(2)=f(3)=\cdots$$ find all possible values of the product $x_1 x_2 \ldots x_n$.

Let $\{F_n\}_{n\in\mathbb{Z}}$ and $\{L_n\}_{n\in\mathbb{Z}}$ denote the Fibonacci and Lucas numbers, respectively, given by $$F_{n+1} = F_n + F_{n-1}\ \text{and}\ L_{n+1} = L_n + L_{n-1}\ \text{for all}\ n \geq 1$$with $F_0 = 0$, $F_1 = 1$, $L_0 = 2$, and $L_1 = 1$. Prove that for integers $n \geq 1$ and $j \geq 0$ [list=1] [*]$\sum \limits_{k=1}^n F_{k\pm j}L_{k\mp j}=F_{2n+1}-1+\begin{cases} 0, & \text{if}\ n\ \text{is even}\\ \left(-1\right)^{\pm j}F_{\pm 2j}, & \text{if}\ n\ \text{is odd} \end{cases}$ [*] $\sum \limits_{k=1}^nF_{k+j}F_{k-j}L_{k+j}L_{k-j}=\frac{F_{4n+2}-1-nL_{4j}}{5}$ [/list]

Given $ a_0 \equal{} 1$, $ a_1 \equal{} 3$, and the general relation $ a_n^2 \minus{} a_{n \minus{} 1}a_{n \plus{} 1} \equal{} (\minus{}1)^n$ for $ n \ge 1$. Then $ a_3$ equals: $ \textbf{(A)}\ \frac{13}{27}\qquad \textbf{(B)}\ 33\qquad \textbf{(C)}\ 21\qquad \textbf{(D)}\ 10\qquad \textbf{(E)}\ \minus{}17$

Prove that the system of equations $ \begin{cases} \ a^2 - b = c^2 \\ \ b^2 - a = d^2 \\ \end{cases} $ has no integer solutions $a, b, c, d$.

Let $ \varphi(x) \equal{} ax^3 \plus{} bx^2 \plus{} cx \plus{} d$ be a polynomial with real coefficients. Given that $ \varphi(x)$ has three positive real roots and that $ \varphi(0) < 0$, prove that \[ 2b^3 \plus{} 9a^2d \minus{} 7abc \leq 0. \]

Brianna is using part of the money she earned on her weekend job to buy several equally-priced CDs. She used one fifth of her money to buy one third of the CDs. What fraction of her money will she have left after she buys all the CDs? $ \textbf{(A)}\ \frac{1}{5} \qquad \textbf{(B)}\ \frac{1}{3} \qquad \textbf{(C)}\ \frac{2}{5} \qquad \textbf{(D)}\ \frac{2}{3} \qquad \textbf{(E)}\ \frac{4}{5}$