Let $P$ be an interior point of a circle and $A_1,A_2...,A_{10}$ be points on the circle such that $\angle A_1PA_2 = \angle A_2PA_3 = ... = \angle A_{10}PA_1 = 36^o$. Prove that $PA_1 + PA_3 + PA_5 + PA_7 +PA_9 = PA_2 + PA_4 + PA_6 + PA_8 + PA_{10}$.

Let $n$ be a positive integer. Suppose that we have disks of radii $1, 2, . . . , n.$ Of each size there are two disks: a transparent one and an opaque one. In every disk there is a small hole in the centre, with which we can stack the disks using a vertical stick. We want to make stacks of disks that satisfy the following conditions: $i)$ Of each size exactly one disk lies in the stack. $ii)$ If we look at the stack from directly above, we can see the edges of all of the $n$ disks in the stack. (So if there is an opaque disk in the stack,no smaller disks may lie beneath it.) Determine the number of distinct stacks of disks satisfying these conditions. (Two stacks are distinct if they do not use the same set of disks, or, if they do use the same set of disks and the orders in which the disks occur are different.)

Let $p_n(k)$ be the number of permutations of the set $\{1,2,3,\ldots,n\}$ which have exactly $k$ fixed points. Prove that $\sum_{k=0}^nk p_n(k)=n!$.

Which of the following describes the graph of the equation $ (x \plus{} y)^2 \equal{} x^2 \plus{} y^2$? $ \textbf{(A)}\text{ the empty set}\qquad \textbf{(B)}\text{ one point}\qquad \textbf{(C)}\text{ two lines}$ $\textbf{(D)}\text{ a circle}\qquad \textbf{(E)}\text{ the entire plane}$

Let $ABCD$ be a convex quadrilateral. Prove that the circles inscribed in the triangles $ABC$, $BCD$, $CDA$ and $DAB$ have a common point if and only if $ABCD$ is a rhombus.

If the perimeter of a rectangle is $ p$ and its diagonal is $ d$, the difference between the length and width of the rectangle is: $ \textbf{(A)}\ \frac {\sqrt {8d^2 \minus{} p^2}}{2} \qquad\textbf{(B)}\ \frac {\sqrt {8d^2 \plus{} p^2}}{2} \qquad\textbf{(C)}\ \frac {\sqrt {6d^2 \minus{} p^2}}{2}$ $ \textbf{(D)}\ \frac {\sqrt {6d^2 \plus{} p^2}}{2} \qquad\textbf{(E)}\ \frac {8d^2 \minus{} p^2}{4}$

Prove that $$\int^{\frac\pi3}_{\frac\pi6}\frac u{\sin u}du=\frac83\sum_{k=0}^\infty\frac{(-1)^k}{3^k(2k+1)^2}+\frac{\pi\ln3}{3\sqrt3}-\frac{4C}3+\frac\pi6\ln\left(2+\sqrt3\right)-\operatorname{Im}\left(\frac2{\sqrt3}\operatorname{Li}_2\left(\frac{1-i\sqrt3}2\right)-\frac2{\sqrt3}\operatorname{Li}_2\left(\frac{\sqrt3-i}{2\sqrt3}\right)\right)$$ where as usual $$\operatorname{Li}_2(z)=-\int^z_0\frac{\ln(1-t)}tdt,z\in\mathbb C\setminus[1,\infty)$$ and $C=\sum_{k=0}^\infty\frac{(-1)^k}{(2k+1)^2}$ is the Catalan constant. [i]Proposed by Paolo Perfetti[/i]

Let $ABC$ be a triangle with inradius $r$, circumradius $R$, and with sides $a=BC,b=CA,c=AB$. Prove that \[\frac{R}{2r} \ge \left(\frac{64a^2b^2c^2}{(4a^2-(b-c)^2)(4b^2-(c-a)^2)(4c^2-(a-b)^2)}\right)^2.\]

