Found problems: 85335
Jonathan and Justin each flip a coin eight times. Jonathan and Justin get $m, n$ heads respectively. What is the probability that the difference of that $|m-n| \equiv 0 $ mod $4$?
[i]Lightning 3.4[/i]
There is a connected network with $ 2008$ computers, in which any of the two cycles don't have any common vertex. A hacker and a administrator are playing a game in this network. On the $ 1st$ move hacker selects one computer and hacks it, on the $ 2nd$ move administrator selects another computer and protects it. Then on every $ 2k\plus{}1th$ move hacker hacks one more computer(if he can) which wasn't protected by the administrator and is directly connected (with an edge) to a computer which was hacked by the hacker before and on every $ 2k\plus{}2th$ move administrator protects one more computer(if he can) which wasn't hacked by the hacker and is directly connected (with an edge) to a computer which was protected by the administrator before for every $ k>0$. If both of them can't make move, the game ends. Determine the maximum number of computers which the hacker can guarantee to hack at the end of the game.
Find all positive real solutions to the equation
$x+\left\lfloor\frac x3\right\rfloor=\left\lfloor\frac{2x}3\right\rfloor+\left\lfloor\frac{3x}5\right\rfloor$
Let $C_1$ and $C_2$ be two concentric circles and $C_3$ an outer circle to $C_1$ inner to $C_2$ and tangent to both. If the radius of $C_2$ is equal to $ 1$, how much must the radius of $C_1$ be worth, so that the area of is twice that of $C_3$?
The buttons $\{\times, +, \div\}$ on a calculator have their functions swapped. A button instead performs one of the other two functions; no two buttons have the same function. The calculator claims that $2 + 3 \div 4 = 10$ and $4 \times 2 \div 3 = 5$. What does $4 + 3 \times 2 \div 1$ equal on this calculator?
$\textbf{(A) }4\qquad\textbf{(B) }5\qquad\textbf{(C) }7\qquad\textbf{(D) }9\qquad\textbf{(E) }10$
Let $ABC$ be a triangle and $D$ be a point on segment $AC$. The circumscribed circle of the triangle $BDC$ cuts $AB$ again at $E$ and the circumference circle of the triangle $ABD$ cuts $BC$ again at $F$. Prove that $AE = CF$ if and only if $BD$ is the interior bisector of $\angle ABC$.
Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.
How does one tile a plane, without gaps or overlappings, with the tiles equal to a given irregular quadrilateral?
A checkerboard consists of one-inch squares. A square card, $1.5$ inches on a side, is placed on the board so that it covers part or all of the area of each of $n$ squares. The maximum possible value of $n$ is
$\text{(A)}\ 4\text{ or }5 \qquad \text{(B)}\ 6\text{ or }7\qquad \text{(C)}\ 8\text{ or }9 \qquad \text{(D)}\ 10\text{ or }11 \qquad \text{(E)}\ 12\text{ or more}$
Consider the cyclic quadrilateral $ABCD$. Let $M$ be the point of intersection of its diagonals, and $L$ be the midpoint of the arc $AD$ (not containing other vertices of the quadrilateral). Prove that the distances from $L$ to the centers of the circles inscribed in triangles $ABM$ and $CDM$ are equal.
The points $A_1,B_1,C_1$ lie on the sides sides $BC,AC$ and $AB$ of the triangle $ABC$ respectively. Suppose that $AB_1-AC_1=CA_1-CB_1=BC_1-BA_1$. Let $I_A, I_B, I_C$ be the incentres of triangles $AB_1C_1,A_1BC_1$ and $A_1B_1C$ respectively. Prove that the circumcentre of triangle $I_AI_BI_C$ is the incentre of triangle $ABC$.
Let $a_1=5$ and $a_{n+1}= a^2_{n}-2$ for any $n=1,2,...$.
a) Find $\lim_{n \rightarrow \infty}\frac{a_{n+1}}{a_1a_2 ...a_{n}}$
b) Find $\lim_{\nu \rightarrow \infty}\left(\frac{1}{a_1}+\frac{1}{a_1a_2}+...+\frac{1}{a_1a_2 ...a_{\nu}}\right)$
Let $a,b,c$ be positive reals. Find the minimum value of
$$\dfrac{13a+13b+2c}{2a+2b}+\dfrac{24a-b+13c}{2b+2c}+\dfrac{(-a+24b+13c)}{2c+2a}$$.
(1)What is the minimum value?
(2)If the minimum value occurs when $(a,b,c)=(a_0,b_0,c_0)$,then find $\frac{b_0}{a_0}+\frac{c_0}{b_0}$.
Let $ f$ be a function from the set of real numbers $ \mathbb{R}$ into itself such for all $ x \in \mathbb{R},$ we have $ |f(x)| \leq 1$ and
\[ f \left( x \plus{} \frac{13}{42} \right) \plus{} f(x) \equal{} f \left( x \plus{} \frac{1}{6} \right) \plus{} f \left( x \plus{} \frac{1}{7} \right).\]
Prove that $ f$ is a periodic function (that is, there exists a non-zero real number $ c$ such $ f(x\plus{}c) \equal{} f(x)$ for all $ x \in \mathbb{R}$).
A series of figures is shown in the picture below, each one of them created by following a secret rule. If the leftmost figure is considered the first figure, how many squares will the 21st figure have?
[img]http://www.artofproblemsolving.com/Forum/download/file.php?id=49934[/img]
Note: only the little squares are to be counted (i.e., the $2 \times 2$ squares, $3 \times 3$ squares, $\dots$ should not be counted)
Extra (not part of the original problem): How many squares will the 21st figure have, if we consider all $1 \times 1$ squares, all $2 \times 2$ squares, all $3 \times 3$ squares, and so on?.
In a country, there are towns, some of which are connected by roads. There is a route (not necessarily direct) between every two towns. The Minister of Education has ensured that every town without a school is connected via a direct road to a town that has a school. The Minister of State Optimization wants to ensure that there is a unique path between any two towns (without repeating traveled segments), which may require removing some roads.
Is it always possible to achieve this without constructing additional schools while preserving what the Minister of Education has accomplished?
Fames is playing a computer game with falling two-dimensional blocks. The playing field is $7$ units wide and infinitely tall with a bottom border. Initially the entire field is empty. Each turn, the computer gives Fames a $1\times 3$ solid rectangular piece of three unit squares. Fames must decide whether to orient the piece horizontally or vertically and which column(s) the piece should occupy ($3$ consecutive columns for horizontal pieces, $1$ column for vertical pieces). Once he confirms his choice, the piece is dropped straight down into the playing field in the selected columns, stopping all three of the piece's squares as soon as the piece hits either the bottom of the playing field or any square from another piece. All of the pieces must be contained completely inside the playing field after dropping and cannot partially occupy columns.
If at any time a row of $7$ spaces is all filled with squares, Fames scores a point.
Unfortunately, Fames is playing in [i]invisible mode[/i], which prevents him from seeing the state of the playing field or how many points he has, and he has already arbitrarily dropped some number of pieces without remembering what he did with them or how many there were.
For partial credit, find a strategy that will allow Fames to eventually earn at least one more point. For full credit, find a strategy for which Fames can correctly announce "I have earned at least one more point" and know that he is correct.
Let $n$ be a positive integer and $x_1,x_2,...,x_n$ be integer numbers such that $$x_1^2+x_2^2+...+x_n^2+ n^3 \le (2n - 1)(x_1+x_2+...+x_n ) + n^2$$ .
Show that :
a) $x_1,x_2,...,x_n$ are non-negative integers
b) the number $x_1+x_2+...+x_n+n+1$ is not a perfect square.
Let $f:[0,1]\to\mathbb{R}$ be a continuous function and let $\{a_n\}_n$, $\{b_n\}_n$ be sequences of reals such that
\[ \lim_{n\to\infty} \int^1_0 | f(x) - a_nx - b_n | dx = 0 . \]
Prove that:
a) The sequences $\{a_n\}_n$, $\{b_n\}_n$ are convergent;
b) The function $f$ is linear.
Let $ ABCD$ be a convex quadrilateral such that $ AB$ and $ CD$ are not parallel and $ AB\equal{}CD$. The midpoints of the diagonals $ AC$ and $ BD$ are $ E$ and $ F$, respectively. The line $ EF$ meets segments $ AB$ and $ CD$ at $ G$ and $ H$, respectively. Show that $ \angle AGH \equal{} \angle DHG$.
How many positive factors does $23,232$ have?
$\textbf{(A) }9\qquad\textbf{(B) }12\qquad\textbf{(C) }28\qquad\textbf{(D) }36\qquad\textbf{(E) }42$
Let $a_1,a_2,..., a_n$ be different integers and let $(b_1,b_2,..., b_n),(c_1,c_2,..., c_n)$ be two of their permutations, different from the identity. Prove that
$$(|a_1-b_1|+|a_2-b_2|+...+|a_n-b_n| , |a_1-c_1|+|a_2-c_2|+...+|a_n-c_n| ) \ge 2$$
where $(x,y)$ denotes the greatest common divisor of the numbers $x,y$
Let $n=>2$ be a natural number. A set $S$ of natural numbers is called $complete$ if, for any integer $0<=x<n$, there is a subset of $S$ with the property that the remainder of the division by $n$ of the sum of the elements in the subset is $x$. The sum of the elements of the empty set is considered to be $0$. Show that if a set $S$ is $complete$, then there is a subset of $S$ which has at most $n-1$ elements and which is still $complete$.
A triangle with vertices $A(0, 2)$, $B(-3, 2)$, and $C(-3, 0)$ is reflected about the $x$-axis, then the image $\triangle A'B'C'$ is rotated counterclockwise about the origin by $90^{\circ}$ to produce $\triangle A''B''C''$. Which of the following transformations will return $\triangle A''B''C''$ to $\triangle ABC$?
$\textbf{(A)}$ counterclockwise rotation about the origin by $90^{\circ}$.
$\textbf{(B)}$ clockwise rotation about the origin by $90^{\circ}$.
$\textbf{(C)}$ reflection about the $x$-axis
$\textbf{(D)}$ reflection about the line $y = x$
$\textbf{(E)}$ reflection about the $y$-axis.
In a triangle $ABC$ with $\angle B < 45^{\circ}$, $D$ is a point on $BC$ such that the incenter of $\triangle ABD$ coincides with the circumcenter $O$ of $\triangle ABC$. Let $P$ be the intersection point of the tangent lines to the circumcircle $\omega$ of $\triangle AOC$ at points $A$ and $C$. The lines $AD$ and $CO$ meet at $Q$. The tangent to $\omega$ at $O$ meets $PQ$ at $X$. Prove that $XO=XD$.