Found problems: 85335
Prove that $ \forall x\in \mathbb{R} $ , $ \cos ^7x+\cos ^7(x+\frac {2\pi}{3})+\cos ^7(x+\frac {4\pi}{3})=\frac {63}{64}\cos 3x $
With the conditions $a,b,c\in\mathbb{R^+}$ and $a+b+c=1$, prove that \[\frac{7+2b}{1+a}+\frac{7+2c}{1+b}+\frac{7+2a}{1+c}\geq\frac{69}{4}\]
Let $ABCD$ be a rectangle and denote by $M$ and $N$ the midpoints of $AD$ and $BC$ respectively. The point $P$ is on $(CD$ such that $D\in (CP)$, and $PM$ intersects $AC$ in $Q$. Prove that $m(\angle{MNQ})=m(\angle{MNP})$.
Let $ k$ and $ s$ be positive integers. For sets of real numbers $ \{\alpha_1, \alpha_2, \ldots , \alpha_s\}$ and $ \{\beta_1, \beta_2, \ldots, \beta_s\}$ that satisfy
\[ \sum^s_{i\equal{}1} \alpha^j_i \equal{} \sum^s_{i\equal{}1} \beta^j_i \quad \forall j \equal{} \{1,2 \ldots, k\}\]
we write \[ \{\alpha_1, \alpha_2, \ldots , \alpha_s\} \overset{k}{\equal{}} \{\beta_1, \beta_2, \ldots , \beta_s\}.\]
Prove that if \[ \{\alpha_1, \alpha_2, \ldots , \alpha_s\} \overset{k}{\equal{}} \{\beta_1, \beta_2, \ldots , \beta_s\}\] and $ s \leq k,$ then there exists a permutation $ \pi$ of $ \{1, 2, \ldots , s\}$ such that
\[ \beta_i \equal{} \alpha_{\pi(i)} \quad \forall i \equal{} 1,2, \ldots, s.\]
In an acute triangle $ABC$ with $AB<AC$, the foot of altitudes from $A,B,C$ to the sides $BC,CA,AB$ are $D,E,F$, respectively. $H$ is the orthocenter. $M$ is the midpoint of segment $BC$. Lines $MH$ and $EF$ intersect at $K$. Let the tangents drawn to circumcircle $(ABC)$ from $B$ and $C$ intersect at $T$. Prove that $T;D;K$ are colinear
Determine all strictly increasing functions $ f: R\rightarrow R$ satisfying relationship $ f(x\plus{}f(y))\equal{}f(x\plus{}y)\plus{}2005$
for any real values of x and y.
Prove that there are infinitely many quadruples of integers $(a,b,c,d)$ such that
\begin{align*}
a^2 + b^2 + 3 &= 4ab\\
c^2 + d^2 + 3 &= 4cd\\
4c^3 - 3c &= a
\end{align*}
[i]Travis Hance.[/i]
In triangle $ABC$, $AB=12$, $BC=17$, and $AC=25$. Distinct points $M$ and $N$ lie on the circumcircle of $ABC$ such that $BM=CM$ and $BN=CN$. If $AM + AN = \tfrac{a\sqrt{b}}{c}$, where $a, b, c$ are positive integers such that $\gcd(a, c) = 1$ and $b$ is not divisible by the square of a prime, compute $100a+10b+c$.
[i]Proposed by Michael Tang[/i]
The National Foundation of Happiness (NFoH) wants to estimate the happiness of people of country. NFoH selected $n$ random persons, and on every morning asked from each of them whether she is happy or not. On any two distinct days, exactly half of the persons gave the same answer. Show that after $k$ days, there were at most $n-\frac{n}{k}$ persons whose “yes” answers equals their “no” answers.
Given are positive integers $r$ and $k$ and an infinite sequence of positive integers $a_1 \le a_2 \le ...$ such that $\frac{r}{a_r}= k + 1$. Prove that there is a $t$ satisfying $\frac{t}{a_t}=k$.
The circle contains a closed $100$-part broken line, such that no three segments pass through one point. All its corners are obtuse, and their sum in degrees is divided by $720$. Prove that this broken line has an odd number of self-intersection points.
We call a two-variable polynomial $P(x, y)$ [i]secretly one-variable,[/i] if there exist polynomials $Q(x)$ and $R(x, y)$ such that $\deg(Q) \ge 2$ and $P(x, y) = Q(R(x, y))$ (e.g. $x^2 + 1$ and $x^2y^2 +1$ are [i]secretly one-variable[/i], but $xy + 1$ is not).
Prove or disprove the following statement: If $P(x, y)$ is a polynomial such that both $P(x, y)$ and $P(x, y) + 1$ can be written as the product of two non-constant polynomials, then $P$ is [i]secretly one-variable[/i].
[i]Note: All polynomials are assumed to have real coefficients. [/i]
For any positive integer $M$, the notation $M!$ denotes the product of the integers $1$ through $M$. What is the largest integer $n$ for which $5^n$ is a factor of the sum $98!+99!+100!$ ?
$\textbf{(A) }23\qquad\textbf{(B) }24\qquad\textbf{(C) }25\qquad\textbf{(D) }26\qquad\textbf{(E) }27$
(a) Does there exist a polynomial $ P(x)$ with coefficients in integers, such that $ P(d) \equal{} \frac{2008}{d}$ holds for all positive divisors of $ 2008$?
(b) For which positive integers $ n$ does a polynomial $ P(x)$ with coefficients in integers exists, such that $ P(d) \equal{} \frac{n}{d}$ holds for all positive divisors of $ n$?
Inside a square with side lengths $1$ a broken line of length $>1000$ without selfintersection is drawn.
Show that there is a line parallel to a side of the square that intersects the broken line in at least $501$ points.
If there is only $1$ complex solution to the equation $8x^3 + 12x^2 + kx + 1 = 0$, what is $k$?
Prove that the ratio $$\frac{1^1 + 3^3 + 5^5 + ...+ (2^{2013} - 1)^{(2^{2013} - 1)}}{2^{2013}}$$ is an odd integer.
A subset $S$ of positive real numbers is called [i]powerful[/i] if for any two distinct elements $a, b$ of $S$, at least one of $a^{b}$ or $b^{a}$ is also an element of $S$.
[b]a)[/b] Give an example of a four elements powerful set.
[b]b)[/b] Prove that every finite powerful set has at most four elements.
Find the number of 5-digit numbers that each contains the block '15' and is divisible by 15.
Let $ABCD$ be a parallelogram. Half-circles $\omega_1,\omega_2,\omega_3$ and $\omega_4$ with diameters $AB,BC,CD$ and $DA$, respectively, are erected on the exterior of $ABCD$. Line $l_1$ is parallel to $BC$ and cuts $\omega_1$ at $X$, segment $AB$ at $P$, segment $CD$ at $R$ and $\omega_3$ at $Z$. Line $l_2$ is parallel to $AB$ and cuts $\omega_2$ at $Y$, segment $BC$ at $Q$, segment $DA$ at $S$ and $\omega_4$ at $W$. If $XP\cdot RZ=YQ\cdot SW$, prove that $PQRS$ is cyclic.
[i]Proposed by José Alejandro Reyes González[/i]
Find all natural numbers $n$ for which $n2^{n-1} +1$ is a perfect square.
The $U$-tile is made up of $1 \times 1$ squares and has the following shape:
[img]https://cdn.artofproblemsolving.com/attachments/8/7/5795ee33444055794119a99e675ef977add483.png[/img]
where there are two vertical rows of a squares, one horizontal row of $b$ squares, and also $a \ge 2$ and $b \ge 3$.
Notice that there are different types of tile $U$ .
For example, some types of $U$ tiles are as follows:
[img]https://cdn.artofproblemsolving.com/attachments/0/3/ca340686403739ffbbbb578d73af76e81a630e.png[/img]
Prove that for each integer $n \ge 6$, the board of $n\times n$ can be completely covered with $U$-tiles ,
with no gaps and no overlapping clicks.
Clarifications: The $U$-tiles can be rotated. Any amount can be used in the covering of tiles of each type.
Let $a,b$ and $c$ be positive real numbers satisfying $abc=1.$ Prove that$$\frac{a^2-b^2}{a+bc}+\frac{b^2-c^2}{b+ca}+\frac{c^2-a^2}{c+ab}\leq a+b+c-3.$$
There are $100$ cities in a country, some of them being joined by roads. Any four cities are connected to each other by at least two roads. Assume that there is no path passing through every city exactly once. Prove that there are two cities such that every other city is connected to at least one of them.
Four points in space $A,B,C,D$ satisfy that $|AB|=3,|BC|=7,|CD|=11,|DA|=9$, then the number of values of $\overrightarrow{AC}\cdot\overrightarrow{BD}$ is
$\text{(A)}$ Only one.
$\text{(B)}$ Two.
$\text{(C)}$ Three.
$\text{(D)}$ Infinitely many.