Find all polynomials $P(x)$ with integer coefficients, such that for all positive integers $m, n$, $$m+n \mid P^{(m)}(n)-P^{(n)}(m).$$ [i]Proposed by Navid Safaei, Iran[/i]

The sword is a figure consisting of $6$ unit squares presented in the picture below (and any other figure obtained from it by rotation). [img]https://cdn.artofproblemsolving.com/attachments/4/3/08494627d043ea575703564e9e6b5ba63dc2ef.png[/img] Determine the largest number of swords that can be cut from a $6\times 11$ piece of paper divided into unit squares (each sword should consist of six such squares).

Find all positive integers n such that one can write an integer 1 to $ n^2$ into each unit square of a $ n^2 \times n^2$ table in such a way that, in each row, each column and each $ n \times n$ block of unit squares, each number 1 to $ n^2$ occurs exactly once.

Let $ ABCDE$ be a convex pentagon such that $ AB\plus{}CD\equal{}BC\plus{}DE$ and $ k$ a circle with center on side $ AE$ that touches the sides $ AB$, $ BC$, $ CD$ and $ DE$ at points $ P$, $ Q$, $ R$ and $ S$ (different from vertices of the pentagon) respectively. Prove that lines $ PS$ and $ AE$ are parallel.

$f:\mathbb{R}^2 \to \mathbb{R}^2$ is injective and surjective. Distance of $X$ and $Y$ is not less than distance of $f(X)$ and $f(Y)$. Prove for $A$ in plane: \[ S(A) \geq S(f(A))\] where $S(A)$ is area of $A$

A triangle $ABC$ and a point $P$ inside this triangle are given. Define $D, E$ and $F$ as the midpoints of $AP, BP$ and $CP$, respectively. Furthermore, let $R$ be the intersection of $AE$ and $BD, S$ the intersection of $BF$ and $CE$, and $T$ the intersection of $CD$ and $AF$. Prove that the area of hexagon $DRESFT$ is independent of the position of $P$ inside the triangle. [asy] unitsize(1 cm); pair A, B, C, D, E, F, P, R, S, T; A = (0,0); B = (5,0); C = (1.5,4); P = (2,2); D = (A + P)/2; E = (B + P)/2; F = (C + P)/2; R = extension(A,E,B,D); S = extension(B,F,C,E); T = extension(C,D,A,F); draw(A--B--C--cycle); draw(A--P); draw(B--P); draw(C--P); draw(A--F--B); draw(B--D--C); draw(C--E--A); dot("$A$", A, SW); dot("$B$", B, SE); dot("$C$", C, N); dot("$D$", D, dir(270)); dot("$E$", E, dir(270)); dot("$F$", F, W); dot("$P$", P, dir(270)); dot("$R$", R, dir(270)); dot("$S$", S, SW); dot("$T$", T, SE); [/asy]

Find the positive integer $k$ such that the roots of $x^3 - 15x^2 + kx -1105$ are three distinct collinear points in the complex plane.

Let $ABCDEF$ be a cyclic hexagon such that \[AB=BC,\quad CD=DE,\quad EF=FA.\] Show that \[[ACE]\le[BDF]\] and determine when the equality holds. ($[XYZ]$ denotes the area of the triangle $XYZ.$)

Find all integral solutions to $x^y - y^x = 1$

Prove that for all positive real numbers $a_1,a_2,\cdots a_n$ \[\frac{1}{\frac{1}{1+a_1}+\frac{1}{1+a_2}+\cdots +\frac{1}{1+a_n}}-\frac{1}{\frac{1}{a_1}+\frac{1}{a_2}+\cdots +\frac{1}{a_n}}\geq \frac{1}{n}\] When does the inequality hold?

A permutation of $\{1, 2 \cdots, n \}$ is [i]magic[/i] if each element $k$ of it has at least $\left\lfloor \frac{k}{2} \right\rfloor$ numbers less to it at the left. For each $n$ find the number of [i]magical[/i] permutations.

