Found problems: 85335
How many integers $n$ are there such that $0 \le n \le 720$ and $n^2 \equiv 1$ (mod $720$)?
There are are $n$ children and $n$ toys such that each child has a strict preference ordering on the toys. We want to distribute the toys: say a distribution $A$ dominates a distribution $ B \ne A $ if in $A$, each child receives at least as preferable of a toy as in $B$. Prove that if some distribution is not dominated by any other, then at least one child gets his/her favorite toy in that distribution.
If $ \displaystyle \sum_{n \equal{} 0}^{\infty} \cos^{2n} \theta \equal{} 5$, what is the value of $ \cos{2\theta}$?
$ \textbf{(A)}\ \frac15 \qquad \textbf{(B)}\ \frac25 \qquad \textbf{(C)}\ \frac {\sqrt5}{5}\qquad \textbf{(D)}\ \frac35 \qquad \textbf{(E)}\ \frac45$
For any positive integer $n>1$, let $p(n)$ be the greatest prime factor of $n$. Find all the triplets of distinct positive integers $(x,y,z)$ which satisfy the following properties: $x,y$ and $z$ form an arithmetic progression, and $p(xyz)\leq 3.$
Let $M$ be the midpoint of the cathetus $AC$ of a right-angled triangle $ABC$ $(\angle C=90^{\circ})$. The perpendicular from $M$ to the bisector of angle $ABC$ meets $AB$ at point $N$. Prove that the circumcircle of triangle $ANM$ touches the bisector of angle $ABC$.
Proposed by:D.Shvetsov
Eight celebrities meet at a party. It so happens that each celebrity shakes hands with exactly two others. A fan makes a list of all unordered pairs of celebrities who shook hands with each other. If order does not matter, how many different lists are possible?
Construct a point $N$ inside a given right triangle $ABC$ such that the angles $\angle NBC$, $\angle NCA$ and $\angle NAB$ are equal.
Let be $x$ a rational number.
Prove: There are only finitely many triples $(a,b,c)$ of integers with $a<0$ and $b^2-4ac=5$ such that $ax^2+bx+c$ is positive.
$6.$ How many two digit positive integers $N$ have the property that the sum of $N$ and the number obtained by reversing the order of the digits of $N$ is a perfect square $?$
Does there exist a set $M$ in usual Euclidean space such that for every plane $\lambda$ the intersection $M \cap \lambda$ is finite and nonempty ?
[i]Proposed by Hungary.[/i]
[hide="Remark"]I'm not sure I'm posting this in a right Forum.[/hide]
Two white pentagonal pyramids, with side lengths all the same, are glued to each other at their regular pentagon bases. Some of the resulting $10$ faces are colored black. How many rotationally distinguishable colorings may result?
For which of the following integers $n$, there is at least one integer $x$ such that $x^2 \equiv -1 \pmod{n}$?
$
\textbf{(A)}\ 97
\qquad\textbf{(B)}\ 98
\qquad\textbf{(C)}\ 99
\qquad\textbf{(D)}\ 100
\qquad\textbf{(E)}\ \text{None of the preceding}
$
Let $ ABCD$ be a convex quadrilateral with $ BA\neq BC$. Denote the incircles of triangles $ ABC$ and $ ADC$ by $ \omega_{1}$ and $ \omega_{2}$ respectively. Suppose that there exists a circle $ \omega$ tangent to ray $ BA$ beyond $ A$ and to the ray $ BC$ beyond $ C$, which is also tangent to the lines $ AD$ and $ CD$. Prove that the common external tangents to $ \omega_{1}$ and $\omega_{2}$ intersect on $ \omega$.
[i]Author: Vladimir Shmarov, Russia[/i]
Consider the area encircled by $x^2=4y,x^2=-4y,x=4,x=-4$, rotate it around $y$-axis, the volume of the revolved body is $V_1$. Then consider the figure formed by all points $(x,y)$ that $x^2+y^2\leq16,x^2+(y-2)^2\geq4,x^2+(y-2)^2\geq4$, rotate it around $y$-axis, the volume of the revolved body is $V_2$. The relationship between $V_1$ and $V_2$ is
$\text{(A)}V_1=\frac{1}{2}V_2\qquad\text{(B)}V_1=\frac{2}{3}V_2\qquad\text{(C)}V_1=V_2\qquad\text{(D)}V_1=2V_2$
What is the minimum possible perimeter of a triangle two of whose sides are along the x- and y-axes and such that the third contains the point $(1,2)$?
Find all fractions which can be written simultaneously in the forms $\frac{7k- 5}{5k - 3}$ and $\frac{6l - 1}{4l - 3}$
, for some integers $k, l$.
An integer which is the area of a right-angled triangle with integer sides is called [i]Pythagorean[/i]. Prove that for every positive integer $n > 12$ there exists a Pythagorean number between $n$ and $2n.$
Let $ABCD$ be a curcumscribed quadrilateral with incenter $I$, and let $O_{1}, O_{2}$ be the circumcenters of triangles $AID$ and $CID$. Prove that the circumcenter of triangle $O_{1}IO_{2}$ lies on the bisector of angle $ABC$
A non-negative integer $n$ is called [I]redundant[/I] if the sum of all his proper divisors is bigger than $n$. Prove that for each non-negative integer $N$ there are $N$ consecutive redundant non-negative integers.
[I]Proposed by V. Bragin[/I]
Let $a,b,c,d$ be real numbers. Prove that the set $M=\left\{ax^3+bx^2+cx+d|x\in\mathbb R\right\}$ contains no irrational numbers if and only if $a=b=c=0$ and $d$ is rational.
15 boxes are given. They all are initially empty. By one move it is allowed to choose some boxes and to put in them numbers of apricots which are pairwise distinct powers of 2. Find the least positive integer $k$ such that it is possible to have equal numbers of apricots in all the boxes after $k$ moves.
A number of signal lights are equally spaced along a one-way railroad track, labeled in oder $ 1,2, \ldots, N, N \geq 2.$ As a safety rule, a train is not allowed to pass a signal if any other train is in motion on the length of track between it and the following signal. However, there is no limit to the number of trains that can be parked motionless at a signal, one behind the other. (Assume the trains have zero length.) A series of $ K$ freight trains must be driven from Signal 1 to Signal $ N.$ Each train travels at a distinct but constant spped at all times when it is not blocked by the safety rule. Show that, regardless of the order in which the trains are arranged, the same time will elapse between the first train's departure from Signal 1 and the last train's arrival at Signal $ N.$
[b]p1.[/b] Three camps are located in the vertices of an equilateral triangle. The roads connecting camps are along the sides of the triangle. Captain America is inside the triangle and he needs to know the distances between camps. Being able to see the roads he has found that the sum of the shortest distances from his location to the roads is 50 miles. Can you help Captain America to evaluate the distances between the camps?
[b]p2.[/b] $N$ regions are located in the plane, every pair of them have a non-empty overlap. Each region is a connected set, that means every two points inside the region can be connected by a curve all points of which belong to the region. Iron Man has one charge remaining to make a laser shot. Is it possible for him to make the shot that goes through all $N$ regions?
[b]p3.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills.
(a) What is the smallest amount of money you need to buy a slice of pizza that costs $\$1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do since the pizza man can only give you $\$5$ back.
(b) Vending machines in Wonderland accept only exact payment (do not give back change). List all positive integer numbers which CANNOT be used as prices in such vending machines. (That is, find the sums of money that cannot be paid by exact change.)
[b]p4.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line.
(b) Do the same with $6$ points.
[b]p5.[/b] Numbers $1,2,3,…,100$ are randomly divided in two groups $50$ numbers in each. In the first group the numbers are written in increasing order and denoted $a_1,a_2, ..., a_{50}$. In the second group the numberss are written in decreasing order and denoted $b_1,b_2, ..., b_{50}$. Thus $a_1<a_2<...<a_{50}$ and $ b_1>b_2>...>b_{50}$. Evaluate $|a_1-b_1|+|a_2-b_2|+...+|a_{50}-b_{50}|$.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
[b]p1.[/b] A dog on a $10$ meter long leash is tied to a $10$ meter long, infinitely thin section of fence. What is the minimum area over which the dog will be able to roam freely on the leash, given that we can fix the position of the leash anywhere on the fence?
[b]p2.[/b] Suppose that the equation $$\begin{tabular}{cccccc}
&\underline{C} &\underline{H} &\underline{M}& \underline{M}& \underline{C}\\
+& &\underline{H}& \underline{M}& \underline{M} & \underline{T}\\
\hline
&\underline{P} &\underline{U} &\underline{M} &\underline{A} &\underline{C}\\
\end{tabular}$$
holds true, where each letter represents a single nonnegative digit, and distinct letters represent different digits (so that $\underline{C}\, \underline{H}\, \underline{ M}\, \underline{ M}\, \underline{ C}$ and $ \underline{P}\, \underline{U}\, \underline{M}\, \underline{A}\, \underline{C}$ are both five digit positive integers, and the number $\underline{H }\, \underline{M}\, \underline{M}\, \underline{T}$ is a four digit positive integer). What is the largest possible value of the five digit positive integer$\underline{C}\, \underline{H}\, \underline{ M}\, \underline{ M}\, \underline{ C}$ ?
[b]p3.[/b] Square $ABCD$ has side length $4$, and $E$ is a point on segment $BC$ such that $CE = 1$. Let $C_1$ be the circle tangent to segments $AB$, $BE$, and $EA$, and $C_2$ be the circle tangent to segments $CD$, $DA$, and $AE$. What is the sum of the radii of circles $C_1$ and $C_2$?
[b]p4.[/b] A finite set $S$ of points in the plane is called tri-separable if for every subset $A \subseteq S$ of the points in the given set, we can find a triangle $T$ such that
(i) every point of $A$ is inside $T$ , and
(ii) every point of $S$ that is not in $A$ is outside$ T$ .
What is the smallest positive integer $n$ such that no set of $n$ distinct points is tri-separable?
[b]p5.[/b] The unit $100$-dimensional hypercube $H$ is the set of points $(x_1, x_2,..., x_{100})$ in $R^{100}$ such that $x_i \in \{0, 1\}$ for $i = 1$, $2$, $...$, $100$. We say that the center of $H$ is the point
$$\left( \frac12,\frac12, ..., \frac12 \right)$$
in $R^{100}$, all of whose coordinates are equal to $1/2$.
For any point $P \in R^{100}$ and positive real number $r$, the hypersphere centered at $P$ with radius $r$ is defined to be the set of all points in $R^{100}$ that are a distance $r$ away from $P$. Suppose we place hyperspheres of radius $1/2$ at each of the vertices of the $100$-dimensional unit hypercube $H$. What is the smallest real number $R$, such that a hypersphere of radius $R$ placed at the center of $H$ will intersect the hyperspheres at the corners of $H$?
[b]p6.[/b] Greg has a $9\times 9$ grid of unit squares. In each square of the grid, he writes down a single nonzero digit. Let $N$ be the number of ways Greg can write down these digits, so that each of the nine nine-digit numbers formed by the rows of the grid (reading the digits in a row left to right) and each of the nine nine-digit numbers formed by the columns (reading the digits in a column top to bottom) are multiples of $3$. What is the number of positive integer divisors of $N$?
[b]p7.[/b] Find the largest positive integer $n$ for which there exists positive integers $x$, $y$, and $z$ satisfying
$$n \cdot gcd(x, y, z) = gcd(x + 2y, y + 2z, z + 2x).$$
[b]p8.[/b] Suppose $ABCDEFGH$ is a cube of side length $1$, one of whose faces is the unit square $ABCD$. Point $X$ is the center of square $ABCD$, and $P$ and $Q$ are two other points allowed to range on the surface of cube $ABCDEFHG$. Find the largest possible volume of tetrahedron $AXPQ$.
[b]p9.[/b] Deep writes down the numbers $1, 2, 3, ... , 8$ on a blackboard. Each minute after writing down the numbers, he uniformly at random picks some number $m$ written on the blackboard, erases that number from the blackboard, and increases the values of all the other numbers on the blackboard by $m$. After seven minutes, Deep is left with only one number on the black board. What is the expected value of the number Deep ends up with after seven minutes?
[b]p10.[/b] Find the number of ordered tuples $(x_1, x_2, x_3, x_4, x_5)$ of positive integers such that $x_k \le 6$ for each index $k = 1$, $2$, $... $,$ 5$, and the sum $$x_1 + x_2 +... + x_5$$ is $1$ more than an integer multiple of $7$.
[b]p11.[/b] The equation $$\left( x- \sqrt[3]{13}\right)\left( x- \sqrt[3]{53}\right)\left( x- \sqrt[3]{103}\right)=\frac13$$ has three distinct real solutions $r$, $s$, and $t$ for $x$. Calculate the value of $$r^3 + s^3 + t^3.$$
[b]p12.[/b] Suppose $a$, $b$, and $c$ are real numbers such that
$$\frac{ac}{a + b}+\frac{ba}{b + c}+\frac{cb}{c + a}= -9$$
and
$$\frac{bc}{a + b}+\frac{ca}{b+c}+\frac{ab}{c + a}= 10.$$
Compute the value of
$$\frac{b}{a + b}+\frac{c}{b + c}+\frac{a}{c + a}.$$
[b]p13.[/b] The complex numbers $w$ and $z$ satisfy the equations $|w| = 5$, $|z| = 13$, and $$52w - 20z = 3(4 + 7i).$$ Find the value of the product $wz$.
[b]p14.[/b] For $i = 1, 2, 3, 4$, we choose a real number $x_i$ uniformly at random from the closed interval $[0, i]$. What is the probability that $x_1 < x_2 < x_3 < x_4$ ?
[b]p15.[/b] The terms of the infinite sequence of rational numbers $a_0$, $a_1$, $a_2$, $...$ satisfy the equation $$a_{n+1} + a_{n-2} = a_na_{n-1}$$ for all integers $n\ge 2$. Moreover, the values of the initial terms of the sequence are $a_0 =\frac52$, $a_1 = 2$ and} $a_2 =\frac52.$ Call a nonnegative integer $m$ lucky if when we write $a_m =\frac{p}{q}$ for some relatively prime positive integers $p$ and $q$, the integer $p + q$ is divisible by $13$. What is the $101^{st}$ smallest lucky number?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Find all triples of real numbers $(a,b,c)$ for which the set of solutions $x$ of $\sqrt{2x^2 +ax+b} > x-c$ is the set $(-\infty,0]\cup(1,\infty)$.