Found problems: 85335
Let $P$ be an arbitrary interior point of $\triangle ABC$, and $AP$, $BP$, $CP$ intersect $BC$, $CA$, $AB$ at $D$, $E$, $F$, respectively. Suppose that $M$ be the midpoint of $BC$, $\odot(AEF)$ and $\odot(ABC)$ intersect at $S$, $SD$ intersects $\odot(ABC)$ at $X$, and $XM$ intersects $\odot(ABC)$ at $Y$. Show that $AY$ is tangent to $\odot(AEF)$.
Prove that there are infinitely many positive integers $n$ such that $2^{2^n+1}+1$ is divisible by $n$ but $2^n+1$ is not.
[i](Russia) Valery Senderov[/i]
Within a group of $ 2009$ people, every two people has exactly one common friend. Find the least value of the difference between the person with maximum number of friends and the person with minimum number of friends.
The following diagram shows an eight-sided polygon $ABCDEFGH$ with side lengths $8,15,8,8,8,6,8,$ and $29$ as shown. All of its angles are right angles. Turn this eight-sided polygon into a six-sided polygon by connecting $B$ to $D$ with an edge and $E$ to $G$ with an edge to form polygon $ABDEGH$. Find the perimeter of $ABDEGH$.
[asy]
size(200);
defaultpen(linewidth(2));
pen qq=font("phvb");
pair rectangle[] = {origin,(0,-8),(15,-8),(15,-16),(23,-16),(23,-8),(29,-8),(29,0)};
string point[] = {"A","B","C","D","E","F","G","H"};
int dirlbl[] = {135,225,225,225,315,315,315,45};
string value[] = {"8","15","8","8","8","6","8","29"};
int direction[] = {0,90,0,90,180,90,180,270};
for(int i=0;i<=7;i=i+1)
{
draw(rectangle[i]--rectangle[(i+1) % 8]);
label(point[i],rectangle[i],dir(dirlbl[i]),qq);
label(value[i],(rectangle[i]+rectangle[(i+1) % 8])/2,dir(direction[i]),qq);
}
[/asy]
Suppose $x,y,z$ is a geometric sequence with common ratio $r$ and $x \neq y$. If $x, 2y, 3z$ is an arithmetic sequence, then $r$ is
$ \textbf{(A)}\ \frac{1}{4} \qquad\textbf{(B)}\ \frac{1}{3} \qquad\textbf{(C)}\ \frac{1}{2} \qquad\textbf{(D)}\ 2 \qquad\textbf{(E)}\ 4$
Sum of the roots in the range $\left(-\frac{\pi}{2},\frac{\pi}{2} \right)$ of the equation $\sin x\tan x=x^2$ is
[list=1]
[*] $\frac{\pi}{2}$
[*] 0
[*] 1
[*] None of these
[/list]
Let be two matrices $ A,B\in\mathcal{M}_2\left( \mathbb{R} \right) $ that don’t commute.
[b]a)[/b] If $ A^3=B^3, $ then $ \text{tr} \left( A^n \right) =\text{tr} \left( B^n \right) , $ for all natural numbers $ n. $
[b]b)[/b] If $ A^n\neq B^n $ and $ \text{tr} \left( A^n \right) =\text{tr} \left( B^n \right) , $ for all natural numbers $ n, $ then find some of the matrices $ A,B. $
Given positive real numbers \(a\), \(b\), and \(c\) such that \(a+b+c \leq \frac{3}{2}\), find the minimum of
\[
a+b+c + \frac{1}{a} + \frac{1}{b} + \frac{1}{c}.
\]
What is the greatest possible sum of the digits in the base-seven representation of a positive integer less than $2019$?
$\textbf{(A) } 11
\qquad\textbf{(B) } 14
\qquad\textbf{(C) } 22
\qquad\textbf{(D) } 23
\qquad\textbf{(E) } 27$
Let $a$, $b$, and $c$ be positive real numbers such that $a^2+b^2+c^2=989$ and $(a+b)^2+(b+c)^2+(c+a)^2=2013$. Find $a+b+c$.
Find all finite sequences $(x_0, x_1, \ldots,x_n)$ such that for every $j$, $0 \leq j \leq n$, $x_j$ equals the number of times $j$ appears in the sequence.
Let $a$ and $b$ be positive integers. We tile a rectangle with dimensions $a$ and $b$ using squares whose side-length is a power of $2$, i.e. the tiling may include squares of dimensions $1\times 1, 2\times 2, 4\times 4$ etc. Denote by $M$ the minimal number of squares in such a tiling. Numbers $a$ and $b$ can be uniquely represented as the sum of distinct powers of $2$: $a=2^{a_1}+\cdots+2^{a_k},\; b=2^{b_1}+\cdots +2^{b_\ell}.$ Show that $$M=\sum_{i=1}^k \;\sum_{j=1}^{\ell} 2^{|a_i-b_j|}.$$
In a competition there are $18$ teams and in each round $18$ teams are divided into $9$ pairs where the $9$ matches are played coincidentally. There are $17$ rounds, so that each pair of teams play each other exactly once. After $n$ rounds, there always exists $4$ teams such that there was exactly one match played between these teams in those $n$ rounds. Find the maximum value of $n$.
Triangle $ PAB$ is formed by three tangents to circle $ O$ and $ < APB \equal{} 40^{\circ}$; then angle $ AOB$ equals:
$ \textbf{(A)}\ 45^{\circ} \qquad\textbf{(B)}\ 50^{\circ} \qquad\textbf{(C)}\ 55^{\circ} \qquad\textbf{(D)}\ 60^{\circ} \qquad\textbf{(E)}\ 70^{\circ}$
Three faces of a rectangular prism have diagonal lengths of $7$, $8$, and $9$ inches. How many cubic inches are in the volume of the rectangular prism?
$\text{(A) }48\sqrt{11}\qquad\text{(B) }160\qquad\text{(C) }14\sqrt{95}\qquad\text{(D) }35\sqrt{15}\qquad\text{(E) }504$
Consider fractions $\frac{a}{b}$ where $a$ and $b$ are positive integers.
(a) Prove that for every positive integer $n$, there exists such a fraction $\frac{a}{b}$ such that $\sqrt{n} \le \frac{a}{b} \le \sqrt{n+1}$ and $b \le \sqrt{n}+1$.
(b) Show that there are infinitely many positive integers $n$ such that no such fraction $\frac{a}{b}$ satisfies $\sqrt{n} \le \frac{a}{b} \le \sqrt{n+1}$ and $b \le \sqrt{n}$.
Consider the set $S$ of permutations of $1, 2, \dots, 2022$ such that for all numbers $k$ in the
permutation, the number of numbers less than $k$ that follow $k$ is even.
For example, for $n=4; S = \{[3,4,1,2]; [3,1,2,4]; [1,2,3,4]; [1,4,2,3]\}$
If $|S| = (a!)^b$ where $a, b \in \mathbb{N}$, then find the product $ab$.
Let $a$ and $b$ be real numbers such that $ \frac {ab}{a^2 + b^2} = \frac {1}{4} $. Find all possible values of $ \frac {|a^2-b^2|}{a^2+b^2} $.
Let $n \geq 2$ be a positive integer. Suppose there exist non-negative integers ${n_1},{n_2},\ldots,{n_k}$ such that $2^n - 1 \mid \sum_{i = 1}^k {{2^{{n_i}}}}$. Prove that $k \ge n$.
Consider the square with vertices $(0, 0),(1, 0),(1, 1),(0, 1).$ The line segments from $(t, 0)$ to $(0, 1 - t)$ are drawn for $0 \le t \le 1.$ The set of points inside the square but not on one of these line segments has area $\tfrac{m}{n}$ for coprime positive integers $m$ and $n.$ Find $m + n.$
Find the least positive integer $n$ for which $2^n + 5^n - n$ is a multiple of $1000$.
If $a$, $b$, $c > 0$; $ab + bc + ca = 3$ then: $$4\left(\tan^{-1} 2\right)\left(\tan^{-1}\left(\sqrt[3]{abc}\right)\right) \leq \pi \tan^{-1}\left(1 + \sqrt[3]{abc}\right)$$
The vertices of a regular $2012$-gon are labeled $A_1,A_2,\ldots, A_{2012}$ in some order. It is known that if $k+\ell$ and $m+n$ leave the same remainder when divided by $2012$, then the chords $A_kA_{\ell}$ and $A_mA_n$ have no common points. Vasya walks around the polygon and sees that the first two vertices are labeled $A_1$ and $A_4$. How is the tenth vertex labeled?
[i]Proposed by A. Golovanov[/i]
Let $P$ be a point in a square whose side are mirror. A ray of light comes from $P$ and with slope $\alpha$. We know that this ray of light never arrives to a vertex. We make an infinite sequence of $0,1$. After each contact of light ray with a horizontal side, we put $0$, and after each contact with a vertical side, we put $1$. For each $n\geq 1$, let $B_{n}$ be set of all blocks of length $n$, in this sequence.
a) Prove that $B_{n}$ does not depend on location of $P$.
b) Prove that if $\frac{\alpha}{\pi}$ is irrational, then $|B_{n}|=n+1$.
Given an equilateral triangle lattice composed of $\frac{n(n+1)}{2}$ points (as shown in the figure), record the number of equilateral triangles with three points in the lattice as vertices as $f(n)$. Find an expression for $f(n)$.
[img]https://cdn.artofproblemsolving.com/attachments/7/f/1de27231e8ef9c1c6a3dfd590a7c71adc508d6.png[/img]