In the cube $ABCDEFGH$ with opposite vertices $C$ and $E,$ $J$ and $I$ are the midpoints of edges $\overline{FB}$ and $\overline{HD},$ respectively. Let $R$ be the ratio of the area of the cross-section $EJCI$ to the area of one of the faces of the cube. What is $R^2?$ [asy] size(6cm); pair A,B,C,D,EE,F,G,H,I,J; C = (0,0); B = (-1,1); D = (2,0.5); A = B+D; G = (0,2); F = B+G; H = G+D; EE = G+B+D; I = (D+H)/2; J = (B+F)/2; filldraw(C--I--EE--J--cycle,lightgray,black); draw(C--D--H--EE--F--B--cycle); draw(G--F--G--C--G--H); draw(A--B,dashed); draw(A--EE,dashed); draw(A--D,dashed); dot(A); dot(B); dot(C); dot(D); dot(EE); dot(F); dot(G); dot(H); dot(I); dot(J); label("$A$",A,E); label("$B$",B,W); label("$C$",C,S); label("$D$",D,E); label("$E$",EE,N); label("$F$",F,W); label("$G$",G,N); label("$H$",H,E); label("$I$",I,E); label("$J$",J,W); [/asy] $\textbf{(A) } \frac{5}{4} \qquad \textbf{(B) } \frac{4}{3} \qquad \textbf{(C) } \frac{3}{2} \qquad \textbf{(D) } \frac{25}{16} \qquad \textbf{(E) } \frac{9}{4}$

A positive integer is [i]detestable[/i] if the sum of its digits is a multiple of $11$. How many positive integers below $10000$ are detestable? [i]Proposed by Giacomo Rizzo[/i]

Let $ABC$ be an acute non-isosceles triangle with circumcircle $\omega$, circumcenter $O$ and orthocenter $H$. We draw a line perpendicular to $AH$ through $O$ and a line perpendicular to $AO$ through $H$. Prove that the points of intersection of these lines with sides $AB$ and $AC$ lie on a circle, which is tangent to $\omega$. [i]Proposed by A. Kuznetsov[/i]

A circle of length $10$ is inscribed in a convex polygon with perimeter $15$. What part of the area of this polygon is occupied by the resulting circle?

Let $P(x)=c_nx^n+c_{n-1}x^{n-1}+\cdots+c_0$ be a polynomial with integer coefficients. Suppose that $r$ is a rational number such that $P(r)=0$. Show that the $n$ numbers $c_nr, c_nr^2+c_{n-1}r, c_nr^3+c_{n-1}r^2+c_{n-1}r, \dots, c_nr^n+c_{n-1}r^{n-1}+\cdots+c_1r$ are all integers.

Numbers $\frac{49}{1}, \frac{49}{2}, ... , \frac{49}{97}$ are writen on a blackboard. Each time, we can replace two numbers (like $a, b$) with $2ab-a-b+1$. After $96$ times doing that prenominate action, one number will be left on the board. Find all the possible values fot that number.

For which positive integer n can you color the numbers 1,2...2n with n colors, such that every color is used twice and the numbers 1,2,3...n occur as difference of two numbers of the same color exatly once.

In $\triangle ABC,\sin A=\frac{3}{5},\cos B=\frac{5}{13}$, then $\cos C=$________.

A parallelogram $ABCD$ is given. On the diagonal BD, a point $P$ is selected such that $AP = BD$ is satisfied. Point $Q$ is the midpoint of segment $CP$. Prove that $\angle BQD = 90^o$. [img]https://cdn.artofproblemsolving.com/attachments/2/0/4bc69ec0330e2afa6b560c56da5dd783b16efb.png[/img] .

we named a $n*n$ table $selfish$ if we number the row and column with $0,1,2,3,...,n-1$.(from left to right an from up to down) for every {$ i,j\in{0,1,2,...,n-1}$} the number of cell $(i,j)$ is equal to the number of number $i$ in the row $j$. for example we have such table for $n=5$ 1 0 3 3 4 1 3 2 1 1 0 1 0 1 0 2 1 0 0 0 1 0 0 0 0 prove that for $n>5$ there is no $selfish$ table

Find all positive integers $(m,n)$ such that $m^2 + n^2 + 3 = 4(m + n)$

In the middle cell of the $1 \times 2005$ strip there is a chip. Two players each queues move it: first, the first player moves the piece one cell in any direction, then the second one moves it $2$ cells, the $1$st - by $4$ cells, the 2nd by $8$, etc. (the $k$-th shift occurs by $2^{k-1}$ cells). That, whoever cannot make another move loses. Who can win regardless of the opponent's play?

Consider an $m$-by-$n$ grid of unit squares, indexed by $(i, j)$ with $1 \leq i \leq m$ and $1 \leq j \leq n$. There are $(m-1)(n-1)$ coins, which are initially placed in the squares $(i, j)$ with $1 \leq i \leq m-1$ and $1 \leq j \leq n-1$. If a coin occupies the square $(i, j)$ with $i \leq m-1$ and $j \leq n-1$ and the squares $(i+1, j),(i, j+1)$, and $(i+1, j+1)$ are unoccupied, then a legal move is to slide the coin from $(i, j)$ to $(i+1, j+1)$. How many distinct configurations of coins can be reached starting from the initial configuration by a (possibly empty) sequence of legal moves?

