Square $CASH$ and regular pentagon $MONEY$ are both inscribed in a circle. Given that they do not share a vertex, how many intersections do these two polygons have?

In a triangle $ABC$ let $I$ be the incenter. Prove that the circle passing through $A$ and touching $BI$ at $I$, and the circle passing through $B$ and touching $AI$ at $I$, intersect at a point on the circumcircle of $ABC$.

This requires some imagination and creative thinking: Prove or disprove: There exists a solid such that, for all positive integers $n$ with $n \geq 3$, there exists a "parallel projection" (I hope the terminology is clear) such that the image of the solid under this projection is a convex $n$-gon.

Olya wrote fractions of the form $1 / n$ on cards, where $n$ is all possible divisors the numbers $6^{100}$ (including the unit and the number itself). These cards she laid out in some order. After that, she wrote down the number on the first card, then the sum of the numbers on the first and second cards, then the sum of the numbers on the first three cards, etc., finally, the sum of the numbers on all the cards. Every amount Olya recorded on the board in the form of irreducible fraction. What is the least different denominators could be on the numbers on the board?

Two positive numbers $x$ and $y$ are in the ratio $a: b$ where $0 < a < b$. If $x+y = c$, then the smaller of $x$ and $y$ is $\textbf{(A)} \ \frac{ac}{b} \qquad \textbf{(B)} \ \frac{bc-ac}{b} \qquad \textbf{(C)} \ \frac{ac}{a+b} \qquad \textbf{(D)} \ \frac{bc}{a+b} \qquad \textbf{(E)} \ \frac{ac}{b-a}$

Let $a$ be a positive integer which is not a perfect square, and consider the equation \[k = \frac{x^2-a}{x^2-y^2}.\] Let $A$ be the set of positive integers $k$ for which the equation admits a solution in $\mathbb Z^2$ with $x>\sqrt{a}$, and let $B$ be the set of positive integers for which the equation admits a solution in $\mathbb Z^2$ with $0\leq x<\sqrt{a}$. Show that $A=B$.

Let $M_2(\mathbb{Z})$ be the set of $2 \times 2$ matrices with integer entries. Let $A \in M_2(\mathbb{Z})$ such that $$A^2+5I=0,$$ where $I \in M_2(\mathbb{Z})$ and $0 \in M_2(\mathbb{Z})$ denote the identity and null matrices, respectively. Prove that there exists an invertible matrix $C \in M_2(\mathbb{Z})$ with $C^{-1} \in M_2(\mathbb{Z})$ such that $$CAC^{-1} = \begin{pmatrix} 1 & 2\\ -3 & -1 \end{pmatrix} \text{ ou } CAC^{-1} = \begin{pmatrix} 0 & 1\\ -5 & 0 \end{pmatrix}.$$

What is the remainder when $2^{2013}$ is divided by $5$? $\text{(A) }0\qquad\text{(B) }1\qquad\text{(C) }2\qquad\text{(D) }3\qquad\text{(E) }4$

Find all polynomials $P(x)$ with real coefficients that satisfy the identity $$P(x^3-2)=P(x)^3-2,$$ for every real number $x$.

Triangle $ABC$ has $AB = 2$, $BC = 3$, $CA = 4$, and circumcenter $O$. If the sum of the areas of triangles $AOB$, $BOC$, and $COA$ is $\tfrac{a\sqrt{b}}{c}$ for positive integers $a$, $b$, $c$, where $\gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime, find $a+b+c$. [i]Proposed by Michael Tang[/i]

[b]7.1 . [/b] The area of the quadrilateral is $3$ cm$^2$ , and the lengths of its diagonals are $6$ cm and $2$ cm. Find the angle between the diagonals. [b]7.2[/b] Prove that the number $1 + 2^{3456789}$ is composite. [b]7.3[/b] $20$ people took part in the chess tournament. The participant who took clear (undivided) $19$th place scored $9.5$ points. How could they distribute points among other participants? [b]7.4[/b] The sum of the distances between the midpoints of opposite sides of a quadrilateral is equal to its semi-perimeter. Prove that this quadrilateral is a parallelogram. [b]7.5[/b] $40$ people travel on a bus without a conductor passengers carrying only coins in denominations of $10$, $15$ and $20$ kopecks. Total passengers have $ 49$ coins. Prove that passengers will not be able to pay the required amount of money to the ticket office and pay each other correctly. (Cost of a bus ticket in 1963 was 5 kopecks.) [b]7.6[/b] Some natural number $a$ is divided with a remainder by all natural numbers less than $a$. The sum of all the different (!) remainders turned out to be equal to $a$. Find $a$. [b]7.7[/b] Two squares were cut out of a chessboard. In what case is it possible and in what case not to cover the remaining squares of the board with dominoes (i.e., figures of the form $2\times 1$) without overlapping? PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983460_1963_leningrad_math_olympiad]here[/url].

