Found problems: 85335
For each positive integer $n$, let $g(n)$ be the sum of the digits when $n$ is written in binary. For how many positive integers $n$, where $1\leq n\leq 2007$, is $g(n)\geq 3$?
Circles $A$, $B$, and $C$ each have radius $1$. Circles $A$ and $B$ share one point of tangency. Circle $C$ has a point of tangency with the midpoint of $\overline{AB}$. What is the area inside circle $C$ but outside circle $A$ and circle $B$?
[asy]
size(170); defaultpen(linewidth(.8pt)+fontsize(8pt)); dotfactor=3;
filldraw(arc((1,0),1,90,180)--arc((-1,0),1,0,90)--arc((0,1), 1, 180, 0)--cycle,gray);
draw(circle((0,1),1)); draw(circle((1,0),1)); draw(circle((-1,0),1));
dot((-1,0)); dot((1,0)); dot((0,1));
label("$A$",(-1,0),SW); label("$B$",(1,0),SE); label("$C$",(0,1),N);[/asy]
$ \textbf{(A)}\ 3-\frac{\pi}{2} \qquad
\textbf{(B)}\ \frac{\pi}{2} \qquad
\textbf{(C)}\ 2 \qquad
\textbf{(D)}\ \frac{3\pi}{4} \qquad
\textbf{(E)}\ 1+\frac{\pi}{2}$
Let $a_0, a_1, ..., a_{2002}$ be real numbers.
a) Show that the smallest of the values $a_k (1-a_{2002-k})$ ($0 \le k \le 2002$) the following applies:
it is smaller or equal to $1/4$.
b) Does this statement always apply to the smallest of the values $a_k (1-a_{2003-k})$ ($1 \le k \le 2002$) ?
c) Show for positive real numbers $a_0, a_1, ..., a_{2002}$ :
the smallest of the values $a_k (1-a_{2003-k})$ ($1 \le k \le 2002$) is less than or equal to $1/4$.
In an isosceles triangle $ABC$ ($AB = BC$), point $O$ is the center of the circumcircle. Point $M$ lies on the segment $BO$, point $M' $ is symmetric to $M$ wrt the midpoint of $AB$. Point K is the intersection point of of $M'O$ and $AB$. Point $L$ lies on side BC such that $\angle CLO = \angle BLM$. Prove that points $O, K,B,L$ lie on the same circle
Points $A_0,A_1,\ldots,A_{2k}$, in this order, divide a circumference into $2k+1$ equal arcs. Point $A_0$ is connected by chords to all the other points. These $2k$ chords divide the interior of the circle into $2k+1$ parts. These parts are alternately painted red and blue so that there are $k+1$ red and $k$ blue parts. Show that the blue area is larger than the red area.
Determine if there are positive integers $a, b$ such that all terms of the sequence defined by
\[ x_{1}= 2010,x_{2}= 2011\\ x_{n+2}= x_{n}+ x_{n+1}+a\sqrt{x_{n}x_{n+1}+b}\quad (n\ge 1) \] are integers.
Let $D, E$, and $F$ be respectively the midpoints of the sides $BC, CA$, and $AB$ of $\vartriangle ABC$. Let $H_a, H_b, H_c$ be the feet of perpendiculars from $A, B, C$ to the opposite sides, respectively. Let $P, Q, R$ be the midpoints of the $H_bH_c, H_cH_a$, and $H_aH_b$ respectively. Prove that $PD, QE$, and $RF$ are concurrent.
Let $p, q$ and $r$ be three lines in space such that there is no plane that is parallel to all three of them. Prove that there exist three planes $\alpha, \beta$, and $\gamma$, containing $p, q$, and $r$ respectively, that are perpendicular to each other $(\alpha\perp\beta, \beta\perp\gamma, \gamma\perp \alpha).$
The $C$-excircle of a triangle $ABC$ touches $AB, AC, BC$ at $M, N, K$. The points $P, Q$ lie on $NK$ so that $AN=AP, BK=BQ$. Prove that the circumradius of $\triangle MPQ$ is equal to the inradius of $\triangle ABC$.
Suppose that $ k,l $ are natural numbers such that $ \gcd (11m-1,k)=\gcd (11m-1, l) , $ for any natural number $ m. $
Prove that there exists an integer $ n $ such that $ k=11^nl. $
Let $A_1A_2...A_n$ ba a polygon. Prove that there is a convex polygon $B_1B_2...B_n$ such that $B_iB_{i + 1} = A_iA_{i + 1}$ for $i \in \{1, 2,...,n-1\}$ and $B_nB_1 = A_nA_1$ (some of the successive vertices of the polygon $B_1B_2...B_n$ can be colinear).
Let $\alpha,\beta,\gamma$ be positive real numbers such that $\alpha+\beta+\gamma < \pi$, $\alpha+\beta > \gamma$,$ \beta+\gamma > \alpha$, $\gamma + \alpha > \beta.$ Prove that with the segments of lengths $\sin \alpha, \sin \beta, \sin \gamma $ we can construct a triangle and that its area is not greater than
\[A=\dfrac 18\left( \sin 2\alpha+\sin 2\beta+ \sin 2\gamma \right).\]
[i]Proposed by Soviet Union[/i]
Prove that if $ a $ and $ b $ are real numbers and the polynomial $ ax^3 - ax^2 + 9bx - b $ has three positive roots, then they are equal.
\item Two circles $ \Gamma_1$ and $ \Gamma_2$ intersect at points $ A$ and $ B$. Consider a circle $ \Gamma$ contained in $ \Gamma_1$ and $ \Gamma_2$, which is tangent to both of them at $ D$ and $ E$ respectively. Let $ C$ be one of the intersection points of line $ AB$ with $ \Gamma$, $ F$ be the intersection of line $ EC$ with $ \Gamma_2$ and $ G$ be the intersection of line $ DC$ with $ \Gamma_1$. Let $ H$ and $ I$ be the intersection points of line $ ED$ with $ \Gamma_1$ and $ \Gamma_2$ respectively. Prove that $ F$, $ G$, $ H$ and $ I$ are on the same circle.
A permutation $\sigma: \{1,2,\ldots,n\}\to\{1,2,\ldots,n\}$ is called [i]straight[/i] if and only if for each integer $k$, $1\leq k\leq n-1$ the following inequality is fulfilled
\[ |\sigma(k)-\sigma(k+1)|\leq 2. \]
Find the smallest positive integer $n$ for which there exist at least 2003 straight permutations.
[i]Valentin Vornicu[/i]
Suppose that $a * b$ means $3a-b.$ What is the value of $x$ if
$$2 * (5 * x)=1?$$
$\textbf{(A) }\frac{1}{10} \qquad\textbf{(B) }2\qquad\textbf{(C) }\frac{10}{3} \qquad\textbf{(D) }10\qquad \textbf{(E) }14$
Find all positive integers $n$ that have precisely $\sqrt{n+1}$ natural divisors.
Find any two consecutive natural numbers, each of which is divisible by the square of the sum of its digits.
There are $256$ lumps of metal that have different weights in pairs. With the help of a beam balance , one may now compare every two lumps. Find the smallest number $m$ such that you can be sure to find the heaviest as well as the lightest lump with the weighing process.
Given the sequence $(a_n)$, in which $a_n =\frac14 n^4 - 10n^2(n - 1)$, with $n = 0, 1, 2,...$ Determine the smallest term of the sequence.
The number of roots satisfying the equation $ \sqrt{5 \minus{} x} \equal{} x\sqrt{5 \minus{} x}$ is:
$ \textbf{(A)}\ \text{unlimited}\qquad
\textbf{(B)}\ 3\qquad
\textbf{(C)}\ 2\qquad
\textbf{(D)}\ 1\qquad
\textbf{(E)}\ 0$
On square $ABCD,$ points $E,F,G,$ and $H$ lie on sides $\overline{AB},\overline{BC},\overline{CD},$ and $\overline{DA},$ respectively, so that $\overline{EG} \perp \overline{FH}$ and $EG=FH = 34.$ Segments $\overline{EG}$ and $\overline{FH}$ intersect at a point $P,$ and the areas of the quadrilaterals $AEPH, BFPE, CGPF,$ and $DHPG$ are in the ratio $269:275:405:411.$ Find the area of square $ABCD$.
[asy]
size(200);
defaultpen(linewidth(0.8)+fontsize(10.6));
pair A = (0,sqrt(850));
pair B = (0,0);
pair C = (sqrt(850),0);
pair D = (sqrt(850),sqrt(850));
draw(A--B--C--D--cycle);
dotfactor = 3;
dot("$A$",A,dir(135));
dot("$B$",B,dir(215));
dot("$C$",C,dir(305));
dot("$D$",D,dir(45));
pair H = ((2sqrt(850)-sqrt(120))/6,sqrt(850));
pair F = ((2sqrt(850)+sqrt(306)+7)/6,0);
dot("$H$",H,dir(90));
dot("$F$",F,dir(270));
draw(H--F);
pair E = (0,(sqrt(850)-6)/2);
pair G = (sqrt(850),(sqrt(850)+sqrt(100))/2);
dot("$E$",E,dir(180));
dot("$G$",G,dir(0));
draw(E--G);
pair P = extension(H,F,E,G);
dot("$P$",P,dir(60));
label("$w$", (H+E)/2,fontsize(15));
label("$x$", (E+F)/2,fontsize(15));
label("$y$", (G+F)/2,fontsize(15));
label("$z$", (H+G)/2,fontsize(15));
label("$w:x:y:z=269:275:405:411$",(sqrt(850)/2,-4.5),fontsize(11));
[/asy]
Let $\Gamma = \{\varepsilon,0,00,\ldots\}$ be the set of all finite strings consisting of only zeroes. We consider $\textit{six-state unary DFAs}$ $D = (F,q_0,\delta)$ where $F$ is a subset of $Q = \{1,2,3,4,5,6\}$, not necessarily strict and possibly empty; $q_0\in Q$ is some $\textit{start state}$; and $\delta: Q\rightarrow Q$ is the $\textit{transition function}$.
For each such DFA $D$, we associate a set $F_D\subseteq\Gamma$ as the set of all strings $w\in\Gamma$ such that
\[\underbrace{\delta(\cdots(\delta(q_0))\cdots)}_{|w|\text{ applications}}\in F,\]
We say a set $\mathcal D$ of DFAs is $\textit{diverse}$ if for all $D_1,D_2\in\mathcal D$ we have $F_{D_1}\neq F_{D_2}$. What is the maximum size of a diverse set?
Let $(s_n)_{n\geq 1}$ be a sequence given by $s_n=-2\sqrt{n}+\sum \limits_{k=1}^n\frac{1}{\sqrt{k}}$ with $\lim \limits_{n \to \infty}s_n=s=$Ioachimescu constant and $(a_n)_{n\geq 1}$ , $(b_n)_{n\geq 1}$ be a positive real sequences such that $$\lim \limits_{n\to \infty}\frac{a_{n+1}}{na_n}=a\in \mathbb{R}^*_+, \lim \limits_{n\to \infty}\frac{b_{n+1}}{b_n\sqrt{n}}=b\in \mathbb{R}^*_+$$Compute$$\lim \limits_{n\to \infty}\left(1+e^{s_n}-e^{s_{n+1}}\right)^{\sqrt[n]{a_nb_n}}$$
Triangle $ABC$ is given, where $AC<BC$ and $\angle ACB=60^\circ\!\!.$ Point $D$, distinct from $A$, lies on the segment $AC$ such that $AB=BD$, and point $E$, distinct from $B$, lies on the line $BC$ such that $AB=AE$. Prove that $\angle DEC=30^\circ$.