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 $x_1, x_2, ..., x_n$ be positive reals. Prove that $$\sum_{k=1}^n \frac{x_k(2x_k - x_{k+1} - x_{k+2})}{x_{k+1} + x_{k+2}} \ge 0$$ In the sum, cyclic indices have been taken, that is, $x_{n+1} = x_1$ and $x_{n+2} = x_2$.
Let $ABC$ be a scalene triangle with orthocenter $H$ and circumcenter $O$. Let $P$ be the midpoint of $\overline{AH}$ and let $T$ be on line $BC$ with $\angle TAO=90^{\circ}$. Let $X$ be the foot of the altitude from $O$ onto line $PT$. Prove that the midpoint of $\overline{PX}$ lies on the nine-point circle* of $\triangle ABC$. *The nine-point circle of $\triangle ABC$ is the unique circle passing through the following nine points: the midpoint of the sides, the feet of the altitudes, and the midpoints of $\overline{AH}$, $\overline{BH}$, and $\overline{CH}$. [i]Proposed by Zack Chroman[/i]
Given a minor sector $AOB$ (Here minor means that $ \angle AOB <90$). $O$ is the centre , chose a point $C$ on arc $AB$ ,Let $P$ be a point on segment $OC$ , join $AP$ , $BP$ , draw a line through $B$ parallel to $AP$ , the line meet $OC$ at point $Q$ ,join $AQ$ . Prove that the area of polygon $AQPBO$ does not change when points $P,C$ move . [img]https://cdn.artofproblemsolving.com/attachments/3/e/4bdd3a20fe1df3fce0719463b55ef93e8b5d7b.png[/img]
Simplify the fraction: $\frac{(1^4+4)\cdot (5^4+4)\cdot (9^4+4)\cdot ... (69^4+4)\cdot(73^4+4)}{(3^4+4)\cdot (7^4+4)\cdot (11^4+4)\cdot ... (71^4+4)\cdot(75^4+4)}$.
Find $a$ if $a$ and $b$ are integers such that $x^2 - x - 1$ is a factor of $ax^{17} + bx^{16} + 1$.
The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?
Clara and Nick each randomly and independently pick an integer between $0$ and $2017$, inclusive. What is the probability that the two integers they pick sum to an even number?
Consider a function $f: \mathbb{Z} \rightarrow \mathbb{Z}$. We call an integer $a$ [i]spanning[/i] if for all integers $b \neq a$, there exists a positive integer $k$ with $f^k(a)=b$. Find, with proof, the maximum possible number of [i]spanning[/i] numbers of $f$. Note: $\mathbb{Z}$ represents the set of all integers, so $f$ is a function from the set of integers to itself. $f^k(a)$ is defined as $f$ applied $k$ times to $a$.
Let $a,b$ be real numbers. Prove the inequality \[ 2(a^4+a^2b^2+b^4)\ge 3(a^3b+ab^3).\]
Let $ a_n \equal{} 1 \plus{} 2 \plus{} ... \plus{} n$ for every $ n \ge 1$; the numbers $ a_n$ are called triangular. Prove that if $ 2a_m \equal{} a_n$ then $ a_{2m \minus{} n}$ is a perfect square.
A domino is a $2$ by $1$ rectangle . For what integers $m$ and $n$ can we cover an $m*n$ rectangle with non-overlapping dominoes???
Let $x_1,x_2,\dots,x_{2023}$ be pairwise different positive real numbers such that \[a_n=\sqrt{(x_1+x_2+\dots+x_n)\left(\frac{1}{x_1}+\frac{1}{x_2}+\dots+\frac{1}{x_n}\right)}\] is an integer for every $n=1,2,\dots,2023.$ Prove that $a_{2023} \geqslant 3034.$
Let $p\in(0,1)$ and $a>0$ be real numbers. Determine the asymptotic behavior of the sequence $\{a_n\}_{n=1}^\infty$ defined recursively by $$a_1=a,a_{n+1}=\frac{a_n}{1+a_n^p},n\in\mathbb N$$ [i]Proposed by Arkady Alt[/i]
Define two functions $g(x),\ f(x)\ (x\geq 0)$ by $g(x)=\int_0^x e^{-t^2}dt,\ f(x)=\int_0^1 \frac{e^{-(1+s^2)x}}{1+s^2}ds.$ Now we know that $f'(x)=-\int_0^1 e^{-(1+s^2)x}ds.$ (1) Find $f(0).$ (2) Show that $f(x)\leq \frac{\pi}{4}e^{-x}\ (x\geq 0).$ (3) Let $h(x)=\{g(\sqrt{x})\}^2$. Show that $f'(x)=-h'(x).$ (4) Find $\lim_{x\rightarrow +\infty} g(x)$ Please solve the problem without using Double Integral or Jacobian for those Japanese High School Students who don't study them.
Prove that $16<\sum_{i=1}^{80}\frac{1}{\sqrt{i}}<17$.
Prove that for any odd $ n $ there exists a unique polynomial $ P (x) $ $ n $ -th degree satisfying the equation $ P \left (x- \frac {1} {x} \right) = x ^ n- \frac {1} {x ^ n}. $ Is this true for any natural number $ n $?
Compute the sum of all positive integers $n$ for which the expression \[\frac{n+7}{\sqrt{n-1}}\] is an integer.
What are the last two digits of $2017^{2017}$?
How many ways are there to line up $19$ girls (all of different heights) in a row so that no girl has a shorter girl both in front of and behind her?
How many are there $10$-digit numbers composed from the digits $1, 2, 3$ only and in which, two neighbouring digits differ by $1$ : (A): $48$ (B): $64$ (C): $72$ (D): $128$ (E): None of the above.
Alice writes $1001$ letters on a blackboard, each one chosen independently and uniformly at random from the set $S=\{a, b, c\}$. A move consists of erasing two distinct letters from the board and replacing them with the third letter in $S$. What is the probability that Alice can perform a sequence of moves which results in one letter remaining on the blackboard? [i]Proposed by Daniel Zhu.[/i]
Solve the system of equations: $ \sqrt {3x}(1 \plus{} \frac {1}{x \plus{} y}) \equal{} 2$ $ \sqrt {7y}(1 \minus{} \frac {1}{x \plus{} y}) \equal{} 4\sqrt {2}$
A quadrilateral $ABCD$ without parallel sidelines is circumscribed around a circle centered at $I$. Let $K, L, M$ and $N$ be the midpoints of $AB, BC, CD$ and $DA$ respectively. It is known that $AB \cdot CD = 4IK \cdot IM$. Prove that $BC \cdot AD = 4IL \cdot IN$.
For a positive integer $n$ consider any partition of the set $\{ 1,2,\ldots ,2n \}$ into $n$ two-element subsets $P_1,P_2\ldots,P_n$. In each subset $P_i$, let $p_i$ be the product of the two numbers in $P_i$. Prove that \[\frac{1}{p_1}+\frac{1}{p_2}+\ldots + \frac{1}{p_n}<1 \]
Find with proof all non–zero real numbers $a$ and $b$ such that the three different polynomials $x^2 + ax + b, x^2 + x + ab$ and $ax^2 + x + b$ have exactly one common root.