Found problems: 85335
2024 China Girls Math Olympiad, 7
Let $n$ be a positive integer. If $x_1, x_2, \ldots, x_n \geq 0$, $x_1+x_2+\ldots+x_n=1$ and, assuming $x_{n+1}=x_1$, find the maximal value of $$\sum_{k=1}^n \frac{1+x_k^2+x_k^4}{1+x_{k+1}+x_{k+1}^2+x_{k+1}^3+x_{k+1}^4}.$$
2008 F = Ma, 25
Two satellites are launched at a distance $R$ from a planet of negligible radius. Both satellites are launched in the tangential direction. The first satellite launches correctly at a speed $v_\text{0}$ and enters a circular orbit. The second satellite, however, is launched at a speed $\frac{1}{2}v_\text{0}$. What is the minimum distance between the second satellite and the planet over the course of its orbit?
(a) $\frac{1}{\sqrt{2}}R$
(b) $\frac{1}{2}R$
(c) $\frac{1}{3}R$
(d) $\frac{1}{4}R$
(e) $\frac{1}{7}R$
2004 AMC 8, 12
Niki usually leaves her cell phone on. If her cell phone is on but she is not actually using it, the battery will last for $24$ hours. If she is using it constantly, the battery will last for only $3$ hours. Since the last recharge, her phone has been on $9$ hours, and during that time she has used it for $60$ minutes. If she doesn't talk any more but leaves the phone on, how many more hours will the battery last?
$\textbf{(A)}\ 7\qquad
\textbf{(B)}\ 8\qquad
\textbf{(C)}\ 11\qquad
\textbf{(D)}\ 14\qquad
\textbf{(E)}\ 15$
2017 India IMO Training Camp, 3
Let $a$ be a positive integer which is not a perfect square, and consider the equation \[k = \frac{x^2-a}{x^2-y^2}.\] Let $A$ be the set of positive integers $k$ for which the equation admits a solution in $\mathbb Z^2$ with $x>\sqrt{a}$, and let $B$ be the set of positive integers for which the equation admits a solution in $\mathbb Z^2$ with $0\leq x<\sqrt{a}$. Show that $A=B$.
2003 Italy TST, 3
Let $p(x)$ be a polynomial with integer coefficients and let $n$ be an integer. Suppose that there is a positive integer $k$ for which $f^{(k)}(n) = n$, where $f^{(k)}(x)$ is the polynomial obtained as the composition of $k$ polynomials $f$. Prove that $p(p(n)) = n$.
2014 Contests, 4
Let $f,g$ are defined in $(a,b)$ such that $f(x),g(x)\in\mathcal{C}^2$ and non-decreasing in an interval $(a,b)$ . Also suppose $f^{\prime \prime}(x)=g(x),g^{\prime \prime}(x)=f(x)$. Also it is given that $f(x)g(x)$ is linear in $(a,b)$. Show that $f\equiv 0 \text{ and } g\equiv 0$ in $(a,b)$.
2013 Today's Calculation Of Integral, 897
Find the volume $V$ of the solid formed by a rotation of the region enclosed by the curve $y=2^{x}-1$ and two lines $x=0,\ y=1$ around the $y$ axis.
2023 Assam Mathematics Olympiad, 13
Let $S(r)$ denote the sum of the infinite geometric series $17 + 17r + 17r^2 +17r^3 + . . . $for $-1 < r < 1$. If $S(a) \times S(-a) = 2023$, find $S(a) + S(-a)$.
Russian TST 2020, P3
Let $n>1$ be an integer. Suppose we are given $2n$ points in the plane such that no three of them are collinear. The points are to be labelled $A_1, A_2, \dots , A_{2n}$ in some order. We then consider the $2n$ angles $\angle A_1A_2A_3, \angle A_2A_3A_4, \dots , \angle A_{2n-2}A_{2n-1}A_{2n}, \angle A_{2n-1}A_{2n}A_1, \angle A_{2n}A_1A_2$. We measure each angle in the way that gives the smallest positive value (i.e. between $0^{\circ}$ and $180^{\circ}$). Prove that there exists an ordering of the given points such that the resulting $2n$ angles can be separated into two groups with the sum of one group of angles equal to the sum of the other group.
PEN H Problems, 36
Prove that the equation $a^2 +b^2 =c^2 +3$ has infinitely many integer solutions $(a, b, c)$.
2014 Contests, 3
Let $1000 \leq n = \text{ABCD}_{10} \leq 9999$ be a positive integer whose digits $\text{ABCD}$ satisfy the divisibility condition: $$1111 | (\text{ABCD} + \text{AB} \times \text{CD}).$$ Determine the smallest possible value of $n$.
1998 Miklós Schweitzer, 3
Let p be a prime and $f: Z_p \to C$ a complex valued function defined on a cyclic group of order p. Define the Fourier transform of f by the formula:
$$\hat f (k) = \sum_{l = 0}^{p-1} f (l) e^{i2\pi kl / p}\qquad(k \in Z_p)$$
Show that if the combined number of zeros of f and $\hat f$ is at least p, then f is identically zero.
related:
[url]https://artofproblemsolving.com/community/c7h22594[/url]
2019 Harvard-MIT Mathematics Tournament, 1
How many distinct permutations of the letters in the word REDDER are there that do not contain a palindromic substring of length at least two? (A [i]substring[/i] is a continuous block of letters that is part of the string. A string is [i]palindromic[/i] if it is the same when read backwards.)
2018 ELMO Shortlist, 1
Determine all nonempty finite sets of positive integers $\{a_1, \dots, a_n\}$ such that $a_1 \cdots a_n$ divides $(x + a_1) \cdots (x + a_n)$ for every positive integer $x$.
[i]Proposed by Ankan Bhattacharya[/i]
2001 China Team Selection Test, 2
Let $\theta_i \in \left ( 0,\frac{\pi}{4} \right ]$ for $i=1,2,3,4$. Prove that:
$\tan \theta _1 \tan \theta _2 \tan \theta _3 \tan \theta _4 \le (\frac{\sin^8 \theta _1+\sin^8 \theta _2+\sin^8 \theta _3+\sin^8 \theta _4}{\cos^8 \theta _1+\cos^8 \theta _2+\cos^8 \theta _3+\cos^8 \theta _4})^\frac{1}{2}$
[hide=edit]@below, fixed now. There were some problems (weird characters) so aops couldn't send it.[/hide]
2012 Czech-Polish-Slovak Junior Match, 4
Prove that among any $51$ vertices of the $101$-regular polygon there are three that are the vertices of an isosceles triangle.
2011 Bosnia Herzegovina Team Selection Test, 1
Find maximum value of number $a$ such that for any arrangement of numbers $1,2,\ldots ,10$ on a circle, we can find three consecutive numbers such their sum bigger or equal than $a$.
2013 VJIMC, Problem 1
Let $f:[0,\infty)\to\mathbb R$ be a differentiable function with $|f(x)|\le M$ and $f(x)f'(x)\ge\cos x$ for $x\in[0,\infty)$, where $M>0$. Prove that $f(x)$ does not have a limit as $x\to\infty$.
2023 Girls in Mathematics Tournament, 3
Let $S$ be a set not empty of positive integers and $AB$ a segment with, initially, only points $A$ and $B$ colored by red. An operation consists of choosing two distinct points $X, Y$ colored already by red and $n\in S$ an integer, and painting in red the $n$ points $A_1, A_2,..., A_n$ of segment $XY$ such that $XA_1= A_1A_2= A_2A_3=...= A_{n-1}A_n= A_nY$ and $XA_1<XA_2<...<XA_n$. Find the least positive integer $m$ such exists a subset $S$ of $\{1,2,.., m\}$ such that, after a finite number of operations, we can paint in red the point $K$ in the segment $AB$ defined by $\frac{AK}{KB}= \frac{2709}{2022}$. Also, find the number of such subsets for such a value of $m$.
1967 IMO, 1
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.\]
1995 India Regional Mathematical Olympiad, 4
Show that the quadratic equation $x^2 + 7x - 14 (q^2 +1) =0$ , where $q$ is an integer, has no integer root.
2005 Kurschak Competition, 2
A and B play tennis. The player to first win at least four points and at least two more than the other player wins. We know that A gets a point each time with probability $p\le \frac12$, independent of the game so far. Prove that the probability that A wins is at most $2p^2$.
2004 May Olympiad, 5
There are $90$ cards and two different digits are written on each one: $01$, $02$, $03$, $04$, $05$, $06$, $07$, $08$, $09$, $10$, $12$, and so on up to $98$. A set of cards is [i]correct [/i]if it does not contain any cards whose first digit is the same as the second digit of another card in the set. We call the [i]value [/i]of a set of cards the sum of the numbers written on each card. For example, the four cards $04$, $35$, $78$ and $98$ form a correct set and their value is $215$, since$ 04+35+78+98=215$. Find a correct set that has the largest possible value. Explain why it is impossible to achieve a correct set of higher value.
2002 Baltic Way, 14
Let $L,M$ and $N$ be points on sides $AC,AB$ and $BC$ of triangle $ABC$, respectively, such that $BL$ is the bisector of angle $ABC$ and segments $AN,BL$ and $CM$ have a common point. Prove that if $\angle ALB=\angle MNB$ then $\angle LNM=90^{\circ}$.
MBMT Team Rounds, 2020.21
Matthew Casertano and Fox Chyatte make a series of bets. In each bet, Matthew sets the stake (the amount he wins or loses) at half his current amount of money. He has an equal chance of winning and losing each bet. If he starts with \$256, find the probability that after 8 bets, he will have at least \$50.
[i]Proposed by Jeffrey Tong[/i]