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

If reals $x, y, z $ satises $tan x + tan y + tan z = 2$ and $0 < x, y,z < \frac{\pi}{2}.$ Prove that $$sin^2 x + sin^2 y + sin^2 z < 1.$$
$1001$ marbles are drawn at random and without replacement from a jar of $2020$ red marbles and $n$ blue marbles. Find the smallest positive integer $n$ such that the probability that there are more blue marbles chosen than red marbles is strictly greater than $\frac{1}{2}$. [i]Proposed by Taiki Aiba[/i]
With $\sigma (n)$ we denote the sum of natural divisors of the natural number $n$. Prove that, if $n$ is the product of different prime numbers of the form $2^k-1$ for $k \in \mathbb{N}$($Mersenne's$ prime numbers) , than $\sigma (n)=2^m$, for some $m \in \mathbb{N}$. Is the inverse statement true?
Circle $k$ and its diameter $AB$ are given. Find the locus of the centers of circles inscribed in the triangles having one vertex on $AB$ and two other vertices on $k.$
In the square, the midpoints of the two sides were marked and the segments shown in the figure on the left were drawn. Which of the shaded quadrilaterals has the largest area? [img]https://cdn.artofproblemsolving.com/attachments/d/f/2be7bcda3fa04943687de9e043bd8baf40c98c.png[/img]
Prove that for any convex quadrilateral there exist an inellipse and circumellipse which are homothetic. Proposed by [i]Benny Wang + Oron Wang[/i]
Triangle $ABC$ is given with angles $\angle ABC = 60^o$ and $\angle BCA = 100^o$. On the sides AB and AC, the points $D$ and $E$ are chosen, respectively, in such a way that $\angle EDC = 2\angle BCD = 2\angle CAB$. Find the angle $\angle BED$.
Let $a$ and $c$ be fixed positive numbers. For each real number $t$ let $(x_t, y_t)$ be the vertex of the parabola $y = ax^2+bx+c$. If the set of vertices $(x_t, y_t)$ for all real values of $t$ is graphed in the plane, the graph is A. a straight line B. a parabola C. part, but not all, of a parabola D. one branch of a hyperbola E. None of these
Numbers $1, 2, 3, . . . , 100$ are arranged in a circle in some order. A [i]good pair[/i] is a pair of numbers of the same parity, between which there are exactly $3$ numbers. What is the smallest possible number good pairs?
Let $\{n,p\}\in\mathbb{N}\cup \{0\}$ such that $2p\le n$. Prove that $\frac{(n-p)!}{p!}\le \left(\frac{n+1}{2}\right)^{n-2p}$. Determine all conditions under which equality holds.
Define a function $f: \mathbb{N} \rightarrow \mathbb{N}$ to be $f(x)=(x+1)!-x!$. Find the number of positive integers $x<49$ such that $f(x)$ divides $f(49)$. [i]Proposed by David Tang[/i]
An [i]annulus[/i] is the region between two concentric circles. The concentric circles in the figure have radii $ b$ and $ c$, with $ b > c$. Let $ \overline{OX}$ be a radius of the larger circle, let $ \overline{XZ}$ be tangent to the smaller circle at $ Z$, and let $ \overline{OY}$ be the radius of the larger circle that contains $ Z$. Let $ a \equal{} XZ$, $ d \equal{} YZ$, and $ e \equal{} XY$. What is the area of the annulus? $ \textbf{(A)}\ \pi a^2 \qquad \textbf{(B)}\ \pi b^2 \qquad \textbf{(C)}\ \pi c^2 \qquad \textbf{(D)}\ \pi d^2 \qquad \textbf{(E)}\ \pi e^2$ [asy]unitsize(1.4cm); defaultpen(linewidth(.8pt)); dotfactor=3; real r1=1.0, r2=1.8; pair O=(0,0), Z=r1*dir(90), Y=r2*dir(90); pair X=intersectionpoints(Z--(Z.x+100,Z.y), Circle(O,r2))[0]; pair[] points={X,O,Y,Z}; filldraw(Circle(O,r2),mediumgray,black); filldraw(Circle(O,r1),white,black); dot(points); draw(X--Y--O--cycle--Z); label("$O$",O,SSW,fontsize(10pt)); label("$Z$",Z,SW,fontsize(10pt)); label("$Y$",Y,N,fontsize(10pt)); label("$X$",X,NE,fontsize(10pt)); defaultpen(fontsize(8pt)); label("$c$",midpoint(O--Z),W); label("$d$",midpoint(Z--Y),W); label("$e$",midpoint(X--Y),NE); label("$a$",midpoint(X--Z),N); label("$b$",midpoint(O--X),SE);[/asy]
Pooh has an unlimited supply of $1\times1$, $2\times2$, $3\times3$, and $4\times4$ squares. What is the minimum number of squares he needs to use in order to fully cover a $5\times5$ with no $2$ squares overlapping?
Find all functions $f : R \to R$ such that $$f(x + y) \ge xf(x) + yf(y)$$, for all $x, y \in R$ .
Find all (if there is one) functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all $x\in\mathbb{R}$, \[f(f(x))+xf(x)=1.\]
Let $ABCD$ be a parallelogram. Construct squares $ABC_1D_1, BCD_2A_2, CDA_3B_3, DAB_4C_4$ on the outer side of the parallelogram. Construct a square having $B_4D_1$ as one of its sides and it is on the outer side of $AB_4D_1$ and call its center $O_A$. Similarly do it for $C_1A_2, D_2B_3, A_3C_4$ to obtain $O_B, O_C, O_D$. Prove that $AO_A = BO_B = CO_C = DO_D$.
Find all functions $f: \mathbb{R}\to\mathbb{R}$ satisfying: $\frac{f(xy)+f(xz)}{2} - f(x)f(yz) \geq \frac{1}{4}$ for all $x,y,z \in \mathbb{R}$
At CMIMC headquarters, there is a row of $n$ lightbulbs, each of which is connected to a light switch. Daniel the electrician knows that exactly one of the switches doesn't work, and needs to find out which one. Every second, he can do exactly one of 3 things: [list] [*] Flip a switch, changing the lightbulb from off/on or on/off (unless the switch is broken). [*] Check if a given lightbulb is on or off. [*] Measure the total electricity usage of all the lightbulbs, which tells him exactly how many are currently on. [/list] Initially, all the lightbulbs are off. Daniel was given the very difficult task of finding the broken switch in at most $n$ seconds, but fortunately he showed up to work 10 seconds early today. What is the largest possible value $n$ such that he can complete his task on time? [i]Proposed by Adam Bertelli[/i]
If we fill $1\sim 16$ into $4\times4$ chessboard randomly. What is the possibility of the sum of each rows and columns are all even?
Let $k$ and $n$ be positive integers, with $k \geq 2$. In a straight line there are $kn$ stones of $k$ colours, such that there are $n$ stones of each colour. A [i]step[/i] consists of exchanging the position of two adjacent stones. Find the smallest positive integer $m$ such that it is always possible to achieve, with at most $m$ steps, that the $n$ stones are together, if: a) $n$ is even. b) $n$ is odd and $k=3$
For any positive integer n, let $\varphi(n)$ be the number of integers in the set $\{1, 2, \ldots , n\}$ whose greatest common divisor with $n$ is 1. Determine the maximum value of $\frac{n}{\varphi(n)}$ for $n$ in the set $\{2, \ldots, 1000\}$ and all values of $n$ for which this maximum is attained.
Let $ M (x,y)=x^2+xy-2y $ , x,y are positive integers a) Solve in positive integers $ x^2+xy-2y=64 $ b) Prove that if M (x,y) is a perfect square, then x+y+2 is composite if x>2.
Find all polynomials with integer coefficients such that for all positive integers $n$ satisfies $P(n!)=|P(n)|!$
Father moves $3$ steps forward just as son moves $5$ steps, but this while the father takes $6$ steps, the son does $7$ steps. At first, father and son are together, then the son begins to walk away from his father in a straight line. When the son has done $30$ steps, the father starts to follow him. In a few steps, Dad arrives after the son?
Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.