The function $ f$ satisfies \[f(x) \plus{} f(2x \plus{} y) \plus{} 5xy \equal{} f(3x \minus{} y) \plus{} 2x^2 \plus{} 1\] for all real numbers $ x$, $ y$. Determine the value of $ f(10)$.

Let $a,b,c$ be sides of a triangle, show that \[\frac{(c+a-b)^{4}}{a(a+b-c)}+\frac{(a+b-c)^{4}}{b(b+c-a)}+\frac{(b+c-a)^{4}}{c(c+a-b)}\geq ab+bc+ca.\]

Take $r$ such that $1\le r\le n$, and consider all subsets of $r$ elements of the set $\{1,2,\ldots,n\}$. Each subset has a smallest element. Let $F(n,r)$ be the arithmetic mean of these smallest elements. Prove that: \[ F(n,r)={n+1\over r+1}. \]

Let $x$ and $y$ be real numbers such that $x^2 + y^2 - 1 < xy$. Prove that $x + y - |x - y| < 2$. Slovakia

In a triangle $ABC$ two points, $C_1$ and $A_1$ are marked on the sides $AB$ and $BC$ respectively (the points do not coincide with the vertices). Let $K$ be the midpoint of $A_1C_1$ and $I$ be the incentre of the triangle $ABC$. Given that the quadrilateral $A_1BC_1I$ is cyclic, prove that the angle $AKC$ is obtuse.

Let $ AD $ be the bisector of a triangle $ ABC $ $ (D \in BC) $ such that $ AB + AD = CD $ and $ AC + AD = BC $. Determine the measure of the angles of $ \vartriangle ABC $

A $3-4-5$ right triangle is inscribed in circle $A$, and a $5-12-13$ right triangle is inscribed in circle $B$. What is the ratio of the area of circle $A$ to the area of circle $B$? $\textbf{(A)}~\frac{9}{25}\qquad\textbf{(B)}~\frac{1}{9}\qquad\textbf{(C)}~\frac{1}{5}\qquad\textbf{(D)}~\frac{25}{169}\qquad\textbf{(E)}~\frac{4}{25}$

Let $ABCDEF$ be a convex hexagon such that $AB = BC, CD = DE$ and $EF = FA$. Prove that \[\frac{AB}{BE}+\frac{CD}{AD}+\frac{EF}{CF} \geq \frac{3}{2}.\]

Students in the class of Peter practice the addition and multiplication of integer numbers.The teacher writes the numbers from $1$ to $9$ on nine cards, one for each number, and places them in an ballot box. Pedro draws three cards, and must calculate the sum and the product of the three corresponding numbers. Ana and Julián do the same, emptying the ballot box. Pedro informs the teacher that he has picked three consecutive numbers whose product is $5$ times the sum. Ana informs that she has no prime number, but two consecutive and that the product of these three numbers is $4$ times the sum of them. What numbers did Julian remove?

For any finite sets $X$ and $Y$ of positive integers, denote by $f_X(k)$ the $k^{\text{th}}$ smallest positive integer not in $X$, and let $$X*Y=X\cup \{ f_X(y):y\in Y\}.$$Let $A$ be a set of $a>0$ positive integers and let $B$ be a set of $b>0$ positive integers. Prove that if $A*B=B*A$, then $$\underbrace{A*(A*\cdots (A*(A*A))\cdots )}_{\text{ A appears $b$ times}}=\underbrace{B*(B*\cdots (B*(B*B))\cdots )}_{\text{ B appears $a$ times}}.$$ [i]Proposed by Alex Zhai, United States[/i]

Let $ n$ be an integer,$ n \geq 3.$ Let $ x_1, x_2, \ldots, x_n$ be real numbers such that $ x_i < x_{i\plus{}1}$ for $ 1 \leq i \leq n \minus{} 1$. Prove that \[ \frac{n(n\minus{}1)}{2} \sum_{i < j} x_ix_j > \left(\sum^{n\minus{}1}_{i\equal{}1} (n\minus{}i)\cdot x_i \right) \cdot \left(\sum^{n}_{j\equal{}2} (j\minus{}1) \cdot x_j \right)\]

We put four numbers $1,2, 3,4$ around a circle in order. One starts at the number $1$ and every step, he moves to an adjacent number on either side. How many ways he can move such that sum of the numbers he visits in his path (including the starting number) is equal to $21$?

An ordered triple $(p, q, r)$ of prime numbers is called [i]parcera[/i] if $p$ divides $q^2-4$, $q$ divides $r^2-4$ and $r$ divides $p^2-4$. Find all parcera triples.

Suppose the polynomial $ x^{n} \plus{} a_{n \minus{} 1}x^{n \minus{} 1} \plus{} ... \plus{} a_{1} \plus{} a_{0}$ can be factorized as $ (x \plus{} r_{1})(x \plus{} r_{2})...(x \plus{} r_{n})$, with $ r_{1}, r_{2}, ..., r_{n}$ real numbers. Show that $ (n \minus{} 1)a_{n \minus{} 1}^{2}\geq\ 2na_{n \minus{} 2}$