n points are taken in the plane, no three collinear. Some of the line segments between the points are painted red and some are painted blue, so that between any two points there is a unique path along colored edges. Show that the uncolored edges can be painted (each edge either red or blue) so that all triangles have an odd number of red sides.

$P(x)$ and $Q(x)$ are two polynomials with integer coefficients such that $P(x)|Q(x)^2+1$. [b]a)[/b] Prove that there exists polynomials $A(x)$ and $B(x)$ with rational coefficients and a rational number $c$ such that $P(x)=c(A(x)^2+B(x)^2)$. [b]b)[/b] If $P(x)$ is a monic polynomial with integer coefficients, Prove that there exists two polynomials $A(x)$ and $B(x)$ with integer coefficients such that $P(x)$ can be written in the form of $A(x)^2+B(x)^2$. [i]Proposed by Mohammad Gharakhani[/i]

Written on a blackboard are $n$ nonnegative integers whose greatest common divisor is $1$. A [i]move[/i] consists of erasing two numbers $x$ and $y$, where $x\ge y$, on the blackboard and replacing them with the numbers $x-y$ and $2y$. Determine for which original $n$-tuples of numbers on the blackboard is it possible to reach a point, after some number of moves, where $n-1$ of the numbers of the blackboard are zeroes.

Let $A$ and $B$ points in the plane and $C$ a point in the perpendiclar bisector of $AB$. It is constructed a sequence of points $C_1,C_2,\dots, C_n,\dots$ in the following way: $C_1=C$ and for $n\geq1$, if $C_n$ does not belongs to $AB$, then $C_{n+1}$ is the circumcentre of the triangle $\triangle{ABC_n}$. Find all the points $C$ such that the sequence $C_1,C_2,\dots$ is defined for all $n$ and turns eventually periodic. Note: A sequence $C_1,C_2, \dots$ is called eventually periodic if there exist positive integers $k$ and $p$ such that $C_{n+p}=c_n$ for all $n\geq{k}$.

Prove that the inequality $$\frac{4}{a+bc+4}+\frac{4}{b+ca+4}+\frac{4}{c+ab+4}\le 1+\frac{1}{2a+1}+\frac{1}{2b+1}+\frac{1}{2c+1}$$ holds for all positive reals $a,b,c$ such that $a^2+b^2+c^2+abc=4$.

What is the last two digits of the number $(11 + 12 + 13 + ... + 2006)^2$?

Let $M, N$ be points inside the angle $\angle BAC$ usch that $\angle MAB\equiv \angle NAC$. If $M_{1}, M_{2}$ and $N_{1}, N_{2}$ are the projections of $M$ and $N$ on $AB, AC$ respectively then prove that $M, N$ and $P$ the intersection of $M_{1}N_{2}$ with $N_{1}M_{2}$ are collinear.

In a country, there are some cities and the city named [i]Ben Song[/i] is capital. Each cities are connected with others by some two-way roads. One day, the King want to choose $n$ cities to add up with [i]Ben Song[/i] city to establish an [i]expanded capital[/i] such that the two following condition are satisfied: (i) With every two cities in [i]expanded capital[/i], we can always find a road connecting them and this road just belongs to the cities of [i]expanded capital[/i]. (ii) There are exactly $k$ cities which do not belong to [i]expanded capital[/i] have the direct road to at least one city of [i]expanded capital[/i]. Prove that there are at most $\binom{n+k}{k}$ options to expand the capital for the King.

Prove that for every positive integer $t$ there is a unique permutation $a_0, a_1, \ldots , a_{t-1}$ of $0, 1, \ldots , t-1$ such that, for every $0 \leq i \leq t-1$, the binomial coefficient $\binom{t+i}{2a_i}$ is odd and $2a_i \neq t+i$.

Consider a quadrilateral $ABCD$ and points $K, L, M, N$ on sides $AB, BC, CD$ and $AD$, respectively, such that $KB = BL = a, MD = DN = b$ and $KL \nparallel MN$. Find the set of all the intersection points of $KL$ with $MN$ as $a$ and $b$ vary.

Let $ k$ and $ n$ be integers with $ 0\le k\le n \minus{} 2$. Consider a set $ L$ of $ n$ lines in the plane such that no two of them are parallel and no three have a common point. Denote by $ I$ the set of intersections of lines in $ L$. Let $ O$ be a point in the plane not lying on any line of $ L$. A point $ X\in I$ is colored red if the open line segment $ OX$ intersects at most $ k$ lines in $ L$. Prove that $ I$ contains at least $ \dfrac{1}{2}(k \plus{} 1)(k \plus{} 2)$ red points. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

In the plane with coordinates $x,y$, find an example of a convex set $M$ that contains infinitely many lattice points (i.e. points with integer coordinates), but at the same time only finitely many lattice points from $M$ lie on each line in that plane.