Does there exist two unfair dices such that probability of their sum being $j$ be a number in $\left(\frac2{33},\frac4{33}\right)$ for each $2\leq j\leq 12$?

Let $ABCD$ be a cyclic quadrilateral. Assume that the points $Q, A, B, P$ are collinear in this order, in such a way that the line $AC$ is tangent to the circle $ADQ$, and the line $BD$ is tangent to the circle $BCP$. Let $M$ and $N$ be the midpoints of segments $BC$ and $AD$, respectively. Prove that the following three lines are concurrent: line $CD$, the tangent of circle $ANQ$ at point $A$, and the tangent to circle $BMP$ at point $B$.

Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC = 20$, and $CD = 30$. Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E$, and $AE = 5$. What is the area of quadrilateral $ABCD$? $\textbf{(A) } 330 \qquad\textbf{(B) } 340 \qquad\textbf{(C) } 350 \qquad\textbf{(D) } 360 \qquad\textbf{(E) } 370$

Let $p$ be an odd prime number. Suppose $P$ and $Q$ are polynomials with integer coefficients such that $P(0)=Q(0)=1$, there is no nonconstant polynomial dividing both $P$ and $Q$, and \[ 1 + \cfrac{x}{1 + \cfrac{2x}{1 + \cfrac{\ddots}{1 + (p-1)x}}}=\frac{P(x)}{Q(x)}. \] Show that all coefficients of $P$ except for the constant coefficient are divisible by $p$, and all coefficients of $Q$ are [i]not[/i] divisible by $p$. [i]Andrew Gu[/i]

The sequence $\{a_n\}$ is defined by: $a_1=\frac{21}{16}$, and for $n\ge2$,\[ 2a_n-3a_{n-1}=\frac{3}{2^{n+1}}. \]Let $m$ be an integer with $m\ge2$. Prove that: for $n\le m$, we have\[ \left(a_n+\frac{3}{2^{n+3}}\right)^{\frac{1}{m}}\left(m-\left(\frac{2}{3}\right)^{{\frac{n(m-1)}{m}}}\right)<\frac{m^2-1}{m-n+1}. \]

As shown in the figure, $\odot O$ is the circumcircle of $\vartriangle ABC$, $\odot J$ is inscribed in $\odot O$ and is tangent to $AB$, $AC$ at points $D$ and E respectively, line segment $FG$ and $\odot O$ are tangent to point $A$, and $AF =AG=AD$, the circumscribed circle of $\vartriangle AFB$ intersects $\odot J$ at point $S$. Prove that the circumscribed circle of $\vartriangle ASG$ is tangent to $\odot J$. [img]https://cdn.artofproblemsolving.com/attachments/a/a/62d44e071ea9903ebdd68b43943ba1d93b4138.png[/img]

In the parallelogram $CMNP$ extend the bisectors of angles $MCN$ and $PCN$ and intersect with extensions of sides PN and $MN$ at points $A$ and $B$, respectively. Prove that the bisector of the original angle $C$ of the the parallelogram is perpendicular to $AB$. [img]https://cdn.artofproblemsolving.com/attachments/f/3/fde8ef133758e06b1faf8bdd815056173f9233.png[/img]

