Found problems: 85335
In which set are both elements metalloids?
${ \textbf{(A)}\ \text{Cr and Mo}\qquad\textbf{(B)}\ \text{Ge and As}\qquad\textbf{(C)}\ \text{Sn and Pb}\qquad\textbf{(D)}}\ \text{Se and Br}\qquad $
We randomly choose 5 distinct positive integers less than or equal to 90. What is the floor of 10 times the expected value of the fourth largest number?
All the $7$ digit numbers containing each of the digits $1,2,3,4,5,6,7$ exactly once , and not divisible by $5$ are arranged in increasing order. Find the $200th$ number in the list.
Two players take turns writing down all proper non-decreasing fractions with denominators from $1 $ to $1999$ and at the same time writing a "$+$" sign before each fraction. After all such fractions are written out, their sum is found. If this amount is an integer number, then the one who made the entry last wins, otherwise his opponent wins. Who will be able to secure a win?
Let $ABC$ be an acute triangle and let $X$ and $Y$ be points on the segments $AB$ and $AC$ such that $BX = CY$. If $I_{B}$ and $I_{C}$ are centers of inscribed circles in triangles $ABY$ and $ACX$, and $T$ is the second intersection point of the circumcircles of $ABY$ and $ACX$, show that:
$$\frac{TI_{B}}{TI_{C}} = \frac{BY}{CX}.$$
[i]Proposed by Nikola Velov[/i]
Find all nonnegative integers $a$ and $b$ that satisfy the equation $$3 \cdot 2^a + 1 = b^2.$$
For positive integral $k>1$, we let $p(k)$ be its smallest prime divisor. Given an integer $a_1>2$, we define an infinite sequence $a_n$ by $a_{n+1}=a_n^n-1$ for each $n\geq 1$. For which values of $a_1$ is the sequence $p(a_n)$ bounded?
Show that the polynomial over variables $x,y,z$
\[
x^4(x-y)(x-z) + y^4(y-z)(y-x) + z^4(z-x)(z-y)
\]
can't be written as a finite sum of squares of real polynomials over $x,y,z$.
Let $ABC$ be an acute triangle, and let $X$ be a variable interior point on the minor arc $BC$ of its circumcircle. Let $P$ and $Q$ be the feet of the perpendiculars from $X$ to lines $CA$ and $CB$, respectively. Let $R$ be the intersection of line $PQ$ and the perpendicular from $B$ to $AC$. Let $\ell$ be the line through $P$ parallel to $XR$. Prove that as $X$ varies along minor arc $BC$, the line $\ell$ always passes through a fixed point. (Specifically: prove that there is a point $F$, determined by triangle $ABC$, such that no matter where $X$ is on arc $BC$, line $\ell$ passes through $F$.)
[i]Robert Simson et al.[/i]
Let $n$ be a positive integer. Given a sequence of nonnegative real numbers $x_1,\ldots ,x_n$ we define the [i]transformed sequence[/i] $y_1,\ldots ,y_n$ as follows: the number $y_i$ is the greatest possible value of the average of consecutive terms of the sequence that contain $x_i$. For example, the transformed sequence of $2,4,1,4,1$ is $3,4,3,4,5/2$.
Prove that
a) For every positive real number $t$, the number of $y_i$ such that $y_i>t$ is less than or equal to $\frac{2}{t}(x_1+\cdots +x_n)$.
b) The inequality $\frac{y_1+\cdots +y_n}{32n}\leq \sqrt{\frac{x_1^2+\cdots +x_n^2}{32n}}$ holds.
Determine all positive real numbers $x$ for which $$\left [x\right ]+\left [\sqrt{1996x}\right ]=1996$$ is verified
Clarification:The brackets indicate the integer part of the number they enclose.
The set of values of $m$ for which $x^2+3xy+x+my-m$ has two factors, with integer coefficients, which are linear in $x$ and $y$, is precisely:
$ \textbf{(A)}\ 0, 12, -12\qquad\textbf{(B)}\ 0, 12\qquad\textbf{(C)}\ 12, -12\qquad\textbf{(D)}\ 12\qquad\textbf{(E)}\ 0 $
Let be a real number $ c $ and a differentiable function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ such that
$$ f(c)\neq \frac{1}{b-a}\int_a^b f(x)dx, $$
for any real numbers $ a\neq b. $
Prove that $ f'(c)=0. $
[i]Florin Rotaru[/i]
Circle $C_0$ has radius $1$, and the point $A_0$ is a point on the circle. Circle $C_1$ has radius $r<1$ and is internally tangent to $C_0$ at point $A_0$. Point $A_1$ lies on circle $C_1$ so that $A_1$ is located $90^{\circ}$ counterclockwise from $A_0$ on $C_1$. Circle $C_2$ has radius $r^2$ and is internally tangent to $C_1$ at point $A_1$. In this way a sequence of circles $C_1,C_2,C_3,...$ and a sequence of points on the circles $A_1,A_2,A_3,...$ are constructed, where circle $C_n$ has radius $r^n$ and is internally tangent to circle $C_{n-1}$ at point $A_{n-1}$, and point $A_n$ lies on $C_n$ $90^{\circ}$ counterclockwise from point $A_{n-1}$, as shown in the figure below. There is one point $B$ inside all of these circles. When $r=\frac{11}{60}$, the distance from the center of $C_0$ to $B$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
[asy]
size(6cm);
real r = 0.8;
pair nthCircCent(int n){
pair ans = (0, 0);
for(int i = 1; i <= n; ++i)
ans += rotate(90 * i - 90) * (r^(i - 1) - r^i, 0);
return ans;
}
void dNthCirc(int n){
draw(circle(nthCircCent(n), r^n));
}
dNthCirc(0);
dNthCirc(1);
dNthCirc(2);
dNthCirc(3);
dot("$A_0$", (1, 0), dir(0));
dot("$A_1$", nthCircCent(1) + (0, r), dir(135));
dot("$A_2$", nthCircCent(2) + (-r^2, 0), dir(0));
[/asy]
Let $x$, $y$, $z > 0$ such that $x^2 + y^2 + z^2 = 3$. Then $$x^3\tan^{-1}\frac{1}{x}+y^3\tan^{-1}\frac{1}{y}+z^3\tan^{-1}\frac{1}{z}<\frac{\pi \sqrt{3}}{2}$$
There are $10000$ cities in country, and roads between some cities. Every city has $<100$ roads. Every cycle route with odd number of road consists of $\geq 101 $ roads.
Prove that we can divide all cities in $100$ groups with $100$ cities, such that every road leads from one group to other.
Given $n$ points, $n > 4$. Prove that tou can connect them with arrows, in such a way, that you can reach every point from every other point, having passed through one or two arrows. (You can connect every pair with one arrow only, and move along the arrow in one direction only.)
Compute \[ \displaystyle\sum_{n=0}^{\infty} \dfrac {n}{n^4 + n^2 + 1}. \]
Let $ABC$ be an isosceles triangle $(AB=AC)$ so that $\angle A< 2 \angle B$ . Let $D,Z $ points on the extension of height $AM$ so that $\angle CBD = \angle A$ and $\angle ZBA = 90^\circ$. Let $E$ the orthogonal projection of $M$ on height $BF$, and let $K$ the orthogonal projection of $Z$ on $AE$. Prove that $ \angle KDZ = \angle KDB = \angle KZB$.
Forty-nine students solve a set of 3 problems. The score for each problem is a whole number of points from 0 to 7. Prove that there exist two students $ A$ and $ B$ such that, for each problem, $ A$ will score at least as many points as $ B.$
For each positive integer $ n$, let $ f(n)$ denote the number of ways of representing $ n$ as a sum of powers of 2 with nonnegative integer exponents. Representations which differ only in the ordering of their summands are considered to be the same. For instance, $ f(4) \equal{} 4$, because the number 4 can be represented in the following four ways: 4; 2+2; 2+1+1; 1+1+1+1.
Prove that, for any integer $ n \geq 3$ we have $ 2^{\frac {n^2}{4}} < f(2^n) < 2^{\frac {n^2}2}$.
Let $S$ be a nonempty set of positive integers such that, for any (not necessarily distinct) integers $a$ and $b$ in $S$, the number $ab+1$ is also in $S$. Show that the set of primes that do not divide any element of $S$ is finite.
[i]Proposed by Carl Schildkraut[/i]
There is a triangle $ABC$ that $AB$ is not equal to $AC$.$BD$ is interior bisector of $\angle{ABC}$($D\in AC$) $M$ is midpoint of $CBA$ arc.Circumcircle of $\triangle{BDM}$ cuts $AB$ at $K$ and $J,$ is symmetry of $A$ according $K$.If $DJ\cap AM=(O)$, Prove that $J,B,M,O$ are cyclic.
Let $n$ be a natural number. Given a chessboard sized $m \times n$. The sides of the small squares of chessboard are not on the perimeter of the chessboard will be colored so that each small square has exactly two sides colored. Prove that a coloring like that is possible if and only if $m \cdot n$ is even.
Prove the inequality: $$\frac{1}{2}-\frac{1}{3}+\frac{1}{4}-\frac{1}{5}+...+\frac{1}{1974}-\frac{1}{1975}<\frac{2}{5}$$