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)

Hey, This problem is from the VTRMC 2006. 3. Recall that the Fibonacci numbers $ F(n)$ are defined by $ F(0) \equal{} 0$, $ F(1) \equal{} 1$ and $ F(n) \equal{} F(n \minus{} 1) \plus{} F(n \minus{} 2)$ for $ n \geq 2$. Determine the last digit of $ F(2006)$ (e.g. the last digit of 2006 is 6). As, I and a friend were working on this we noticed an interesting relationship when writing the Fibonacci numbers in "mod" notation. Consider the following, 01 = 1 mod 10 01 = 1 mod 10 02 = 2 mod 10 03 = 3 mod 10 05 = 5 mod 10 08 = 6 mod 10 13 = 3 mod 10 21 = 1 mod 10 34 = 4 mod 10 55 = 5 mod 10 89 = 9 mod 10 Now, consider that between the first appearance and second apperance of $ 5 mod 10$, there is a difference of five terms. Following from this we see that the third appearance of $ 5 mod 10$ occurs at a difference 10 terms from the second appearance. Following this pattern we can create the following relationships. $ F(55) \equal{} F(05) \plus{} 5({2}^{2})$ This is pretty much as far as we got, any ideas?

Consider a polynomial $P(x) = \prod^9_{j=1}(x+d_j),$ where $d_1, d_2, \ldots d_9$ are nine distinct integers. Prove that there exists an integer $N,$ such that for all integers $x \geq N$ the number $P(x)$ is divisible by a prime number greater than 20. [i]Proposed by Luxembourg[/i]

Will has a magic coin that can remember previous flips. If the coin has already turned up heads $m$ times and tails $n$ times, the probability that the next flip turns up heads is exactly $\frac{m+1}{m+n+2}$. Suppose that the coin starts at $0$ flips. The probability that after $10$ coin flips, heads and tails have both turned up exactly $5$ times can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Nathan Xiong[/i]

A chord $AB$ is drawn in a circle. On its extensions beyond points $A$ and $B$, points $P$ and $Q$ respectively are taken such that $AP = BQ$. Through $P$ and $Q$ two tangents to the circle are drawn, intersecting at point $M$. Find the locus of points $M$ ($P$ and $Q$ move along a straight line and for any $P$ and $Q$ all possible pairs of tangents are taken, which determine four points from the desired locus of points) .

Let $m, k$, and $c$ be positive integers with $k > c$, and let $\lambda$ be a positive, non-integer real root of the equation $\lambda^{m+1} - k \lambda^m - c = 0$. Let $f : Z^+ \to Z$ be defined by $f(n) = \lfloor \lambda n \rfloor$ for all $n \in Z^+$. Show that $f^{m+1}(n) \equiv cn - 1$ (mod $k$) for all $n \in Z^+$. (Here, $Z^+$ denotes the set of positive integers, $ \lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$, and $f^{m+1}(n) = f(f(... f(n)...))$ where $f$ appears $m + 1$ times.)

All russian olympiad 2016,Day 2 ,grade 9,P8 : Let $a, b, c, d$ be are positive numbers such that $a+b+c+d=3$ .Prove that$$\frac{1}{a^2}+\frac{1}{b^2}+\frac{1}{c^2}+\frac{1}{d^2}\le\frac{1}{a^2b^2c^2d^2}$$ All russian olympiad 2016,Day 2,grade 11,P7 : Let $a, b, c, d$ be are positive numbers such that $a+b+c+d=3$ .Prove that $$\frac{1}{a^3}+\frac{1}{b^3}+\frac{1}{c^3}+\frac{1}{d^3}\le\frac{1}{a^3b^3c^3d^3}$$ Russia national 2016

$512$ persons meet at a meeting[ Under every six of these people there is always at least two who know each other. Prove that there must be six people at this gathering, all mutual know.

Given a triangle $ \triangle{ABC} $ with orthocenter $ H $. On its circumcenter, choose an arbitrary point $ P $ (other than $ A,B,C $) and let $ M $ be the mid-point of $ HP $. Now, we find three points $ D,E,F $ on the line $ BC, CA, AB $, respectively, such that $ AP \parallel HD, BP \parallel HE, CP \parallel HF $. Show that $ D, E, F, M $ are colinear.

Let \(ABC\) be an acute scalene triangle with orthocenter \(H\). Line \(BH\) intersects \(\overline{AC}\) at \(E\) and line \(CH\) intersects \(\overline{AB}\) at \(F\). Let \(X\) be the foot of the perpendicular from \(H\) to the line through \(A\) parallel to \(\overline{EF}\). Point \(B_1\) lies on line \(XF\) such that \(\overline{BB_1}\) is parallel to \(\overline{AC}\), and point \(C_1\) lies on line \(XE\) such that \(\overline{CC_1}\) is parallel to \(\overline{AB}\). Prove that points \(B\), \(C\), \(B_1\), \(C_1\) are concyclic. [i]Proposed by Luke Robitaille[/i]

How many ordered pairs of integers $(x, y)$ satisfy the equation$$x^{2020}+y^2=2y?$$ $\textbf{(A) } 1 \qquad\textbf{(B) } 2 \qquad\textbf{(C) } 3 \qquad\textbf{(D) } 4 \qquad\textbf{(E) } \text{infinitely many}$

A circle centered at point $O$ is separated by points $A_1,A_2,...,A_n$ on $n$ equal parts (points are listed sequentially clockwise) and the rays $OA_1,OA_2,...,OA_n$ are constructed. The angle $A_2OA_3$ is divided by rays into two equal angles at vertex $O$, the angle $A_3OA_4$ is divided into three equal angles, and so on, finally, the angle $A_nOA_1$ divided into $n$ equal angles at vertex $O$. A point belonging to the ray other than $OA_1$, is connected by a segment with its orthogonal projection $B_0$ on the neighboring (clockwise) arrow) with ray $OA_1$, point$ B_1$ is connected by a segment with its orthogonal projection on the next (clockwise) ray, etc. As a result of such process it turns out the broken line $B_0B_1B_2B_3...$ infinitely "twists". Consider the question of giving the thus obtained broken numerical value of "length" $L (n)$ and explore the value of $L(n)$ depending on $n$.

The parallelogram $ABCD$ has $AB=a,AD=1,$ $\angle BAD=A$, and the triangle $ABD$ has all angles acute. Prove that circles radius $1$ and center $A,B,C,D$ cover the parallelogram if and only \[a\le\cos A+\sqrt3\sin A.\]

Find all positive integers $ a$ and $ b$ such that $ \frac{a^{4}\plus{}a^{3}\plus{}1}{a^{2}b^{2}\plus{}ab^{2}\plus{}1}$ is an integer.

Let $O$ be the centre of a regular $n$-gon whose vertices are labelled $A_1$,$...$, $A_n$. Let $a_1>a_2>...>a_n>0$. Prove that the vector $$a_1\overrightarrow{OA_1}+a_2\overrightarrow{OA_2}+...+a_n\overrightarrow{OA_n}$$ is not equal to the zero vector. (D. Fomin, Alexey Kirichenko)

Does there exist a a sequence $a_{0},a_{1},a_{2},\dots$ in $\mathbb N$, such that for each $i\neq j, (a_{i},a_{j})=1$, and for each $n$, the polynomial $\sum_{i=0}^{n}a_{i}x^{i}$ is irreducible in $\mathbb Z[x]$? [i]By Omid Hatami[/i]