Found problems: 85335
Consider the sequence of numbers: $ 4, 7, 1, 8, 9, 7, 6, \ldots .$ For $ n > 2$, the $ n$th term of the sequence is the units digit of the sum of the two previous terms. Let $ S_n$ denote the sum of the first $ n$ terms of this sequence. The smallest value of $ n$ for which $ S_n > 10,000$ is:
$ \textbf{(A)}\ 1992 \qquad \textbf{(B)}\ 1999 \qquad \textbf{(C)}\ 2001 \qquad \textbf{(D)}\ 2002 \qquad \textbf{(E)}\ 2004$
Let $ABCD$ be a trapezoid with bases $AD$ and $BC$, and let $M$ be the midpoint of $CD$. The circumcircle of triangle $BCM$ meets $AC$ and $BD$ again at $E$ and $F$, with $E$ and $F$ distinct, and line $EF$ meets the circumcircle of triangle $AEM$ again at $P$. Prove that $CP$ is parallel to $BD$.
[i]Proposed by Ariel García[/i]
Let $\mathbb{R}$ be the set of real numbers. Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that, for any real numbers $x$ and $y$, \[ f(f(x)f(y)) + f(x+y) = f(xy). \]
[i]Proposed by Dorlir Ahmeti, Albania[/i]
In a triangular pyramid $SABC$ one of the plane angles with vertex $S$ is a right angle and the orthogonal projection of $S$ on the base plane $ABC$ coincides with the orthocenter of the triangle $ABC$. Let $SA=m$, $SB=n$, $SC=p$, $r$ is the inradius of $ABC$. $H$ is the height of the pyramid and $r_1,r_2,r_3$ are radii of the incircles of the intersections of the pyramid with the plane passing through $SA,SB,SC$ and the height of the pyramid. Prove that
(a) $m^2+n^2+p^2\ge18r^2$;
(b) $\frac{r_1}H,\frac{r_2}H,\frac{r_3}H$ are in the range $(0.4,0.5)$.
Given a convex pentagon $ABCDE$ in which $\angle ABC = \angle AED = 90^o$, $\angle BAC= \angle DAE$. Let $K$ be the midpoint of the side $CD$, and $P$ the intersection point of lines $AD$ and $BK$, $Q$ be the intersection point of lines $AC$ and $EK$. Prove that $BQ = PE$.
Sequence $\{a_n\}$ it define $a_1=1$ and
\[a_{n+1}=\frac{a_n}{n}+\frac{n}{a_n}\] for all $n\ge 1$\\
Prove that $\lfloor a_n^2\rfloor=n$ for all $n\ge 4.$
Let $M$ be the set of all integers from $1$ to $2013$. Each subset of $M$ is given one of $k$ available colors, with the only condition that if the union of two different subsets $A$ and $B$ is $M$, then $A$ and $B$ are given different colors. What is the least possible value of $k$?
There are $2n$ consecutive integers on a board. It is permitted to split them into pairs and simultaneously replace each pair by their difference (not necessarily positive) and their sum. Prove that it is impossible to obtain any $2n$ consecutive integers again.
Alexandr Gribalko
Let $a$, $b$, $c$ be real positive numbers. Show that \[\frac{a}{b}+\frac{b}{c}+\frac{c}{a}\geq \frac{a+b}{b+c}+\frac{b+c}{a+b}+1\]
(I'll skip over the whole "dressing" of the graph in cities and flights [color=#FF0000][Mod edit: Shu has posted the "dressed-up" version below][/color])
For an ordinary directed graph, show that there is a subset A of vertices such that:
$1.$ There are no edges between the vertices of A.
$2.$ For any vertex $v$, there is either a direct way from $v$ to a vertex in A, or a way passing through only one vertex and ending in A (like $v$ ->$v'$-> $a$, where $a$ is a vertex in A)
Consider the polynomial $ax^3+bx^2+cx+d$ where $a,b,c,d$ are integers such that $ad$ is odd and $bc$ is even.Prove that not all of its roots are rational..
Suppose a box contains $28$ balls: $1$ red, $2$ blue, $3$ yellow, $4$ orange, $5$ purple, $6$ green, and $7$ pink. One by one, each ball is removed uniformly at random and without replacement until all $28$ balls have been removed. Determine the probability that the most likely “scenario of exhaustion” occurs; that is, determine the probability that the first color to have all such balls removed from the box is red, that the second is blue, the third is yellow, the fourth is orange, the fifth is purple, the sixth is green, and the seventh is pink.
The $27$ points $(a,b,c)$ of the space are marked such that $a$, $b$ and $c$ take the values $0$, $1$ or $2$. We will call these points "junctures". Using $54$ rods of length $1$, all the joints that are at a distance of $1$ are joined together. A cubic structure of $2\times 2\times 2$ is thus formed. An ant starts from a juncture $A$ and moves along the rods; When it reaches a juncture it turns $90^\circ$ and changes rod. If the ant returns to $A$ and has not visited any juncture more than once except $A$, which it visited $2$ times, at the beginning of the walk and at the end of it, what is the greatest length that the path of the ant can have?
A point $T$ is chosen inside a triangle $ABC$. Let $A_1$, $B_1$, and $C_1$ be the reflections of $T$ in $BC$, $CA$, and $AB$, respectively. Let $\Omega$ be the circumcircle of the triangle $A_1B_1C_1$. The lines $A_1T$, $B_1T$, and $C_1T$ meet $\Omega$ again at $A_2$, $B_2$, and $C_2$, respectively. Prove that the lines $AA_2$, $BB_2$, and $CC_2$ are concurrent on $\Omega$.
[i]Proposed by Mongolia[/i]
Two positive integers differ by $60.$ The sum of their square roots is the square root of an integer that is not a perfect square. What is the maximum possible sum of the two integers?
A country has four political parties - the Blue Party, the Red Party, the Yellow Party and the Orange Party - and a parliament of 650 seats.
(a) How many ways are there to divide the seats among the four parties so that none of the parties have a majority? (To have a majority that party must hold more than half of the seats.)
The parliament is particularly worried about cyber security. They have decided that all login passwords must be of length exactly 6 and be a combination of a legal set of elements made up of the digits 0-9, the 52 upper and lower case letters (a-z and A-Z), and five special characters: \ICMC 2018/19 Round 1, Problem 1 $, £, *, &, %. For the password to be allowed, it must contain at least one letter or special character and any letter or special character in the password must be followed by a digit (so it must end in a digit).
(b) The Blue members of parliament have decided to choose their password by selecting 6 elements from the legal set without replacement. What is the probability it is allowed?
Note: you may leave your answers as combinatorial or factorial terms.
Let $ABC$ be a triangle and $L$ its circumscribed circle. The internal bisector of angle $A$ meets $BC$ at point $P$. Let $L_1$ be the circle tangent to $AP,BP$ and $L$. Similarly, let $L_2$ be the circle tangent to $AP,CP$ and $L$. Prove that the tangency points of $L_1$ and $L_2$ with $AP$ coincide.
Given a positive integer $m$, a sequence of real numbers $a= (a_1,a_2,a_3,...)$ is called $m$-powerful if it satisfies
$$(\sum_{k=1}^{n} a_k )^{m} = \sum_{k=1}^{n} a_k^{m}$$for all positive integers $n$.
(a) Show that a sequence is $30$-powerful if and only if at most one of its terms is non-zero.
(b) Find a sequence none of whose terms are zero but which is $2017$-powerful.
Let $ABC$ be a triangle with an obtuse angle at $A$. Let $E$ and $F$ be the intersections of the external bisector of angle $A$ with the altitudes of $ABC$ through $B$ and $C$ respectively. Let $M$ and $N$ be the points on the segments $EC$ and $FB$ respectively such that $\angle EMA = \angle BCA$ and $\angle ANF = \angle ABC$. Prove that the points $E, F, N, M$ lie on a circle.
We color all vertexs of a convex polygon with $10$ vertexs by $2$ colors: red and blue $($each vertex is colored by $1$ color$).$
How many ways to color all the vertexs such that there are no $2$ adjacent vertex that are both colored red?
Let $a_1, a_2, \cdots, a_k$ be natural numbers. Let $S(n)$ be the number of solutions in nonnegative integers to $a_1x_1 + a_2x_2 + \cdots + a_kx_k = n$. Suppose $S(n) \neq 0$ for all big enough $n$. Show that for all sufficiently large $n$, we have $S(n+1) < 2S(n)$.
Find the remainder when $2024^{2023^{2022^{2021...^{3^{2}}}}} + 2025^{2021^{2017^{2013...^{5^{1}}}}}$ is divided by $19$.
A right square pyramid with volume $54$ has a base with side length $6.$ The five vertices of the pyramid all lie on a sphere with radius $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Prove that there are infinitely many positive integers $n$ such that $$3^{(n-2)^{n-1}-1} -1\vdots 17n^2$$
(I. Bliznets)
Zack keeps cutting the interval $[0, 1]$ of the number line, each time cutting at a uniformly random point in the interval, until the interval is cut into pieces, none of which have length greater than $\frac35$ . The expected number of cuts that Zack makes can be written as $\frac{p}{q}$ for $p$ and $q$ relatively prime positive integers. Find $p + q$.