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

Let $f$ and $g$ be two functions such that \[f(x)=\frac{1}{\lfloor | x | \rfloor}, \quad g(x)=\frac{1}{|\lfloor x \rfloor |}.\] Find the domains of $f$ and $g$ and then prove that \[\lim_{x \to -1^+} f(x)= \lim_{x \to 1^- } g(x).\]
Let $ABC$ a triangle inscribed in a circle $(O)$ with orthocenter $H$. Two lines $d_1$ and $d_2$ are mutually perpendicular at $H$. Let $d_1$ meet $BC,CA,AB$ at $X_1, Y_1,Z_1$ respectively. Let $A_1B_1C_1$ be a triangle formed by the line through $X_1$ perpendicular to $BC$, the line through $Y_1$ perpendicular to CA, the line through $Z_1$ perpendicular perpendicular to $AB$. Triangle $A_2B_2C_2$ is defined in the same manner. Prove that the circumcircles of triangles $A_1B_1C_1$ and $A_2B_2C_2$ touch each other at a point on $(O)$. Nguyễn Văn Linh
What is the smallest square-free composite number that can divide a number of the form $4242\ldots 42\pm 1$?
Find the least positive integer $k$ for which the equation $\lfloor \frac{2002}{n}\rfloor = k$ has no integer solutions for $n.$ (The notation $\lfloor x \rfloor$ means the greatest integer less than or equal to $x.$)
Let $A$ and $B$ be points in space such that $AB=1.$ Let $\mathcal{R}$ be the region of points $P$ for which $AP \le 1$ and $BP \le 1.$ Compute the largest possible side length of a cube contained in $\mathcal{R}.$
Let $ABC$ be a right triangle with $\angle A=90^o$ and $AB<AC$. Let $AH,AD,AM$ be altitude, angle bisector and median respectively. Prove that $\frac{BD}{CD}<\frac{HD}{MD}.$
Let $ABCD$ be a tangential quadrilateral with inscribed circle $k(O,r)$ which is tangent to the sides $BC$ and $AD$ at $K$ and $L$, respectively. Show that the circle with diameter $OC$ passes through the intersection point of $KL$ and $OD$. [i]Proposed by Ilija Jovchevski[/i]
Let $a_1, a_2, \cdots , a_n$ and $b_1, b_2,\cdots, b_n$ be nonnegative real numbers. Show that \[(a_1a_2 \cdots a_n)^{1/n}+ (b_1b_2 \cdots b_n)^{1/n} \le ((a_1 + b_1)(a_2 + b_2) \cdots (a_n + b_n))^{1/n}\]
$(BUL 5)$ Let $Z$ be a set of points in the plane. Suppose that there exists a pair of points that cannot be joined by a polygonal line not passing through any point of $Z.$ Let us call such a pair of points unjoinable. Prove that for each real $r > 0$ there exists an unjoinable pair of points separated by distance $r.$
Let $a_1, a_2, ..., a_n$ be more than one real numbers, such that $0\leq a_i\leq \frac{\pi}{2}$. Prove that $$\Bigg(\frac{1}{n}\sum_{i=1}^{n}\frac{1}{1+\sin a_i}\Bigg)\Bigg(1+\prod_{i=1}^{n}(\sin a_i)^{\frac{1}{n}}\Bigg)\leq1.$$
Fix positive integers $n$ and $k$, and $2n$ positive (not neccesarily distinct) real numbers $a_1,\cdots, a_n$, $b_1, \cdots, b_n$. An equation is written on a whiteboard: $$t=*\times*\times\cdots\times*$$ where $t$ is a fixed positive real number, with exactly $k$ asterisks. Ebi fills each asterisk with a number from $a_1, a_2,\cdots, a_n$, while Rubi fills each asterisk with a number from $b_1, b_2,\cdots, b_n$, so that the equation on the whiteboard is correct. Suppose for every positive real number $t$, the number of ways for Ebi and Rubi to do so are equal. Prove that the sequences $a_1,\cdots, a_n$ and $b_1, \cdots, b_n$ are permutations of each other. [i](Note: $t=a_1a_2a_3$ and $t=a_2a_3a_1$ are considered different ways to fill the asterisks, and the chosen terms need not be distinct, for example $t=a_1a_1a_2$.)[/i] [i]Proposed by Wong Jer Ren[/i]
[b]two variable ploynomial[/b] $P(x,y)$ is a two variable polynomial with real coefficients. degree of a monomial means sum of the powers of $x$ and $y$ in it. we denote by $Q(x,y)$ sum of monomials with the most degree in $P(x,y)$. (for example if $P(x,y)=3x^4y-2x^2y^3+5xy^2+x-5$ then $Q(x,y)=3x^4y-2x^2y^3$.) suppose that there are real numbers $x_1$,$y_1$,$x_2$ and $y_2$ such that $Q(x_1,y_1)>0$ , $Q(x_2,y_2)<0$ prove that the set $\{(x,y)|P(x,y)=0\}$ is not bounded. (we call a set $S$ of plane bounded if there exist positive number $M$ such that the distance of elements of $S$ from the origin is less than $M$.) time allowed for this question was 1 hour.
Real numbers $a_1,a_2,...,a_{16}$ satisfy the conditions $\sum_{i=1}^{16}a_i = 100$ and $\sum_{i=1}^{16}a_i^2 = 1000$ . What is the greatest possible value of $a_16$?
Solve in the set of real numbers the equation $ a^{[ x ]} +\log_a\{ x \} =x , $ where $ a $ is a real number from the interval $ (0,1). $ $ [] $ and $ \{\} $ [i]denote the floor, respectively, the fractional part.[/i]
$$Problem 3:$$ Is it possible to mark 10 red, 10 blue and 10 green points on a plane such that: For each red point A, the point (among the marked ones) closest to A is blue; for each blue point B, the point closest to B is green; and for each green point C, the point closest to C is red?
Find all prime numbers $p$ and $q$ such that\[p^3-3^q=10.\] [i]Proposed by Md. Fuad Al Alam[/i]
Triangle $ABC$ lies entirely inside a polygon. Prove that the perimeter of triangle $ABC$ is not greater than that of the polygon.
Let $ABCD$ be a trapezoid with $AB$ parallel to $CD$ and perpendicular to $BC$. Let $M$ be a point on $BC$ such that $\angle AMB = \angle DMC$. If $AB = 3$, $BC = 24$, and $CD = 4$, what is the value of $AM + MD$?
$A_1, A_2, \ldots, A_{29}$ are $29$ different sequences of positive integers. For $1 \leq i < j \leq 29$ and any natural number $x,$ we define $N_i(x) =$ number of elements of the sequence $A_i$ which are less or equal to $x,$ and $N_{ij}(x) =$ number of elements of the intersection $A_i \cap A_j$ which are less than or equal to $x.$ It is given for all $1 \leq i \leq 29$ and every natural number $x,$ \[ N_i(x) \geq \frac{x}{e}, \] where $e = 2.71828 \ldots$ Prove that there exist at least one pair $i,j$ ($1 \leq i < j \leq 29$) such that \[ N_{ij}(1988) > 200. \]
Determine whether there exists a polynomial $f(x_1, x_2)$ with two variables, with integer coefficients, and two points $A=(a_1, a_2)$ and $B=(b_1, b_2)$ in the plane, satisfying the following conditions: (i) $A$ is an integer point (i.e $a_1$ and $a_2$ are integers); (ii) $|a_1-b_1|+|a_2-b_2|=2010$; (iii) $f(n_1, n_2)>f(a_1, a_2)$ for all integer points $(n_1, n_2)$ in the plane other than $A$; (iv) $f(x_1, x_2)>f(b_1, b_2)$ for all integer points $(x_1, x_2)$ in the plane other than $B$. [i]Massimo Gobbino, Italy[/i]
On the side $BC$ of the triangle $ABC$ there are two points $D$ and $E$ such that $BD < BE$. Denote by $p_1$ and $p_2$ the perimeters of triangles $ABC$ and $ADE$ respectively. Prove that \[p_1 > p_2 + 2\cdot \min\{BD, EC\}.\]
Let $p(x)$ be a nonzero polynomial of degree less than $1992$ having no nonconstant factor in common with $x^3 -x$. Let $$ \frac{d^{1992}}{dx^{1992}} \left( \frac{p(x)}{x^3 -x } \right) =\frac{f(x)}{g(x)}$$ for polynomials $f(x)$ and $g(x).$ Find the smallest possible degree of $f(x)$.
Points $A, B, C, D$ lie on the sphere of radius $1$. It is known that $AB\cdot AC\cdot AD\cdot BC\cdot BD\cdot CD=\frac{512}{27}$. Prove that $ABCD$ is a regular tetrahedron.
In each side of a regular polygon with $n$ sides, we choose a point different from the vertices and we obtain a new polygon of $n$ sides. For which values of $n$ can we obtain a polygon such that the internal angles are all equal but the polygon isn't regular?