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 $P$ be a convex polygon, so have all interior angles smaller than $180^o$, and let $X$ be a point in the interior of $P$. Prove that $P$ has a side $[AB]$ such that the perpendicular from $X$ to the line $AB$ lies on the side $[AB]$.
Let us put pieces on some squares of $2n \times 2n$ chessboard in such a way that on every horizontal and vertical line there is an odd number of pieces. Prove that the whole number of pieces on the black squares is even.
Triangle $ABC$ has lengths $AB=20$, $AC=14$, $BC=22$. The median from $B$ intersects $AC$ at $M$ and the angle bisector from $C$ intersects $AB$ at $N$ and the median from $B$ at $P$. Let $\dfrac pq=\dfrac{[AMPN]}{[ABC]}$ for positive integers $p$, $q$ coprime. Note that $[ABC]$ denotes the area of triangle $ABC$. Find $p+q$.
Alphonse and Beryl play a game involving $n$ safes. Each safe can be opened by a unique key and each key opens a unique safe. Beryl randomly shuffles the $n$ keys, and after placing one key inside each safe, she locks all of the safes with her master key. Alphonse then selects $m$ of the safes (where $m < n$), and Beryl uses her master key to open just the safes that Alphonse selected. Alphonse collects all of the keys inside these $m$ safes and tries to use these keys to open up the other $n - m$ safes. If he can open a safe with one of the $m$ keys, he can then use the key in that safe to try to open any of the remaining safes, repeating the process until Alphonse successfully opens all of the safes, or cannot open any more. Let $P_m(n)$ be the probability that Alphonse can eventually open all $n$ safes starting from his initial selection of $m$ keys. (a) Show that $P_2(3) = \frac23$. (b) Prove that $P_1(n) = \frac1n$. (c) For all integers $n \geq 2$, prove that $$P_2(n) = \frac2n \cdot P_1(n-1) + \frac{n-2}{n} \cdot P_2(n-1).$$ (d) Determine a formula for $P_2 (n)$.
You should paint all the sides and diagonals of the regular $n$-gon so, that every pair of segments, having the common point, would be painted with different colours. How many colours will you require?
In convex quadrilateral $ABCD$, let $M$ and $N$ denote the midpoints of sides $AD$ and $BC$, respectively. On sides $AB$ and $CD$ are points $K$ and $L$, respectively, such that $\angle MKA=\angle NLC$. Prove that if lines $BD$, $KM$, and $LN$ are concurrent, then \[ \angle KMN = \angle BDC\qquad\text{and}\qquad\angle LNM=\angle ABD.\]
Consider $4n$ points in the plane, with no three points collinear. Using these points as vertices, we form $\binom{4n}{3}$ triangles. Show that there exists a point $X$ of the plane that belongs to the interior of at least $2n^3$ of these triangles.
The number of distinct pairs $(x,y)$ of real numbers satisfying both of the following equations: \begin{align*}x&=x^2+y^2, \\ y&=2xy\end{align*} is $\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad \textbf{(E) }4$
Prove that for all positive reals $a, b,c$ we have: $a +\sqrt{ab}+ \sqrt[3]{abc}\le \frac43 (a + b + c)$
Find the rightmost non-zero digit of the expansion of $(20)(13!)$.
Given an integer $h > 1$. Let's call a positive common fraction (not necessarily irreducible) [i]good[/i] if the sum of its numerator and denominator is equal to $h$. Let's say that a number $h$ is [i]remarkable[/i] if every positive common fraction whose denominator is less than $h$ can be expressed in terms of good fractions (not necessarily various) using the operations of addition and subtraction. Prove that $h$ is remarkable if and only if it is prime. (Recall that an common fraction has an integer numerator and a natural denominator.)
Consider pairs of the sequences of positive real numbers \[a_1\geq a_2\geq a_3\geq\cdots,\qquad b_1\geq b_2\geq b_3\geq\cdots\] and the sums \[A_n = a_1 + \cdots + a_n,\quad B_n = b_1 + \cdots + b_n;\qquad n = 1,2,\ldots.\] For any pair define $c_n = \min\{a_i,b_i\}$ and $C_n = c_1 + \cdots + c_n$, $n=1,2,\ldots$. (1) Does there exist a pair $(a_i)_{i\geq 1}$, $(b_i)_{i\geq 1}$ such that the sequences $(A_n)_{n\geq 1}$ and $(B_n)_{n\geq 1}$ are unbounded while the sequence $(C_n)_{n\geq 1}$ is bounded? (2) Does the answer to question (1) change by assuming additionally that $b_i = 1/i$, $i=1,2,\ldots$? Justify your answer.
The equations are given $$ \begin{array}{c} x^2 + p_1x + q_1 = 0\\ x^2 + p_2x + q_2 = 0\\ x^2 + p_3x + q_3 = 0 \end{array}$$ each two of which have a common root, but all three have no common root. Prove that: 1) $2 (p_1p_2 + p_2p_3 + p_3p_1) - (p_1^2 + p_2^2 + p_3^2) = 4 (q_1 + q_2+ q_3)$ 2) he roots of these equations are rational when the numbers $p_1$, $p_2$ and $p_3$ are rational}.
About the triangle $ABC$ it is known that $AM$ is its median, and $\angle AMC = \angle BAC$. On the ray $AM$ lies the point $K$ such that $\angle ACK = \angle BAC$. Prove that the centers of the circumcircles of the triangles $ABC, ABM$ and $KCM$ lie on the same line.
For the real number $a$ find the number of solutions $(x, y, z)$ of a system of the equations: $\left\{\begin{array}{lll} x+y^2+z^2=a \\ x^2+y+z^2=a \\ x^2+y^2+z=a\end{array}\right.$
In the rectangle $ABCD$ with $|AB|<2 |AD|$, let $E$ be the midpoint of $AB$ and $F$ a point on the chord $CE$ such that $\angle CFD = 90^o$. Prove that $FAD$ is an isosceles triangle.
Suppose that$ f : N \to N$ is an increasing function such that $f(f(n)) = 3n$ for all $n$. Find $f(1992)$.
Let $n$ be a positive integer. Let $A_n$ denote the set of primes $p$ such that there exists positive integers $a,b$ satisfying $$\frac{a+b}{p} \text{ and } \frac{a^n + b^n}{p^2}$$ are both integers that are relatively prime to $p$. If $A_n$ is finite, let $f(n)$ denote $|A_n|$. a) Prove that $A_n$ is finite if and only if $n \not = 2$. b) Let $m,k$ be odd positive integers and let $d$ be their gcd. Show that $$f(d) \leq f(k) + f(m) - f(km) \leq 2 f(d).$$
Find all integer-valued polynomials $$f, g : \mathbb{N} \rightarrow \mathbb{N} \text{ such that} \; \forall \; x \in \mathbb{N}, \tau (f(x)) = g(x)$$ holds for all positive integer $x$, where $\tau (x)$ is the number of positive factors of $x$ [i]Proposed By - ckliao914[/i]
Prove that there exist at least six points with rational coordinates on the curve of the equation \[y^3=x^3+x+1370^{1370}\]
If $125 + n + 135 + 2n + 145 = 900,$ find $n.$
Consider the following function \[g(x)=(\alpha+|x|)^{2}e^{(5-|x|)^{2}}\] [b]i)[/b] Find all the values of $\alpha$ for which $g(x)$ is continuous for all $x\in\mathbb{R}$ [b]ii)[/b]Find all the values of $\alpha$ for which $g(x)$ is differentiable for all $x\in\mathbb{R}$.
Determine twice differentiable functions $f: \mathbb{R} \rightarrow \mathbb{R}$ which verify relation \[ \left( f'(x) \right)^2 + f''(x) \leq 0, \forall x \in \mathbb{R}. \]
Does there exist an irreducible two variable polynomial $f(x,y)\in \mathbb{Q}[x,y]$ such that it has only four roots $(0,1),(1,0),(0,-1),(-1,0)$ on the unit circle.
Suppose $r$ is a real number for which \[ \left\lfloor r + \frac{19}{100} \right\rfloor + \left\lfloor r + \frac{20}{100} \right\rfloor + \left\lfloor r + \frac{21}{100} \right\rfloor + \cdots + \left\lfloor r + \frac{91}{100} \right\rfloor = 546. \] Find $\lfloor 100r \rfloor$. (For real $x$, $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.)