Alice and Bianca have one hundred marbles. At the start of the game they split these hundred marbles into two piles. Thereafter, a move consists of choosing a pile, then choosing a positive integer not larger than half of the number of marbles in that pile, and finally removing that number of marbles from the chosen pile. The first player unable to remove any marbles loses. Alice makes the first move of the game. Determine all initial pile sizes for which Bianca has a winning strategy.

Determine $ Q \in \mathbb{R}$ which is so big that a sequence with non-negative reals elements $ a_1 ,a_2, \ldots$ which satisfies the following two conditions: [b](i)[/b] $ \forall m,n \geq 1$ we have $ a_{m \plus{} n} \leq 2 \left(a_m \plus{} a_n \right)$ [b](ii)[/b] $ \forall k \geq 0$ we have $ a_{2^k} \leq \frac {1}{(k \plus{} 1)^{2008}}$ such that for each sequence element we have the inequality $ a_n \leq Q.$

Determine all integers $m$ for which all solutions of the equation $3x^3-3x^2+m = 0$ are rational.

Prove that for all positive integers $n$ and all positive reals $a,b,c$ the following inequality holds: \[\frac{a^{n+1}}{a^{n}+a^{n-1}b+\ldots+b^{n}}+\frac{b^{n+1}}{b^{n}+b^{n-1}c+\ldots+c^{n}}+\frac{c^{n+1}}{c^{n}+c^{n-1}a+\ldots+a^{n}}\\ \ge \frac{a+b+c}{n+1}\]

[b]6.1 [/b] Two people went from point A to point B. The first one walked along highway at a speed of 5 km/h, and the second along a path at a speed of 4 km/h. The first of them arrived at point B an hour later and traveled 6 kilometers more. Find the distance from A to B along the highway. [b]6.2.[/b] A pedestrian walks along the highway at a speed of 5 km/hour. Along this highway in both directions at the same speed Buses run, meeting every 5 minutes. At 12 o'clock the pedestrian noticed that the buses met near him and, Continuing to walk, he began to count those oncoming and overtaking buses. At 2 p.m., buses met near him again. It turned out that during this time the pedestrian encountered 4 buses more than overtook him. Find the speed of the bus [b]6.3. [/b] Prove that the difference $43^{43} - 17^{17}$ is divisible by $10$. [b]6.4. [/b] Two squares are cut out of the chessboard on the border of the board. When is it possible and when is it not possible to cover with the remaining squares of the board? shapes of the view without overlay? [b]6.5.[/b] The distance from city A to city B (by air) is 30 kilometers, from B to C - 80 kilometers, from C to D - 236 kilometers, from D to E - 86 kilometers, from E to A- 40 kilometers. Find the distance from E to C. [b]6.6.[/b] Is it possible to write down the numbers from $ 1$ to $1963$ in a series so that any two adjacent numbers and any two numbers located one after the other were mutually prime? PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983460_1963_leningrad_math_olympiad]here[/url].

Let $ABCD$ be a convex quadrilateral with $\angle B < \angle A < 90^{o}$. Let $I$ be the midpoint of $AB$ and $S$ the intersection of $AD$ and $BC$. Let $R$ be a variable point inside the triangle $SAB$ such that $\angle ASR = \angle BSR$. On the straight lines $AR, BR$ , take the points $E, F$, respectively so that $BE , AF$ are parallel to $RS$. Suppose that $EF$ intersects the circumcircle of triangle $SAB$ at points $H, K$. On the segment $AB$, take points $M , N$ such that $\angle AHM =\angle BHI$ , $\angle BKN = \angle AKI$. a) Prove that the center $J$ of the circumcircle of triangle $SMN$ lies on a fixed line. b) On $BE, AF$ , take the points $P, Q$ respectively so that $CP$ is parallel to $SE$ and $DQ$ is parallel to $SF$. The lines $SE, SF$ intersect the circle $(SAB)$, respectively, at $U, V$. Let $G$ be the intersection of $AU$ and $BV$. Prove that the median of vertex $G$ of the triangle $GPQ$ always passes through a fixed point .