Found problems: 85335
How many ways are there to arrange the numbers $1$ through $8$ into a $2$ by $4$ grid such that the sum of the numbers in each of the two rows are all multiples of $6,$ and the sum of the numbers in each of the four columns are all multiples of $3$?
Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps.
[list=1]
[*]select a $2\times 2$ square in the grid;
[*]flip the coins in the top-left and bottom-right unit squares;
[*]flip the coin in either the top-right or bottom-left unit square.
[/list]
Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves.
[i]Thanasin Nampaisarn, Thailand[/i]
The $ 8\times 18$ rectangle $ ABCD$ is cut into two congruent hexagons, as shown, in such a way that the two hexagons can be repositioned without overlap to form a square. What is $ y$?
[asy] unitsize(2mm); defaultpen(fontsize(10pt)+linewidth(.8pt)); dotfactor=4; draw((0,4)--(18,4)--(18,-4)--(0,-4)--cycle); draw((6,4)--(6,0)--(12,0)--(12,-4)); label("$D$",(0,4),NW); label("$C$",(18,4),NE); label("$B$",(18,-4),SE); label("$A$",(0,-4),SW); label("$y$",(9,1)); [/asy]$ \textbf{(A) } 6\qquad \textbf{(B) } 7\qquad \textbf{(C) } 8\qquad \textbf{(D) } 9\qquad \textbf{(E) } 10$
Find all integers $n$ for which each cell of $n \times n$ table can be filled with one of the letters $I,M$ and $O$ in such a way that:
[LIST]
[*] in each row and each column, one third of the entries are $I$, one third are $M$ and one third are $O$; and [/*]
[*]in any diagonal, if the number of entries on the diagonal is a multiple of three, then one third of the entries are $I$, one third are $M$ and one third are $O$.[/*]
[/LIST]
[b]Note.[/b] The rows and columns of an $n \times n$ table are each labelled $1$ to $n$ in a natural order. Thus each cell corresponds to a pair of positive integer $(i,j)$ with $1 \le i,j \le n$. For $n>1$, the table has $4n-2$ diagonals of two types. A diagonal of first type consists all cells $(i,j)$ for which $i+j$ is a constant, and the diagonal of this second type consists all cells $(i,j)$ for which $i-j$ is constant.
Real numbers $x,y$ satisfy that $(x+5)^2+(y-12)^2=14^2$, then the minumum value of $x^2+y^2$ is
$\text{(A)}2\qquad\text{(B)}1\qquad\text{(C)}\sqrt3\qquad\text{(D)}\sqrt2\qquad$
Below the standard representation of a positive integer $n$ is the representation understood by $n$ in the decimal system, where the first digit is different from $0$. Everyone positive integer n is now assigned a number $f(n)$ by using the standard representation of $n$ last digit is placed before the first.
Examples: $f(1992) = 2199$, $f(2000) = 200$.
Determine the smallest positive integer $n$ for which $f(n) = 2n$ holds.
Find the least number $A$ such that for any two squares of combined area $1$, a rectangle of area $A$ exists such that the two squares can be packed in the rectangle (without the interiors of the squares overlapping) . You may assume the sides of the squares will be parallel to the sides of the rectangle.
$x_1, x_2,\cdots,x_{n+1}$ are posive real numbers satisfying the equation
$\frac{1}{1+x_1} + \frac{1}{1+x_2} + \cdots + \frac{1}{1+x_{n+1}} =1$
Prove that $x_1x_2 \cdots x_{n+1} \geq n^{n+1}$.
Find all integers $x$ between 0 and the prime number 4099 such that $x^3 - 3$ is divisible by 4099.
If two dice are tossed, the probability that the product of the numbers showing on the tops of the dice is greater than $10$ is
$\text{(A)}\ \dfrac{3}{7} \qquad \text{(B)}\ \dfrac{17}{36} \qquad \text{(C)}\ \dfrac{1}{2} \qquad \text{(D)}\ \dfrac{5}{8} \qquad \text{(E)}\ \dfrac{11}{12}$
Let $a,b,c,d$ be positive real numbers such that $abcd=1$. Prove the inequality
\[\frac{1}{\sqrt{a+2b+3c+10}}+\frac{1}{\sqrt{b+2c+3d+10}}+\frac{1}{\sqrt{c+2d+3a+10}}+\frac{1}{\sqrt{d+2a+3b+10}} \le 1.\]
In a summer camp about Applied Maths, there are $8m+1$ boys (with $m > 5$) and some girls. Every girl is friend with exactly $3$ boys and for any $2$ boys, there is exactly $1$ girl who is their common friend. Let $n$ be the greatest number of girls that can be chosen from the camp to form a group such that every boy is friend with at most $1$ girl in the group. Prove that $n \geq 2m+1$.
Let $ABCDEF$ be a regular hexagon with side length $2$. A circle with radius $3$ and center at $A$ is drawn. Find the area inside quadrilateral $BCDE$ but outside the circle.
[i]Proposed by Carl Joshua Quines.[/i]
A sequence of positive integers $a_1,a_2,\ldots $ is such that for each $m$ and $n$ the following holds: if $m$ is a divisor of $n$ and $m<n$, then $a_m$ is a divisor of $a_n$ and $a_m<a_n$. Find the least possible value of $a_{2000}$.
Let $ABC$ be a triangle. Suppose that $X,Y$ are points in the plane such that $BX,CY$ are tangent to the circumcircle of $ABC$, $AB=BX,AC=CY$ and $X,Y,A$ are in the same side of $BC$. If $I$ be the incenter of $ABC$ prove that $\angle BAC+\angle XIY=180$.
Side $AB$ of triangle $ABC$ has length $8$ inches. Line $DEF$ is drawn parallel to $AB$ so that $D$ is on segment $AC$, and $E$ is on segment $BC$. Line $AE$ extended bisects angle $FEC$. If $DE$ has length $5$ inches, then the length of $CE$, in inches, is:
$\textbf{(A)}\ \dfrac{51}{4} \qquad
\textbf{(B)}\ 13 \qquad
\textbf{(C)}\ \dfrac{53}{4} \qquad
\textbf{(D)}\ \dfrac{40}{3} \qquad
\textbf{(E)}\ \dfrac{27}{2} $
Determine all pairs $(a,b)$ of positive integers satisfying
\[a^2+b\mid a^2b+a\quad\text{and}\quad b^2-a\mid ab^2+b.\]
Let $ABC$ be a triangle. The incircle of $ABC$ touches $BC,AC,AB$ at $D,E,F$, respectively. Each pair of the incircles of triangles $AEF, BDF,CED$ has two pair of common external tangents, one of them being one of the sides of $ABC$. Show that the other three tangents divide triangle $DEF$ into three triangles and three parallelograms.
Prove that there exist positive constants $c_1$ and $c_2$ with the following properties:
a) For all real $k>1$,
$$\left|\int^1_0\sqrt{1-x^2}\cos(kx)\text dx\right|<\frac{c_1}{k^{3/2}}.$$b) For all real $k>1$,
$$\left|\int^1_0\sqrt{1-x^2}\sin(kx)\text dx\right|<\frac{c_2}k.$$
Prove that for all natural $n\ge 6 000$ any convex $1994$-gon can be cut into $n$ such quadrilaterals thata circle can be circumscribed around each of them
Let $ABC$ be a non-equilateral triangle in the plane, and let $T$ be a point different from its vertices. Define $A_T$, $B_T$ and $C_T$ as the points where lines $AT$, $BT$, and $CT$ meet the circumcircle of $ABC$. Prove that there are exactly two points $P$ and $Q$ in the plane for which the triangles $A_PB_PC_P$ and $A_QB_QC_Q$ are equilateral. Prove furthermore that line $PQ$ contains the circumcenter of $\triangle ABC$.
Let $ABC$ be a an acute triangle. Points $A_1, B_1$ and $C_1$ are respectively the projections of the vertices $A, B$ and $C$ on the opposite sides of the triangle, the point $H$ is the orthocenter of the triangle, and the point $P$ is the middle of the segment $[AH]$. The lines $BH$ and $A_1C_1$, $P B_1$ and $AB$ intersect respectively at the points $M$ and $N$. Prove that the lines $MN$ and $BC$ are perpendicular.
Circles $\omega_1$ and $\omega_2$ intersect at points $A$ and $B$. A straight line is drawn through point $B$, which again intersects circles $\omega_1$ and $\omega_2$ at points $C$ and $D$, respectively. Point $E$, located on circle $\omega_1$ , satisfies the relation $CE = CB$ , and point $F$, located on circle $\omega_2$, satisfies the relation $DB = DF$. The line $BF$ intersects again the circle $\omega_1$ at the point $P$, and the line $BE$ intersects again the circle $\omega_2$ at the point $Q$. Prove that the points $A, P$, and $Q$ are collinear.
Given a triangle $ABC$ for which $\angle BAC \neq 90^{\circ}$, let $B_1, C_1$ be variable points on $AB,AC$, respectively. Let $B_2,C_2$ be the points on line $BC$ such that a spiral similarity centered at $A$ maps $B_1C_1$ to $C_2B_2$. Denote the circumcircle of $AB_1C_1$ by $\omega$. Show that if $B_1B_2$ and $C_1C_2$ concur on $\omega$ at a point distinct from $B_1$ and $C_1$, then $\omega$ passes through a fixed point other than $A$.
[i]Proposed by Max Jiang[/i]
Let $P$ be a regular $2006$-gon. A diagonal is called [i]good[/i] if its endpoints divide the boundary of $P$ into two parts, each composed of an odd number of sides of $P$. The sides of $P$ are also called [i]good[/i].
Suppose $P$ has been dissected into triangles by $2003$ diagonals, no two of which have a common point in the interior of $P$. Find the maximum number of isosceles triangles having two good sides that could appear in such a configuration.