Found problems: 85335
Prove that for that for every positive integer $ n$, the smallest integer that is greater than $ (\sqrt {3} \plus{} 1)^{2n}$ is divisible by $ 2^{n \plus{} 1}$.
For how many natural numbers $n$ between $1$ and $2014$ (both inclusive) is $\frac{8n}{9999-n}$ an integer?
There are 32 people at a conference. Initially nobody at the conference knows the name of anyone else. The conference holds several 16-person meetings in succession, in which each person at the meeting learns (or relearns) the name of the other fifteen people. What is the minimum number of meetings needed until every person knows everyone else's name?
[i]David Yang, Victor Wang.[/i]
[size=85][i]See the "odd version" [url=http://www.artofproblemsolving.com/Forum/viewtopic.php?f=810&t=500914]here[/url].[/i][/size]
a) In how many ways can we read the word SARAJEVO from the table below, if it is allowed to jump from cell to an adjacent cell (by vertex or a side) cell?
b) After the letter in one cell was deleted, only $525$ ways to read the word SARAJEVO remained. Find all possible positions of that cell.
In triangle $ ABC$, angle $ C$ is a right angle and $ CB > CA$. Point $ D$ is located on $ \overline{BC}$ so that angle $ CAD$ is twice angle $ DAB$. If $ AC/AD \equal{} 2/3$, then $ CD/BD \equal{} m/n$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$.
$ \textbf{(A)}\ 10\qquad
\textbf{(B)}\ 14\qquad
\textbf{(C)}\ 18\qquad
\textbf{(D)}\ 22\qquad
\textbf{(E)}\ 26$
Let $T(p)$ denote the number of right triangles with integer side lengths and one of its side lengths being $p$. Which of the following values of $p$ produces the greatest possible value of $T(p)$ among all five answer choices?
$\textbf{(A) }24\qquad\textbf{(B) }27\qquad\textbf{(C) }28\qquad\textbf{(D) }36\qquad\textbf{(E) }54$
Let $ M,N,P,Q $ be the middlepoints of the segments $ AB,BC,CD,DA, $ respectively, of a convex quadrilateral $ ABCD. $ Prove that if $ ANP $ and $ CMQ $ are equilateral, then $ ABDC $ is a rhombus . Moreover, determine the angles of this rhombus.
For what $\lambda$ does the equation
$$ \int_{0}^{1} \min(x,y) f(y)\; dy =\lambda f(x)$$
have continuous solutions which do not vanish identically in $(0,1)?$ What are these solutions?
Find all positive integers $n$ with the folowing property: for all triples ($a$,$b$,$c$) of positive real there is a triple of non negative integers ($l$,$j$,$k$) such that $an^k$, $bn^j$ and $cn^l$ are sides of a non degenate triangle
Construct a holomorphic function $f(z) = \sum \limits_{n = 0} ^ \infty a_n z^n$ ( | z | <1 ) in the unit circle that can be analytically continued to all points of the unit circle except one point, and for which the sequence $\{a_n\}$ has two limit points, $\infty$ and a finite value.
Show that there are infinitely many perfect squares of the form $50^m-50^n$, but no perfect square of the form $2020^m+2020^n$, where $m$ and $n$ are positive integers.
Consider the shape shown below, formed by gluing together the sides of seven congruent regular hexagons. The area of this shape is partitioned into $21$ quadrilaterals, all of whose side lengths are equal to the side length of the hexagon and each of which contains a $60^{\circ}$ angle. In how many ways can this partitioning be done? (The quadrilaterals may contain an internal boundary of the seven hexagons.)
[asy]
draw(origin--origin+dir(0)--origin+dir(0)+dir(60)--origin+dir(0)+dir(60)+dir(0)--origin+dir(0)+dir(60)+dir(0)+dir(60)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)+dir(120)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)+dir(120)+dir(180)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)+dir(120)+dir(180)+dir(120)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)+dir(120)+dir(180)+dir(120)+dir(180)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)+dir(120)+dir(180)+dir(120)+dir(180)+dir(240)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)+dir(120)+dir(180)+dir(120)+dir(180)+dir(240)+dir(180)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)+dir(120)+dir(180)+dir(120)+dir(180)+dir(240)+dir(180)+dir(240)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)+dir(120)+dir(180)+dir(120)+dir(180)+dir(240)+dir(180)+dir(240)+dir(300)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)+dir(120)+dir(180)+dir(120)+dir(180)+dir(240)+dir(180)+dir(240)+dir(300)+dir(240)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)+dir(120)+dir(180)+dir(120)+dir(180)+dir(240)+dir(180)+dir(240)+dir(300)+dir(240)+dir(300)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)+dir(120)+dir(180)+dir(120)+dir(180)+dir(240)+dir(180)+dir(240)+dir(300)+dir(240)+dir(300)+dir(0)--origin+dir(0)+dir(60)+dir(0)+dir(60)+dir(120)+dir(60)+dir(120)+dir(180)+dir(120)+dir(180)+dir(240)+dir(180)+dir(240)+dir(300)+dir(240)+dir(300)+dir(0)+dir(300)--cycle);
draw(2*dir(60)+dir(120)+dir(0)--2*dir(60)+dir(120)+2*dir(0),dashed);
draw(2*dir(60)+dir(120)+dir(60)--2*dir(60)+dir(120)+2*dir(60),dashed);
draw(2*dir(60)+dir(120)+dir(120)--2*dir(60)+dir(120)+2*dir(120),dashed);
draw(2*dir(60)+dir(120)+dir(180)--2*dir(60)+dir(120)+2*dir(180),dashed);
draw(2*dir(60)+dir(120)+dir(240)--2*dir(60)+dir(120)+2*dir(240),dashed);
draw(2*dir(60)+dir(120)+dir(300)--2*dir(60)+dir(120)+2*dir(300),dashed);
draw(dir(60)+dir(120)--dir(60)+dir(120)+dir(0)--dir(60)+dir(120)+dir(0)+dir(60)--dir(60)+dir(120)+dir(0)+dir(60)+dir(120)--dir(60)+dir(120)+dir(0)+dir(60)+dir(120)+dir(180)--dir(60)+dir(120)+dir(0)+dir(60)+dir(120)+dir(180)+dir(240)--dir(60)+dir(120)+dir(0)+dir(60)+dir(120)+dir(180)+dir(240)+dir(300),dashed);
[/asy]
Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that
$f(f(x)^2+f(y^2))=(x-y)f(x-f(y))$
Let $O$ and $H$ be the circumcenter and orthocenter of a scalene triangle $ABC$, respectively. Let $D$ be the intersection point of the lines $AH$ and $BC$. Suppose the line $OH$ meets the side $BC$ at $X$. Let $P$ and $Q$ be the second intersection points of the circumcircles of $\triangle BDH$ and $\triangle CDH$ with the circumcircle of $\triangle ABC$, respectively. Show that the four points $P, D, Q$ and $X$ lie on a circle.
Given a piece of graph paper with a letter assigned to each vertex of every square such that on every segment connecting two vertices that have the same letter and are on the same line of the mesh, there is at least one vertex with another letter. What is the least number of distinct letters needed to plot such a picture, along the sides of the cells?
There are $2024$ cities in a country, some pairs of which are connected by bidirectional flights. For any distinct cities $A, B, C, X, Y, Z$, it is possible to fly directly from some of the cities $A, B, C$ to some of the cities $X, Y, Z$. Prove that it is possible to plan a route $T_1\to T_2 \to \ldots \to T_{2022}$ that passes through $2022$ distinct cities.
[i]Proposed by Lior Shayn[/i]
Let be a ring $ R $ which has the property that there exist two distinct natural numbers $ s,t $ such that for any element $ x $ of $ R, $ the equation $ x^s=x^t $ is true. Show that there exists a polynom in $ R[X] $ of degree
$$ |s-t|\left( 1+|s-t| \right) $$
such that all the elements of $ R $ are roots of it.
One day while Tony plays in the back yard of the Kubik's home, he wonders about the width of the back yard, which is in the shape of a rectangle. A row of trees spans the width of the back of the yard by the fence, and Tony realizes that all the trees have almost exactly the same diameter, and the trees look equally spaced. Tony fetches a tape measure from the garage and measures a distance of almost exactly $12$ feet between a consecutive pair of trees. Tony realizes the need to include the width of the trees in his measurements. Unsure as to how to do this, he measures the distance between the centers of the trees, which comes out to be around $15$ feet. He then measures $2$ feet to either side of the first and last trees in the row before the ends of the yard. Tony uses these measurements to estimate the width of the yard. If there are six trees in the row of trees, what is Tony's estimate in feet?
[asy]
size(400);
defaultpen(linewidth(0.8));
draw((0,-3)--(0,3));
int d=8;
for(int i=0;i<=5;i=i+1)
{
draw(circle(7/2+d*i,3/2));
}
draw((5*d+7,-3)--(5*d+7,3));
draw((0,0)--(2,0),Arrows(size=7));
draw((5,0)--(2+d,0),Arrows(size=7));
draw((7/2+d,0)--(7/2+2*d,0),Arrows(size=7));
label("$2$",(1,0),S);
label("$12$",((7+d)/2,0),S);
label("$15$",((7+3*d)/2,0),S);
[/asy]
Let $T=\text{TNFTPP}$. Three distinct positive Fibonacci numbers, all greater than $T$, are in arithmetic progression. Let $N$ be the smallest possible value of their sum. Find the remainder when $N$ is divided by $2007$.
For triangle $\vartriangle ABC$, define its $A$-excircle to be the circle that is externally tangent to line segment $BC$ and extensions of $\overleftrightarrow{AB}$ and $\overleftrightarrow{AC}$, and define the $B$-excircle and $C$-excircle likewise.
Then, define the $A$-[i]veryexcircle [/i] to be the unique circle externally tangent to both the $A$-excircle as well as the extensions of $\overleftrightarrow{AB}$ and $\overleftrightarrow{AC}$, but that shares no points with line $\overleftrightarrow{BC}$, and define the $B$-veryexcircle and $C$-veryexcircle likewise.
Compute the smallest integer $N \ge 337$ such that for all $N_1 \ge N$, the area of a triangle with lengths $3N^2_1$ , $3N^2_1 + 1$, and $2022N_1$ is at most $\frac{1}{22022}$ times the area of the triangle formed by connecting the centers of its three veryexcircles.
If your submitted estimate is a positive number $E$ and the true value is $A$, then your score is given by $\max \left(0, \left\lfloor 25 \min \left( \frac{E}{A}, \frac{A}{E}\right)^3\right\rfloor \right)$.
A cross with length $p$ (or [i]p-cross[/i] for short) will be called the figure formed by a unit square and 4 rectangles $p-1$ x $1$ on its sides. What’s the least amount of colors one has to use to color the cells of an infinite table, so that each [i]p-cross[/i] on it covers cells, no two of which are in the same color?
Let $ABC$ be any triangle with $\angle BAC \le \angle ACB \le \angle CBA$. Let $D, E$ and $F$ be the midpoints of $BC, CA$ and $AB$, respectively, and let $\epsilon$ be a positive real number. Suppose there is an ant (represented by a point $T$ ) and two spiders (represented by points $P_1$ and $P_2$, respectively) walking on the sides $BC, CA, AB, EF, FD$ and $DE$. The ant and the spiders may vary their speeds, turn at an intersection point, stand still, or turn back at any point; moreover, they are aware of their and the others’ positions at all time.
Assume that the ant’s speed does not exceed $1$ mm/s, the first spider’s speed does not exceed $\frac{\sin A}{2 \sin A+\sin B}$ mm/s, and the second spider’s speed does not exceed $\epsilon$ mm/s. Show that the spiders always have a strategy to catch the ant regardless of the starting points of the ant and the spiders.
Note: the two spiders can discuss a plan before the hunt starts and after seeing all three starting points, but cannot communicate during the hunt.
$2019$ people (all of whom are perfect logicians), labeled from $1$ to $2019$, partake in a paintball duel. First, they decide to stand in a circle, in order, so that Person $1$ has Person $2$ to his left and person $2019$ to his right. Then, starting with Person $1$ and moving to the left, every person who has not been eliminated takes a turn shooting. On their turn, each person can choose to either shoot one non-eliminated person of his or her choice (which eliminates that person from the game), or deliberately miss. The last person standing wins. If, at any point, play goes around the circle once with no one getting eliminated (that is, if all the people playing decide to miss), then automatic paint sprayers will turn on, and end the game with everyone losing. Each person will, on his or her turn, always pick a move that leads to a win if possible, and, if there is still a choice in what move to make, will prefer shooting over missing, and shooting a person closer to his or her left over shooting someone farther from their left. What is the number of the person who wins this game? Put “$0$” if no one wins.
Each point in space is colored in one of four different colors. Prove that there is a segment $1$ cm long with endpoints of the same color.
We have many $\text{three-element}$ subsets of a $1000\text{-element}$ set. We know that the union of every $5$ of them has at least $12$ elements. Find the most possible value for the number of these subsets.