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

No two of $20$ students in a class have the same scores on both written and oral examinations in mathematics. We say that student $A$ is better than $B$ if his two scores are greater than or equal to the corresponding scores of $B$. The scores are integers between $1$ and $10$. (a) Show that there exist three students $A,B,C$ such that $A$ is better than $B$ and $B$ is better than $C$. (b) Would the same be true for a class of $19$ students?
Points $ A’,B,C’ $ are arbitrarily taken on edges $ SA,SB, $ respectively, $ SC $ of a tetrahedron $ SABC. $ Plane forrmed by $ ABC $ intersects the plane $ \rho , $ formed by $ A’B’C’, $ in a line $ d. $ Prove that, meanwhile the plane $ \rho $ rotates around $ d, $ the lines $ AA’,BB’ $ and $ CC’ $ are, and remain concurrent. Find de locus of the respective intersections.
Let $f(t)$ be the cubic polynomial for $t$ such that $\cos 3x=f(\cos x)$ holds for all real number $x$. Evaluate \[\int_0^1 \{f(t)\}^2 \sqrt{1-t^2}dt\]
In a convex quadrilateral $ABCD$ we have $ADC = 90^{\circ}$. Let $E$ and $F$ be the projections of $B$ onto the lines $AD$ and $AC$, respectively. Assume that $F$ lies between $A$ and $C$, that $A$ lies between $D$ and $E$, and that the line $EF$ passes through the midpoint of the segment $BD$. Prove that the quadrilateral $ABCD$ is cyclic.
Show that every natural number $n\leq2^{1\;000\;000}$ can be obtained first with 1 doing less than $1\;100\;000$ sums; more precisely, there is a finite sequence of natural numbers $x_0,\ x_1,\dots,\ x_k\mbox{ with }k\leq1\;100\;000,\ x_0=1,\ x_k=n$ such that for all $i=1,\ 2,\dots,\ k$ there exist $r,\ s$ with $0\leq{r}\leq{s}<i$ such that $x_i=x_r+x_s$.
Let $n$ be a positive integer and let $p$ be a prime number. Prove that if $a$, $b$, $c$ are integers (not necessarily positive) satisfying the equations \[ a^n + pb = b^n + pc = c^n + pa\] then $a = b = c$. [i]Proposed by Angelo Di Pasquale, Australia[/i]
Let $C$ be a closed plane curve that has a continuously turning tangent and bounds a convex region. If $T$ is a triangle inscribed in $C$ with maximum perimeter, show that the normal to $C$ at each vertex of $T$ bisects the angle of $T$ at that vertex. If a triangle $T$ has the property just described, does it necessarily have maximum perimeter? What is the situation if $C$ is a circle?
Given a triangle $ABC$ with $M$ the midpoint of minor arc $BC$. Let $H$ be the feet of altitude from $A$ to $BC$. Let $S$ and $T$ be the reflections of $B$ and $C$ with respect to line $AM$. Suppose the circle $(HST)$ meets $BC$ again at a point $P$. Prove that $\angle AMP = 90^\circ$. [i](Proposed by Tan Rui Xuen)[/i]
Let $F_{n}$ be the $n-$ th Fibonacci number (where $F_{1}= F_{2}= 1$). Consider the functions $f_{n}(x)=\parallel . . . \parallel |x|-F_{n}|-F_{n-1}|-...-F_{2}|-F_{1}|, g_{n}(x)=| . . . \parallel x-1|-1|-...-1|$ ($F_{1}+...+F_{n}$ one’s). Show that $f_{n}(x) = g_{n}(x)$ for every real number $x.$
Determine all functions $f:(0,\infty)\to\mathbb{R}$ satisfying $$\left(x+\frac{1}{x}\right)f(y)=f(xy)+f\left(\frac{y}{x}\right)$$ for all $x,y>0$.
In a certain family, a husband and wife made the following agreement: If the wife washes the dishes one day, the husband washes the dishes the next day. However, if the husband washes the dishes one day, then who washes the dishes the next day is decided by drawing a coin. Let $ p_n $ denote the probability of the event that the husband washes the dishes on the $ n $-th day of the contract. Prove that there is a limit $ \lim_{n\to \infty} p_n $ and calculate it. We assume $ p_1 = \frac{1}{2} $.
If it is possible to find six elements, whose sum are divisible by $6$, from every set with $n$ elements, what is the least $n$ ? $\textbf{(A)}\ 13 \qquad\textbf{(B)}\ 12 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 10 \qquad\textbf{(E)}\ 9$
Carl, James, Saif, and Ted play several games of two-player For The Win on the Art of Problem Solving website. If, among these games, Carl wins $5$ and loses $0,$ James wins $4$ and loses $2,$ Saif wins $1$ and loses $6,$ and Ted wins $4,$ how many games does Ted lose?
It can be shown that there exists a unique polynomial $P$ in two variables such that for all positive integers $m$ and $n,$ $$P(m,n)=\sum_{i=1}^m\sum_{i=1}^n (i+j)^7.$$ Compute $P(3,-3).$
Let $p \geq 5$ be a prime. (a) Show that exists a prime $q \neq p$ such that $q| (p-1)^{p}+1$ (b) Factoring in prime numbers $(p-1)^{p}+1 = \prod_{i=1}^{n}p_{i}^{a_{i}}$ show that: \[\sum_{i=1}^{n}p_{i}a_{i}\geq \frac{p^{2}}2 \]
What is the sum of the first $31$ integers that can be written as a sum of distinct powers of $3$?
On a cartesian plane a parabola $y = x^2$ is drawn. For a given $k > 0$ we consider all trapezoids inscribed into this parabola with bases parallel to the x-axis, and the product of the lengths of their bases is exactly $k$. Prove that the diagonals of all such trapezoids share a common point.
Let $\mathbb{Q}^+$ be the set of all positive rational numbers. Find all functions $f:\mathbb{Q}^+\rightarrow \mathbb{Q}^+$ satisfying $f(1)=1$ and \[ f(x+n)=f(x)+nf(\frac{1}{x}) \forall n\in\mathbb{N},x\in\mathbb{Q}^+\]
Let $d_n(x)$ be the $n$-th decimal digit (after the decimal point) of $x$. For example, $d_3(\pi) = 1$ because $\pi = 3.14\underline{1}5...$ For a positive integer $k$, let $f(k) = p^4_k$, where $p_k$ is the $k$-th prime number. Compute the value of $$\sum^{2023}_{i=1} d_{f(i)} \left( \frac{1}{1275}\right).$$
The area of a square is $144$. An equilateral triangle has the same perimeter as the square. The area of a regular hexagon is $6$ times the area of the equilateral triangle. What is the perimeter of the hexagon?
Let $c \ge 1$ be an integer. Define a sequence of positive integers by $a_1 = c$ and \[a_{n+1}=a_n^3-4c\cdot a_n^2+5c^2\cdot a_n+c\] for all $n\ge 1$. Prove that for each integer $n \ge 2$ there exists a prime number $p$ dividing $a_n$ but none of the numbers $a_1 , \ldots , a_{n -1}$ . [i]Proposed by Austria[/i]
Prove that we can find an infinite set of positive integers of the from $2^n-3$ (where $n$ is a positive integer) every pair of which are relatively prime.
Let $a_{i}$ and $b_{i}$, where $i \in \{1,2, \dots, 2005 \}$, be real numbers such that the inequality $(a_{i}x-b_{i})^{2} \ge \sum_{j=1, j \not= i}^{2005} (a_{j}x-b_{j})$ holds for all $x \in \mathbb{R}$ and all $i \in \{1,2, \dots, 2005 \}$. Find the maximum possible number of positive numbers amongst $a_{i}$ and $b_{i}$, $i \in \{1,2, \dots, 2005 \}$.
The polynomial $x^8 +x^7$ is written on a blackboard. In a move, Peter can erase the polynomial $P(x)$ and write down $(x+1)P(x)$ or its derivative $P'(x).$ After a while, the linear polynomial $ax+b$ with $a\ne 0$ is written on the board. Prove that $a-b$ is divisible by $49.$
Let $P(x) = x^4 + ax^3 + bx^2 + cx + d$ and $Q(x) = x^2 + px + q$be two real polynomials. Suppose that there exista an interval $(r,s)$ of length greater than $2$ SUCH THAT BOTH $P(x)$ AND $Q(x)$ ARE nEGATIVE FOR $X \in (r,s)$ and both are positive for $x > s$ and $x<r$. Show that there is a real $x_0$ such that $P(x_0) < Q(x_0)$