Found problems: 85335
The number $n{}$ cointains $k{}$ units in binary system. Prove that $2^{n-k}{}$ divides $n!$.
Determine all positive integers $n$ such that $3^{n}+1$ is divisible by $n^{2}$.
Find all positive integers $n \ge 2$ such that equality $i+j \equiv C_{n}^{i} + C_{n}^{j}$ (mod $2$) is true for arbitrary $0 \le i \le j \le n$.
For coprime integers $m > n > 1$ consider the polynomials $f(x) = x^{m+n} -x^{m+1} -x+1$ and $g(x) = x^{m+n} +x^{n+1} -x+1$. If $f$ and $g$ have a common divisor of degree greater than $1$, find this divisor.
Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.
A shopper buys a $100$ dollar coat on sale for $20\% $ off. An additional $5$ dollars are taken off the sale price by using a discount coupon. A sales tax of $8\% $ is paid on the final selling price. The total amount the shopper pays for the coat is
$\text{(A)}\ \text{81.00 dollars} \qquad \text{(B)}\ \text{81.40 dollars} \qquad \text{(C)}\ \text{82.00 dollars} \qquad \text{(D)}\ \text{82.08 dollars} \qquad \text{(E)}\ \text{82.40 dollars}$
Determine the value of the expression
$$ (1 +\tan(1^o))(1 + \tan(2^o))...(1 + \tan(45^o)).$$
Binhao has a fair coin. He writes the number $+1$ on a blackboard. Then he flips the coin. If it comes up heads (H), he writes $+\frac12$ , and otherwise, if he flips tails (T), he writes $-\frac12$ . Then he flips the coin again. If it comes up heads, he writes $+\frac14$ , and otherwise he writes $-\frac14$ . Binhao continues to flip the coin, and on the nth flip, if he flips heads, he writes $+ \frac{1}{2n}$ , and otherwise he writes $- \frac{1}{2n}$ . For example, if Binhao flips HHTHTHT, he writes $1 + \frac12 + \frac14 - \frac18 + \frac{1}{16} -\frac{1}{32} + \frac{1}{64} -\frac{1}{128}$ . The probability that Binhao will generate a series whose sum is greater than $\frac17$ is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + 10q$.
The acute triangle $ABC$ $(AC> BC)$ is inscribed in a circle with the center at the point $O$, and $CD$ is the diameter of this circle. The point $K$ is on the continuation of the ray $DA$ beyond the point $A$. And the point $L$ is on the segment $BD$ $(DL> LB)$ so that $\angle OKD = \angle BAC$, $\angle OLD = \angle ABC$. Prove that the line $KL$ passes through the midpoint of the segment $AB$.
Prove that for any three infinite sequences of natural numbers $(a_n)_{n\ge 1}$, $(b_n)_{n\ge 1}$, $(c_n)_{n\ge 1}$, there exist numbers $p$ and $q$ such that $a_p\ge a_q$, $b_p\ge b_q$ and $c_p\ge c_q$.
Two rectangles of unit area overlap to form a convex octagon. Show that the area of the octagon is at least $\dfrac {1} {2}$.
[i]Kvant Magazine [/i]
How many distinct lines pass through the point $(0, 2016)$ and intersect the parabola $y = x^2$ at two lattice points? (A lattice point is a point whose coordinates are integers.)
$x,y,z$ are nonnegative real numbers, and $4^{\sqrt{5x+9y+4z}}-68\times2^{\sqrt{5x+9y+4z}}+256=0$. Then, the product of the maximum and minimum value of $x+y+z$ is________.
A bowl is formed by attaching four regular hexagons of side 1 to a square of side 1. The edges of adjacent hexagons coincide, as shown in the figure. What is the area of the octagon obtained by joining the top eight vertices of the four hexagons, situated on the rim of the bowl?
[asy]
size(200);
defaultpen(linewidth(0.8));
draw((342,-662) -- (600, -727) -- (757,-619) -- (967,-400) -- (1016,-300) -- (912,-116) -- (651,-46) -- (238,-90) -- (82,-204) -- (184, -388) -- (447,-458) -- (859,-410) -- (1016,-300));
draw((82,-204) -- (133,-490) -- (342, -662));
draw((652,-626) -- (600,-727));
draw((447,-458) -- (652,-626) -- (859,-410));
draw((133,-490) -- (184, -388));
draw((967,-400) -- (912,-116)^^(342,-662) -- (496, -545) -- (757,-619)^^(496, -545) -- (446, -262) -- (238, -90)^^(446, -262) -- (651, -46),linewidth(0.6)+linetype("5 5")+gray(0.4));
[/asy]
$\textbf{(A) }6\qquad\textbf{(B) }7\qquad\textbf{(C) }5+2\sqrt{2}\qquad\textbf{(D) }8\qquad\textbf{(E) }9$
Broady The Boar is playing a boring board game consisting of a circle with $2021$ points on it, labeled $0$, $1$, $2$, ... $2020$ in that order clockwise. Broady is rolling $2020$-sided die which randomly produces a whole number between $1$ and $2020$, inclusive.
Broady starts at the point labelled $0$. After each dice roll, Broady moves up the same number of points as the number rolled (point $2020$ is followed by point $0$). For example, if they are at $0$ and roll a $5$, they end up at $5$. If they are at $2019$ and roll a $3$, they end up at $1$.
Broady continues rolling until they return to the point labelled $0$. What is the expected number of times they roll the dice?
[i]2021 CCA Math Bonanza Lightning Round #2.3[/i]
Suppose $a,b$ are nonzero integers such that two roots of $x^3+ax^2+bx+9a$ coincide, and all three roots are integers. Find $|ab|$.
In triangle $CAT$, we have $\angle ACT = \angle ATC$ and $\angle CAT = 36^\circ$. If $\overline{TR}$ bisects $\angle ATC$, then $\angle CRT =$
[asy]
pair A,C,T,R;
C = (0,0); T = (2,0); A = (1,sqrt(5+sqrt(20))); R = (3/2 - sqrt(5)/2,1.175570);
draw(C--A--T--cycle);
draw(T--R);
label("$A$",A,N);
label("$T$",T,SE);
label("$C$",C,SW);
label("$R$",R,NW);
[/asy]
$\text{(A)}\ 36^\circ \qquad \text{(B)}\ 54^\circ \qquad \text{(C)}\ 72^\circ \qquad \text{(D)}\ 90^\circ \qquad \text{(E)}\ 108^\circ$
In the Cartesian plane $Oxy$ we consider the points ${A_1}\left( {40,1} \right), {A_2}\left( {40,2} \right), \ldots , {A_{40}}\left( {40,40} \right)$ as well as the segments $O{A_1},O{A_2},\ldots,O{A_{40}}$. A point of the Cartesian plane $Oxy$ is called "good", if its coordinates are integers and it is internal of one segment $O{A_i}, i=1,2,3,\ldots,40$. Additionally, one of the segments $O{A_1},O{A_2},\ldots,O{A_{40}}$ is called "good" if it contains a "good" point. Find the number of "good" segments and "good" points.
Let $P(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_0$ be a polynomial of degree $n\geq 3.$ Knowing that $a_{n-1}=-\binom{n}{1}$ and $a_{n-2}=\binom{n}{2},$ and that all the roots of $P$ are real, find the remaining coefficients. Note that $\binom{n}{r}=\frac{n!}{(n-r)!r!}.$
Eight $1\times 1$ square tiles are arranged as shown so their outside edges form a polygon with a perimeter of $14$ units. Two additional tiles of the same size are added to the figure so that at least one side of each tile is shared with a side of one of the squares in the original figure. Which of the following could be the perimeter of the new figure?
[asy]
for (int a=1; a <= 4; ++a)
{
draw((a,0)--(a,2));
}
draw((0,0)--(4,0));
draw((0,1)--(5,1));
draw((1,2)--(5,2));
draw((0,0)--(0,1));
draw((5,1)--(5,2));
[/asy]
$\text{(A)}\ 15 \qquad \text{(B)}\ 17 \qquad \text{(C)}\ 18 \qquad \text{(D)}\ 19 \qquad \text{(E)}\ 20$
Alicia bought some number of disposable masks, of which she uses one per day. After she uses each of her masks, she throws out half of them (rounding up if necessary) and reuses each of the remaining masks, repeating this process until she runs out of masks. If her masks lasted her $222$ days, how many masks did she start out with?
Given two acute-angled triangles $ABC$ and $A'B'C'$ with the points $O$ and $O'$ inside. Three pairs of the perpendiculars are drawn: $[OA_1]$ to the side $[BC]$, $[O'A'_1]$ to the side $[B'C']$, $[OB_1]$ to the side $[AC]$, $[O'B'_1]$ to the side $[A'C']$, $[OC_1] $ to the side $[AB]$, $[O'C'_1]$ to the side $[A'B']$; It is known that $$[OA_1] \parallel [O'A'], [OB_1] \parallel [O'B'], [OC_1] \parallel [O'C'] $$ and
$$|OA_1|\cdot|O'A'| = |OB_1|\cdot |O'B'| = |OC_1|\cdot |O'C'|$$
Prove that $$[O'A'_1] \parallel [OA], [O'B'_1] \parallel[OB], [O'C'_1] \parallel[OC]$$
and $$|O'A'_1|\cdot|OA| = |O'B'_1|\cdot|OB| = |O'C'_1|\cdot|OC|$$
In Abaliba country there are twenty cities and two airline companies, Blue Planes and Red Planes. The flights are planned as follows:
$\bullet$ Given any two cities, one and only one of the two companies operates direct flights (in both directions and without stops) between the two cities. Furthermore:
$\bullet$There are two cities A and B between which it is not possible to fly (with possible stops) using only Red Planes.
Prove that, given any two cities, a passenger can travel from one to the other using only Blue Planes, making at most one stop in a third city.
Let $N \in \mathbb{N}$ and $x_k \in [-1,1]$, $1 \le k \le N$ such that $\sum_{k=1}^N x_k =s$. Find all possible values of $\sum_{k=1}^N |x_k|$
For certain pairs $ (m,n)$ of positive integers with $ m\ge n$ there are exactly $ 50$ distinct positive integers $ k$ such that $ |\log m \minus{} \log k| < \log n$. Find the sum of all possible values of the product $ mn$.