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

The pentagon $ABCDE$ is inscribed in the circle. Line segments $AC$ and $BD$ intersect at point $K$. Line segment $CE$ touches the circumcircle of triangle $ABK$ at point $N$. Find the angle $CNK$ if $\angle ECD = 40^o.$
Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.
Compute the remainder when $1^{2547} + 2^{2547} +...+ 2547^{2547}$ is divided by $25$.
Let $\sigma, \tau$ be two permutations of the quantity $\{1, 2,. . . , n\}$. Prove that there is a function $f: \{1, 2,. . . , n\} \to \{-1, 1\}$ such that for any $1 \le i \le j \le n$, we have $\left|\sum_{k=i}^{j} f(\sigma (k)) \right| \le 2$ and $\left|\sum_{k=i}^{j} f(\tau (k))\right| \le 2$
Let $ABC$ be a triangle with $BC=20$ and $CA=16$, and let $I$ be its incenter. If the altitude from $A$ to $BC$, the perpendicular bisector of $AC$, and the line through $I$ perpendicular to $AB$ intersect at a common point, then the length $AB$ can be written as $m+\sqrt{n}$ for positive integers $m$ and $n$. What is $100m+n$? [i] Proposed by Tristan Shin [/i]
There are forty weights: $1, 2, \cdots , 40$ grams. Ten weights with even masses were put on the left pan of a balance. Ten weights with odd masses were put on the right pan of the balance. The left and the right pans are balanced. Prove that one pan contains two weights whose masses di ffer by exactly $20$ grams. [i](4 points)[/i]
Two bored millionaires, Bilion and Trilion, decide to play a game. They each have a sufficient supply of $\$ 1, \$ 2,\$ 5$, and $\$ 10$ bills. Starting with Bilion, they take turns putting one of the bills they have into a pile. The game ends when the bills in the pile total exactly $\$1{,}000{,}000$, and whoever makes the last move wins the $\$1{,}000{,}000$ in the pile (if the pile is worth more than $\$1{,}000{,}000$ after a move, then the person who made the last move loses instead, and the other person wins the amount of cash in the pile). Assuming optimal play, how many dollars will the winning player gain? [i]Proposed by Yannick Yao[/i]
For a set with $n$ elements, how many subsets are there whose cardinality is respectively $\equiv 0$ (mod $3$), $\equiv 1$ (mod $3$), $ \equiv 2$ (mod $3$)? In other words, calculate $$s_{i,n}= \sum_{k\equiv i \;(\text{mod} \;3)} \binom{n}{k}$$ for $i=0,1,2$. Your result should be strong enough to permit direct evaluation of the numbers $s_{i,n}$ and to show clearly the relationship of $s_{0,n}, s_{1,n}$ and $s_{2,n}$ to each other for all positive integers $n$. In particular, show the relationships among these three sums for $n = 1000$.
On the side $AC$ of an acute triangle $\triangle ABC$, a point $D$ is taken such that $2AD=CD=2, BD\perp AC$. A circle of radius $2$ passes through $A$ and $D$ and is tangent to the circumcircle of $\triangle BDC$. Find $[\text{Area}(\triangle ABC)]$ where $[.]$ is the greatest integer function.
Given is a triangle $ABC$ and the points $M, P$ lie on the segments $AB, BC$, respectively, such that $AM=BC$ and $CP=BM$. If $AP$ and $CM$ meet at $O$ and $2\angle AOM=\angle ABC$, find the measure of $\angle ABC$.
Does every monotone increasing function $f : \mathbb[0,1] \rightarrow \mathbb[0,1]$ have a fixed point? What about every monotone decreasing function?
Given a positive integer $k,$ prove that for any integer $n \geq 20k,$ there exist $n - k$ pairwise distinct positive integers whose squares add up to $n(n + 1)(2n + 1)/6.$ [i]The Problem Selection Committee[/i]
[b]8.[/b] Let $(a_n)_{n=1}^{\infty}$ be a sequence of positive numbers and suppose that $\sum_{n=1}^{\infty} a_n^2$ is divergent. Let further $0<\epsilon<\frac{1}{2}$. Show that there exists a sequence $(b_n)_{n=1}^{\infty}$ of positive numbers such that $\sum_{n=1}^{\infty}b_n^2$ is convergent and $\sum_{n=1}^{N}a_n b_n >(\sum_{n=1}^{N}a_n^2)^{\frac{1}{2}-\epsilon}$ for every positive integer $N$. [b](S. 8)[/b]
Find all positive integers $n\geq1$ such that there exists a pair $(a,b)$ of positive integers, such that $a^2+b+3$ is not divisible by the cube of any prime, and $$n=\frac{ab+3b+8}{a^2+b+3}.$$
The altitude from one vertex of a triangle, the bisector from the another one and the median from the remaining vertex were drawn, the common points of these three lines were marked, and after this everything was erased except three marked points. Restore the triangle. (For every two erased segments, it is known which of the three points was their intersection point.) (A. Zaslavsky)
Prove that for any non-zero real numbers $a, b, c,$ \[\frac{(b+c-a)^2}{(b+c)^2+a^2} + \frac{(c+a-b)^2}{(c+a)^2+b^2} + \frac{(a+b-c)^2}{(a+b)^2+c^2} \geq \frac 35.\]
Let $P$ be a point outside a circle centered at $O$. From $P$, tangent lines are drawn to the circle, touching the circle at points $A$ and $B$. Ray $\overrightarrow{BO}$ is drawn intersecting the circle again at $C$ and intersecting ray $\overrightarrow{PA}$ at $Q$. If $3QA = 2AP$, what is the value of $\sin \angle CAQ$?
A positive integer $m$ is called self-descriptive in base $b$, where $b\ge2$ is an integer, if i) The representation of $m$ in base $b$ is of the form $(a_0a_1\ldots a_{b-1})_b$ (that is $m=a_0b^{b-1}+a_1b^{b-2}+\ldots+a_{b-2}b+a_{b-1}$, where $0\le a_i\le b-1$ are integers). ii) $a_i$ is equal to the number of occurences of the number $i$ in the sequence $(a_0a_1\ldots a_{b-1})$. For example, $(1210)_4$ is self-descriptive in base $4$, because it has four digits and contains one $0$, two $1$s, one $2$ and no $3$s.
Ada is taking a math test from 12:00 to 1:30, but her brother, Samuel, will be disruptive for two ten-minute periods during the test. If the probability that her brother is not disruptive while she is solving the challenge problem from 12:45 to 1:00 can be expressed as $\frac{m}{n}$, find $m+n$. [i]Proposed by Ada Tsui[/i]
Is it possible to cover the plane with (infinite) circles so that exactly $2020$ circles pass through each point on the plane?
Find all natural $ x $ for which $ 3x+1 $ and $ 6x-2 $ are perfect squares, and the number $ 6x^2-1 $ is prime.
Find all odd prime numbers $p$ for which there exists a natural number $g$ for which the sets \[A=\left\{ \left( {{k}^{2}}+1 \right)\,\bmod p|\,k=1,2,\ldots ,\frac{p-1}{2} \right\}\] and \[B=\left\{ {{g}^{k}}\bmod \,p|\,k=1,2,...,\frac{p-1}{2} \right\}\] are equal.
For each positive integers $u$ and $n$, say that $u$ is a [i]friend[/i] of $n$ if and only if there exists a positive integer $N$ that is a multiple of $n$ and the sum of digits of $N$ (in base 10) is equal to $u$. Determine all positive integers $n$ that only finitely many positive integers are not a friend of $n$.
Let $ABC$ be a triangle with circumcircle $\Gamma$ and $AB\neq AC$. Let $D$ and $E$ lie on the arc $BC$ of $\Gamma$ not containing $A$ such that $\angle BAE=\angle DAC$. Let the incenters of $BAE$ and $CAD$ be $X$ and $Y$, respectively, and let the external tangents of the incircles of $BAE$ and $CAD$ intersect at $Z$. Prove that $Z$ lies on the common chord of $\Gamma$ and the circumcircle of $AXY$.