Mariana plays with an $8\times 8$ board with all its squares blank. She says that two houses are [i]neighbors [/i] if they have a common side or vertex, that is, two houses can be neighbors vertically, horizontally or diagonally. The game consists of filling the $64$ squares on the board, one after the other, each with a number according to the following rule: she always chooses a house blank and fill it with an integer equal to the number of neighboring houses that are still in White. Once this is done, the house is no longer considered blank. Show that the value of the sum of all $64$ numbers written on the board at the end of the game does not depend in the order of filling. Also, calculate the value of this sum. Note: A house is not neighbor to itself. [hide=original wording]Mariana brinca com um tabuleiro 8 x 8 com todas as suas casas em branco. Ela diz que duas casas s˜ao vizinhas se elas possu´ırem um lado ou um v´ertice em comum, ou seja, duas casas podem ser vizinhas verticalmente, horizontalmente ou diagonalmente. A brincadeira consiste em preencher as 64 casas do tabuleiro, uma ap´os a outra, cada uma com um n´umero de acordo com a seguinte regra: ela escolhe sempre uma casa em branco e a preenche com o n´umero inteiro igual `a quantidade de casas vizinhas desta que ainda estejam em branco. Feito isso, a casa n˜ao ´e mais considerada em branco. Demonstre que o valor da soma de todos os 64 n´umeros escritos no tabuleiro ao final da brincadeira n˜ao depende da ordem do preenchimento. Al´em disso, calcule o valor dessa soma. Observa¸c˜ao: Uma casa n˜ao ´e vizinha a si mesma[/hide]

For certain ordered pairs $(a,b)$ of real numbers, the system of equations \begin{eqnarray*} && ax+by =1\\ &&x^2+y^2=50\end{eqnarray*} has at least one solution, and each solution is an ordered pair $(x,y)$ of integers. How many such ordered pairs $(a,b)$ are there?

The Sultan gathered $300$ court sages and offered them a test. There are caps of $25$ different colors, known in advance to the sages. The Sultan said that one of these caps will be put on each of the sages, and if for each color write the number of caps worn, then all numbers will be different. Every sage can see the caps of the other sages, but not own cap. Then all the sages will simultaneously announce the supposed color of their cap. Can sages advance agree to act in such a way that at least $150$ of them are guaranteed to name a color right?

$4.$ Let there be a variable positive integer whose last two digits are $3's$. Prove that this number is divisible by a prime greater than $7$.

Find integer solutions of the equation $x^3 - 2y^3 - 4z^3 = 0$.

Find all functions $f : R_+ \to R_+$ such that $$x^2(f(x)+f(y)) = (x+y)f(f(x)y)$$ for all positive real $x, y$.

A circle with a circumscribed and an inscribed square centered at the origin $ O$ of a rectangular coordinate system with positive $ x$ and $ y$ axes $ OX$ and $ OY$ is shown in each figure $ I$ to $ IV$ below. [asy] size((400)); draw((0,0)--(22,0), EndArrow); draw((10,-10)--(10,12), EndArrow); draw((25,0)--(47,0), EndArrow); draw((35,-10)--(35,12), EndArrow); draw((-25,0)--(-3,0), EndArrow); draw((-15,-10)--(-15,12), EndArrow); draw((-50,0)--(-28,0), EndArrow); draw((-40,-10)--(-40,12), EndArrow); draw(Circle((-40,0),6)); draw(Circle((-15,0),6)); draw(Circle((10,0),6)); draw(Circle((35,0),6)); draw((-34,0)--(-40,6)--(-46,0)--(-40,-6)--(-34,0)--(-34,6)--(-46,6)--(-46,-6)--(-34,-6)--cycle); draw((-6.5,0)--(-15,8.5)--(-23.5,0)--(-15,-8.5)--cycle); draw((-10.8,4.2)--(-19.2,4.2)--(-19.2,-4.2)--(-10.8,-4.2)--cycle); draw((14.2,4.2)--(5.8,4.2)--(5.8,-4.2)--(14.2,-4.2)--cycle); draw((16,6)--(4,6)--(4,-6)--(16,-6)--cycle); draw((41,0)--(35,6)--(29,0)--(35,-6)--cycle); draw((43.5,0)--(35,8.5)--(26.5,0)--(35,-8.5)--cycle); label("I", (-49,9)); label("II", (-24,9)); label("III", (1,9)); label("IV", (26,9)); label("X", (-28,0), S); label("X", (-3,0), S); label("X", (22,0), S); label("X", (47,0), S); label("Y", (-40,12), E); label("Y", (-15,12), E); label("Y", (10,12), E); label("Y", (35,12), E);[/asy] The inequalities \[ |x| \plus{} |y| \leq \sqrt {2(x^2 \plus{} y^2)} \leq 2\mbox{Max}(|x|, |y|)\] are represented geometrically* by the figure numbered $ \textbf{(A)}\ I \qquad \textbf{(B)}\ II \qquad \textbf{(C)}\ III \qquad \textbf{(D)}\ IV \qquad \textbf{(E)}\ \mbox{none of these}$ *An inequality of the form $ f(x, y) \leq g(x, y)$, for all $ x$ and $ y$ is represented geometrically by a figure showing the containment \[ \{\mbox{The set of points }(x, y)\mbox{ such that }g(x, y) \leq a\} \subset\\ \{\mbox{The set of points }(x, y)\mbox{ such that }f(x, y) \leq a\}\] for a typical real number $ a$.

For a constant $p$ such that $\int_1^p e^xdx=1$, prove that \[\left(\int_1^p e^x\cos x\ dx\right)^2+\left(\int_1^p e^x\sin x\ dx\right)^2>\frac 12.\] Own