Found problems: 233
Let the sequence $\{a_i\}^\infty_{i=0}$ be defined by $a_0 =\frac12$ and $a_n = 1 + (a_{n-1} - 1)^2$. Find the product $$\prod_{i=0}^\infty a_i=a_0a_1a_2\ldots$$
Define the sequence of positive integers $\{a_n\}$ as follows. Let $a_1=1$, $a_2=3$, and for each $n>2$, let $a_n$ be the result of expressing $a_{n-1}$ in base $n-1$, then reading the resulting numeral in base $n$, then adding $2$ (in base $n$). For example, $a_2=3_{10}=11_2$, so $a_3=11_3+2_3=6_{10}$. Express $a_{2013}$ in base $10$.
2. Let $A$ be a set of $2020$ distinct real numbers. Call a number [i]scarily epic[/i] if it can be expressed as the product of two (not necessarily distinct) numbers from $A$. What is the minimum possible number of distinct [i]scarily epic[/i] numbers?
[i]Proposed by Monkey_king1[/i]
Find the sum of all real numbers $x$ such that $5x^4-10x^3+10x^2-5x-11=0$.
Let $O_1$ and $O_2$ be concentric circles with radii 4 and 6, respectively. A chord $AB$ is drawn in $O_1$ with length $2$. Extend $AB$ to intersect $O_2$ in points $C$ and $D$. Find $CD$.
There is a unique function $f: \mathbb{N} \to \mathbb{R}$ such that $f(1) > 0$ and such that
\[\sum_{d \mid n} f(d) f\left(\frac{n}{d}\right) = 1\]
for all $n \ge 1$. What is $f(2018^{2019})$?
In the game of Guess the Card, two players each have a $\frac{1}{2}$ chance of winning and there is exactly one winner. Sixteen competitors stand in a circle, numbered $1,2,\dots,16$ clockwise. They participate in an $4$-round single-elimination tournament of Guess the Card. Each round, the referee randomly chooses one of the remaining players, and the players pair off going clockwise, starting from the chosen one; each pair then plays Guess the Card and the losers leave the circle. If the probability that players $1$ and $9$ face each other in the last round is $\frac{m}{n}$ where $m,n$ are positive integers, find $100m+n$.
[i]Proposed by Evan Chen[/i]
How many positive integers $k$ are there such that \[\dfrac k{2013}(a+b)=lcm(a,b)\] has a solution in positive integers $(a,b)$?
Let $\triangle ABC$ be a triangle with $\angle BAC>90^{\circ}$, $AB=5$ and $AC=7$. Points $D$ and $E$ lie on segment $BC$ such that $BD=DE=EC$. If $\angle BAC+\angle DAE=180^{\circ}$, compute $BC$.
Steph Curry is playing the following game and he wins if he has exactly $5$ points at some time. Flip a fair coin. If heads, shoot a $3$-point shot which is worth $3$ points. If tails, shoot a free throw which is worth $1$ point. He makes $\frac12$ of his $3$-point shots and all of his free throws. Find the probability he will win the game. (Note he keeps flipping the coin until he has exactly $5$ or goes over $5$ points)
Steph Curry is playing the following game and he wins if he has exactly $5$ points at some time. Flip a fair coin. If heads, shoot a $3$-point shot which is worth $3$ points. If tails, shoot a free throw which is worth $1$ point. He makes $\frac12$ of his $3$-point shots and all of his free throws. Find the probability he will win the game. (Note he keeps flipping the coin until he has exactly $5$ or goes over $5$ points)
Carl and Bob can demolish a building in 6 days, Anne and Bob can do it in $3$, Anne and Carl in $5$. How many days does it take all of them working together if Carl gets injured at the end of the first day and can't come back?
Edward's formula for the stock market predicts correctly that the price of HMMT is directly proportional to a secret quantity $ x$ and inversely proportional to $ y$, the number of hours he slept the night before. If the price of HMMT is $ \$12$ when $ x\equal{}8$ and $ y\equal{}4$, how many dollars does it cost when $ x\equal{}4$ and $ y\equal{}8$?
Let \[ A = \frac{1}{6}((\log_2(3))^3-(\log_2(6))^3-(\log_2(12))^3+(\log_2(24))^3) \].
Compute $2^A$.
$2019$ students are voting on the distribution of $N$ items. For each item, each student submits a vote on who should receive that item, and the person with the most votes receives the item (in case of a tie, no one gets the item). Suppose that no student votes for the same person twice. Compute the maximum possible number of items one student can receive, over all possible values of $N$ and all possible ways of voting.
Determine all real values of $A$ for which there exist distinct complex numbers $x_1$, $x_2$ such that the following three equations hold:
\begin{align*}x_1(x_1+1)&=A\\x_2(x_2+1)&=A\\x_1^4+3x_1^3+5x_1&=x_2^4+3x_2^3+5x_2.\end{align*}
For a positive integer $N$, we color the positive divisors of $N$ (including 1 and $N$) with four colors. A coloring is called [i]multichromatic[/i] if whenever $a$, $b$ and $\gcd(a, b)$ are pairwise distinct divisors of $N$, then they have pairwise distinct colors. What is the maximum possible number of multichromatic colorings a positive integer can have if it is not the power of any prime?
Let $ABCDEF$ be a convex equilateral hexagon such that lines $BC$, $AD$, and $EF$ are parallel. Let $H$ be the orthocenter of triangle $ABD$. If the smallest interior angle of the hexagon is $4$ degrees, determine the smallest angle of the triangle $HAD$ in degrees.
Fred the Four-Dimensional Fluffy Sheep is walking in 4-dimensional space. He starts at the origin. Each minute, he walks from his current position $(a_1, a_2, a_3, a_4)$ to some position $(x_1, x_2, x_3, x_4)$ with integer coordinates satisfying
\[(x_1-a_1)^2 + (x_2-a_2)^2 + (x_3-a_3)^2 + (x_4-a_4)^2 = 4
\quad \text{and} \quad
|(x_1 + x_2 + x_3 + x_4) - (a_1 + a_2 + a_3 + a_4)| = 2.\]
In how many ways can Fred reach $(10, 10, 10, 10)$ after exactly 40 minutes, if he is allowed to pass through this point during his walk?
Scalene triangle $ABC$ satisfies $\angle A = 60^{\circ}$. Let the circumcenter of $ABC$ be $O$, the orthocenter be $H$, and the incenter be $I$. Let $D$, $T$ be the points where line $BC$ intersects the internal and external angle bisectors of $\angle A$, respectively. Choose point $X$ on the circumcircle of $\triangle IHO$ such that $HX \parallel AI$. Prove that $OD \perp TX$.
31. Define a number to be an anti-palindrome if, when written in base $3$ as $a_na_{n-1}\ldots a_0$, then $a_i+a_{n-i} = 2$ for any $0 \le i \le n$. Find the number of anti-palindromes less than $3^{12}$ such that no two consecutive digits in base 3 are equal.
32. Let $C_{k,n}$ denote the number of paths on the Cartesian plane along which you can travel from $(0, 0)$ to $(k, n)$, given the following rules: 1) You can only travel directly upward or directly rightward 2) You can only change direction at lattice points 3) Each horizontal segment in the path must be at most $99$ units long.
Find $$\sum_{j=0}^\infty C_{100j+19,17}$$
33. Camille the snail lives on the surface of a regular dodecahedron. Right now he is on vertex $P_1$ of the face with vertices $P_1, P_2, P_3, P_4, P_5$. This face has a perimeter of $5$. Camille wants to get to the point on the dodecahedron farthest away from $P_1$. To do so, he must travel along the surface a distance at least $L$. What is $L^2$?
The coefficients of the polynomial $P(x)$ are nonnegative integers, each less than 100. Given that $P(10) = 331633$ and $P(-10) = 273373$, compute $P(1)$.
How many real triples $(a,b,c)$ are there such that the polynomial $p(x)=x^4+ax^3+bx^2+ax+c$ has exactly three distinct roots, which are equal to $\tan y$, $\tan 2y$, and $\tan 3y$ for some real number $y$?
Given points $a$ and $b$ in the plane, let $a\oplus b$ be the unique point $c$ such that $abc$ is an equilateral triangle with $a,b,c$ in the clockwise orientation.
Solve $(x\oplus (0,0))\oplus(1,1)=(1,-1)$ for $x$.
A rectangular pool table has vertices at $(0, 0) (12, 0) (0, 10),$ and $(12, 10)$. There are pockets only in the four corners. A ball is hit from $(0, 0)$ along the line $y = x$ and bounces off several walls before eventually entering a pocket. Find the number of walls that the ball bounces off of before entering a pocket.