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

An integer $z$ is said to be a [i]friendly [/i] integer if $|z|$ is not the square of an integer. Determine all integers $n$ such that there exists an infinite number of triplets of distinct friendly integers $(a, b, c)$ such that $n = a+b+c$ and $abc$ is the square of an odd integer.
Consider an acute triangle $ABC$ of area $S$. Let $CD \perp AB$ ($D \in AB$), $DM \perp AC$ ($M \in AC$) and $DN \perp BC$ ($N \in BC$). Denote by $H_1$ and $H_2$ the orthocentres of the triangles $MNC$, respectively $MND$. Find the area of the quadrilateral $AH_1BH_2$ in terms of $S$.
Paul wrote the list of all four-digit numbers such that the hundreds digit is $5$ and the tens digit is $7$. For example, $1573$ and $7570$ are on Paul's list, but $2754$ and $571$ are not. Find the sum of all the numbers on Pablo's list. $Note$. The numbers on Pablo's list cannot start with zero.
(1) Find the range of $a$ for which there exist two common tangent lines of the curve $y=\frac{8}{27}x^3$ and the parabola $y=(x+a)^2$ other than the $x$ axis. (2) For the range of $a$ found in the previous question, express the area bounded by the two tangent lines and the parabola $y=(x+a)^2$ in terms of $a$.
Consider a circle of radius $6$. Let $B,C,D$ and $E$ be points on the circle such that $BD$ and $CE$, when extended, intersect at $A$. If $AD$ and $AE$ have length $5$ and $4$ respectively, and $DBC$ is a right angle, then show that the length of $BC$ is $\frac{12+9\sqrt{15}}{5}$.
Call an ordered pair $(a, b)$ of positive integers [i]fantastic [/i] if and only if $a, b \le 10^4$ and $$gcd(a \cdot n! - 1, a \cdot (n + 1)! + b) > 1$$ for infinitely many positive integers $n$. Find the sum of $a + b$ across all fantastic pairs $(a, b)$.
Let $ T$ be the set of all positive integer divisors of $ 2004^{100}$. What is the largest possible number of elements of a subset $ S$ of $ T$ such that no element in $ S$ divides any other element in $ S$?
Let $D_{x,y}$ denote the half-disk of radius $1$ with its curved boundary externally tangent to the unit circle at the point $(x, y)$, such that the straight boundary of the disk is parallel to the tangent line (so the point of tangency is the middle of the curved boundary). Find the area of the union of the $D_{x,y}$ over all $(x, y)$ with $x^2 + y^2 = 1$ (that is, $(x,y)$ is on the unit circle).
For a constant $a,$ let $f(x)=ax\sin x+x+\frac{\pi}{2}.$ Find the range of $a$ such that $\int_{0}^{\pi}\{f'(x)\}^{2}\ dx \geq f\left(\frac{\pi}{2}\right).$
Prove the following inequality. \[n^ne^{-n+1}\leq n!\leq \frac 14(n+1)^{n+1}e^{-n+1}.\]
The polynomial $ W(x) = x^4 + ax^3 + bx + cx + d $ is given. Prove that if the equation $ W(x) = 0 $ has four real roots, then for there to exist $ m $ such that $ W(x+m) = x^4+px^2+q $, it is necessary and it is enough that the sum of certain two roots of the equation $ W(x) = 0 $ equals the sum of the remaining ones.
Is it possible to find $2005$ different positive square numbers such that their sum is also a square number ?
Point $D$ is inside $\triangle ABC$ and $AD=DC$. $BD$ intersect $AC$ in $E$. $\frac{BD}{BE}=\frac{AE}{EC}$. Prove, that $BE=BC$
Let "AB" and $CD$ be two perpendicular chords of a circle with centre $O$ and radius $r$ and let $X,Y,Z,W$ denote the cyclical order of the four parts into which the disc is thus divided. Find the maximum and minimum of the quantity \[ \frac{A(X) + A(Z)}{A(Y) + A(W)}, \] where $A(U)$ denotes the area of $U.$
Find all positive integers $N$ such that there exists a triangle which can be dissected into $N$ similar quadrilaterals. [i]Proposed by Nikolai Beluhov (Bulgaria) and Morteza Saghafian[/i]
Let $\triangle$$ABC$ a triangle with circumcircle $\Gamma$. Suppose there exist points $R$ and $S$ on sides $AB$ and $AC$, respectively, such that $BR=RS=SC$. A tangent line through $A$ to $\Gamma$ meet the line $RS$ at $P$. Let $I$ the incenter of triangle $\triangle$$ARS$. Prove that $PA=PI$
[b]p1.[/b] Four witches are riding their brooms around a circle with circumference $10$ m. They are standing at the same spot, and then they all start to ride clockwise with the speed of $1$, $2$, $3$, and $4$ m/s, respectively. Assume that they stop at the time when every pair of witches has met for at least two times (the first position before they start counts as one time). What is the total distance all the four witches have travelled? [b]p2.[/b] Suppose $A$ is an equilateral triangle, $O$ is its inscribed circle, and $B$ is another equilateral triangle inscribed in $O$. Denote the area of triangle $T$ as $[T]$. Evaluate $\frac{[A]}{[B]}$. [b]p3. [/b]Tim has bought a lot of candies for Halloween, but unfortunately, he forgot the exact number of candies he has. He only remembers that it's an even number less than $2020$. As Tim tries to put the candies into his unlimited supply of boxes, he finds that there will be $1$ candy left if he puts seven in each box, $6$ left if he puts eleven in each box, and $3$ left if he puts thirteen in each box. Given the above information, find the total number of candies Tim has bought. [b]p4.[/b] Let $f(n)$ be a function defined on positive integers n such that $f(1) = 0$, and $f(p) = 1$ for all prime numbers $p$, and $$f(mn) = nf(m) + mf(n)$$ for all positive integers $m$ and $n$. Let $$n = 277945762500 = 2^23^35^57^7$$ Compute the value of $\frac{f(n)}{n}$ . [b]p5.[/b] Compute the only positive integer value of $\frac{404}{r^2-4}$ , where $r$ is a rational number. [b]p6.[/b] Let $a = 3 +\sqrt{10}$ . If $$\prod^{\infty}_{k=1} \left( 1 + \frac{5a + 1}{a^k + a} \right)= m +\sqrt{n},$$ where $m$ and $n$ are integers, find $10m + n$. [b]p7.[/b] Charlie is watching a spider in the center of a hexagonal web of side length $4$. The web also consists of threads that form equilateral triangles of side length $1$ that perfectly tile the hexagon. Each minute, the spider moves unit distance along one thread. If $\frac{m}{n}$ is the probability, in lowest terms, that after four minutes the spider is either at the edge of her web or in the center, find the value of $m + n$. [b]p8.[/b] Let $ABC$ be a triangle with $AB = 10$; $AC = 12$, and $\omega$ its circumcircle. Let $F$ and $G$ be points on $\overline{AC}$ such that $AF = 2$, $FG = 6$, and $GC = 4$, and let $\overrightarrow{BF}$ and $\overrightarrow{BG}$ intersect $\omega$ at $D$ and $E$, respectively. Given that $AC$ and $DE$ are parallel, what is the square of the length of $BC$? [b]p9.[/b] Two blue devils and $4$ angels go trick-or-treating. They randomly split up into $3$ non-empty groups. Let $p$ be the probability that in at least one of these groups, the number of angels is nonzero and no more than the number of devils in that group. If $p = \frac{m}{n}$ in lowest terms, compute $m + n$. [b]p10.[/b] We know that$$2^{22000} = \underbrace{4569878...229376}_{6623\,\,\, digits}.$$ For how many positive integers $n < 22000$ is it also true that the first digit of $2^n$ is $4$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
A game of solitaire strats of with $25$ cards. Some are facing up and sum are facing down. In each move a card that's facing up should me choosen, taken away, and turning over the cards next to it (if there are cards next to it). The game is won when you have accomplished to take all the $25$ cards from the table. If you initially start with $n$ cards facing up, find all the values of $n$ such that the game can be won. Explain how to win the game, independently from the initial placement of the cards facing up, justify your answer for why it is impossible to win with other values of $n$. Two cards are neighboring when one is immediately next to the other, to the left or right. Example: The card marked $A$ has two neighboring cards and the one marked with only a $B$ has only one neighboring card. After taking a card there is a hole left, such that the card marked $C$ has only one neighboring card, and the one marked $D$ does'nt have any.
Let $a,b,c>0$ satisfy $a\geq b\geq c$. Prove that $$\frac{4}{a^2(b+c)}+\frac{4}{b^2(c+a)}+\frac{4}{c^2(a+b)} \leq \left(\sum_{cyc} \frac{a^2+1} {b^2} \right)\left(\sum_{cyc} \frac{b^3}{a^2(a^3+2b^3)}\right).$$
A and B plays a game on a pyramid whose base is a $2016$-gon. In each turn, a player colors a side (which was not colored before) of the pyramid using one of the $k$ colors such that none of the sides with a common vertex have the same color. If A starts the game, find the minimal value of $k$ for which $B$ can guarantee that all sides are colored.
Prove that for each prime $p>2$ there exists exactly one positive integer $n$, such that $n^2+np$ is a perfect square.
How $arc \sin(\cos(arc \sin x))$ and $arc \cos(\sin(arc \cos x))$ are related with each other?
In a tetrahedron of volume $V$ the sum of the squares of the lengths of its edges equals $S$. Prove that $$V \le \frac{S\sqrt{S}}{72\sqrt{3}}$$
Let $n$ be a positive integer. Each point $(x,y)$ in the plane, where $x$ and $y$ are non-negative integers with $x+y<n$, is coloured red or blue, subject to the following condition: if a point $(x,y)$ is red, then so are all points $(x',y')$ with $x'\leq x$ and $y'\leq y$. Let $A$ be the number of ways to choose $n$ blue points with distinct $x$-coordinates, and let $B$ be the number of ways to choose $n$ blue points with distinct $y$-coordinates. Prove that $A=B$.
Find all vectors of $n$ real numbers $(x_1,x_2,\ldots,x_n)$ such that \[ \left\{ \begin{array}{ccc} x_1 & = & \dfrac 1{x_2} + \dfrac 1{x_3} + \cdots + \dfrac 1{x_n } \\ x_2 & = & \dfrac 1{x_1} + \dfrac 1{x_3} + \cdots + \dfrac 1{x_n} \\ \ & \cdots & \ \\ x_n & = & \dfrac 1{x_1} + \dfrac 1{x_2} + \cdots + \dfrac 1{x_{n-1}} \end{array} \right. \] [i]Mircea Becheanu[/i]