This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 85335

There is a sequence of numbers $+1$ and $-1$ of length $n$. It is known that the sum of every $10$ neighbouring numbers in the sequence is $0$ and that the sum of every $12$ neighbouring numbers in the sequence is not zero. What is the maximal value of $n$?
Compute $$\lim_{k\rightarrow\infty}\left(\frac{2017^{1/k}}{k+1}+\frac{2017^{2/k}}{k+\frac{1}{2}}+\dots+\frac{2017^{k/k}}{k+\frac{1}{k}}\right).$$
Let $a,b$ be positive integers satisfying $a^3-b^3-ab=25$. Find the largest possible value of $a^2+b^3$.
The medians of a right triangle which are drawn from the vertices of the acute angles are $ 5$ and $ \sqrt {40}$. The value of the hypotenuse is: $ \textbf{(A)}\ 10 \qquad\textbf{(B)}\ 2\sqrt {40} \qquad\textbf{(C)}\ \sqrt {13} \qquad\textbf{(D)}\ 2\sqrt {13} \qquad\textbf{(E)}\ \text{none of these}$
In the beginning there are $100$ integers in a row on the blackboard. Kain and Abel then play the following game: A [i]move[/i] consists in Kain choosing a chain of consecutive numbers; the length of the chain can be any of the numbers $1,2,\dots,100$ and in particular it is allowed that Kain only chooses a single number. After Kain has chosen his chain of numbers, Abel has to decide whether he wants to add $1$ to each of the chosen numbers or instead subtract $1$ from of the numbers. After that the next move begins, and so on. If there are at least $98$ numbers on the blackboard that are divisible by $4$ after a move, then Kain has won. Prove that Kain can force a win in a finite number of moves.
Given are (not necessarily positive) real numbers $a, b$, and $c$ for which $|a - b| \ge |c| , |b - c| \ge |a|$ and $|c - a| \ge |b|$ . Prove that one of the numbers $a, b$, and $c$ is the sum of the other two.
At a strange party, each person knew exactly $22$ others. For any pair of people $X$ and $Y$ who knew each other, there was no other person at the party that they both knew. For any pair of people $X$ and $Y$ who did not know one another, there were exactly 6 other people that they both knew. How many people were at the party?
In cube $ABCD-A_1B_1C_1D_1$, the degree of dihedral angle $A-BD_1-A_1$ is________.
Prove that for each $m\geq1$: \[\sum_{|k|<\sqrt m}\binom{2m}{m+k}\geq 2^{2m-1}\] [hide="Hint"]Maybe probabilistic method works[/hide]
Consider all $26^{26}$ words of length 26 in the Latin alphabet. Define the $\emph{weight}$ of a word as $1/(k+1)$, where $k$ is the number of letters not used in this word. Prove that the sum of the weights of all words is $3^{75}$. Proposed by Fedor Petrov, St. Petersburg State University
The area and the perimeter of the triangle with sides $10,8,6$ are equal. Find all the triangles with integral sides whose area and perimeter are equal.
Let $p{}$ be a prime number and $x_1,x_2,\ldots,x_p$ be integers for which $x_1^n+x_2^n+\cdots+x_p^n$ is divisible by $p{}$ for any positive integer $n{}$. Prove that $x_1-x_2$ is divisible by $p{}.$
Find the least natural number such that if the first digit (in the decimal system) is placed last, the new number is $7/2 $ times as large as the original number.
Finished with rereading Isaac Asimov's $\textit{Foundation}$ series, Joshua asks his father, "Do you think somebody will build small devices that run on nuclear energy while I'm alive?" "Honestly, Josh, I don't know. There are a lot of very different engineering problems involved in designing such devices. But technology moves forward at an amazing pace, so I won't tell you we can't get there in time for you to see it. I $\textit{did}$ go to a graduate school with a lady who now works on $\textit{portable}$ nuclear reactors. They're not small exactly, but they aren't nearly as large as most reactors. That might be the first step toward a nuclear-powered pocket-sized video game. Hannah adds, "There are already companies designing batteries that are nuclear in the sense that they release energy from uranium hydride through controlled exoenergetic processes. This process is not the same as the nuclear fission going on in today's reactors, but we can certainly call it $\textit{nuclear energy}$." "Cool!" Joshua's interest is piqued. Hannah continues, "Suppose that right now in the year $2008$ we can make one of these nuclear batteries in a battery shape that is $2$ meters $\textit{across}$. Let's say you need that size to be reduced to $2$ centimeters $\textit{across}$, in the same proportions, in order to use it to run your little video game machine. If every year we reduce the necessary volume of such a battery by $1/3$, in what year will the batteries first get small enough?" Joshua asks, "The battery shapes never change? Each year the new batteries are similar in shape - in all dimensions - to the bateries from previous years?" "That's correct," confirms Joshua's mother. "Also, the base $10$ logarithm of $5$ is about $0.69897$ and the base $10$ logarithm of $3$ is around $0.47712$." This makes Joshua blink. He's not sure he knows how to use logarithms, but he does think he can compute the answer. He correctly notes that after $13$ years, the batteries will already be barely more than a sixth of their original width. Assuming Hannah's prediction of volume reduction is correct and effects are compounded continuously, compute the first year that the nuclear batteries get small enough for pocket video game machines. Assume also that the year $2008$ is $7/10$ complete.
In $ \triangle ABC$ we have $ AB \equal{} 7$, $ AC \equal{} 8$, and $ BC \equal{} 9$. Point $ D$ is on the circumscribed circle of the triangle so that $ \overline{AD}$ bisects $ \angle BAC$. What is the value of $ AD/CD$? $ \textbf{(A)}\ \frac{9}{8}\qquad \textbf{(B)}\ \frac{5}{3}\qquad \textbf{(C)}\ 2\qquad \textbf{(D)}\ \frac{17}{7}\qquad \textbf{(E)}\ \frac{5}{2}$
On the planet Mars there are $100$ states that are in dispute. To achieve a peace situation, blocs must be formed that meet the following two conditions: (1) Each block must have at most $50$ states. (2) Every pair of states must be together in at least one block. Find the minimum number of blocks that must be formed.
Let $M, N$ be points inside the angle $\angle BAC$ usch that $\angle MAB\equiv \angle NAC$. If $M_{1}, M_{2}$ and $N_{1}, N_{2}$ are the projections of $M$ and $N$ on $AB, AC$ respectively then prove that $M, N$ and $P$ the intersection of $M_{1}N_{2}$ with $N_{1}M_{2}$ are collinear.
Let $n\ge 2$ be a given integer. Show that the number of strings of length $n$ consisting of $0'$s and $1'$s such that there are equal number of $00$ and $11$ blocks in each string is equal to \[2\binom{n-2}{\left \lfloor \frac{n-2}{2}\right \rfloor}\]
Fathers childhood lasted for one sixth part of his life, and he married one $8$th after that and he immediately left to army. When one $12$th of his life passed, father returned from the army and $5$ years after he got a son. Son who lived for one half of fathers years, died $4$ years before his father. How many years lived his father, and how many years he had when his son was born?
Two circles $ C_1,C_2$ with different radii are given in the plane, they touch each other externally at $ T$. Consider any points $ A\in C_1$ and $ B\in C_2$, both different from $ T$, such that $ \angle ATB \equal{} 90^{\circ}$. (a) Show that all such lines $ AB$ are concurrent. (b) Find the locus of midpoints of all such segments $ AB$.
For what single digit $n$ does $91$ divide the $9$-digit number $12345n789$?
Let $a$ and $b$ be two positive integers. Prove that the integer \[a^2+\left\lceil\frac{4a^2}b\right\rceil\] is not a square. (Here $\lceil z\rceil$ denotes the least integer greater than or equal to $z$.) [i]Russia[/i]
In the interior of an equilateral triangle $ ABC $ a point $ P $ is chosen such that $ PA ^2 = PB ^2 + PC ^2 $. Find the measure of $ \angle BPC $.
For some integers $a$ and $b$ the function $f(x)=ax+b$ has the properties that $f(f(0))=0$ and $f(f(f(4)))=9$. Find $f(f(f(f(10))))$.
Consider the sequence $(a_n)_{n\geq 1}$ given by $a_1=1$ and $a_{n+1}=\frac{a_n}{1+\sqrt{1+a_n}}$, for all $n\geq 1$. Show that $$\lim_{n\rightarrow\infty}\frac{a_{n+1}}{a_n} = \lim_{n\rightarrow\infty}\sum_{k=1}^n \log_2(1+a_k)=2.$$ [i]Mathematical Gazette[/i]