Find all triples $(a,b,c)$ of natural numbers, such that $LCM(a,b,c)=a+b+c$

Let $ABCD$ be the circumscribed quadrilateral with the incircle $(I)$. The circle $(I)$ touches $AB, BC, C D, DA$ at $M, N, P,Q$ respectively. Let $K$ and $L$ be the circumcenters of the triangles $AMN$ and $APQ$ respectively. The line $KL$ cuts the line $BD$ at $R$. The line $AI$ cuts the line $MQ$ at $J$. Prove that $RA = RJ$.

Find $\lim_{t\rightarrow 0}\frac{1}{t^3}\int_0^{t^2} e^{-x}\sin \frac{x}{t}\ dx\ (t\neq 0).$ [i]2010 Kumamoto University entrance exam/Medicine[/i]

A convex $N\text{-gon}$ is divided by diagonals into triangles so that no two diagonals intersect inside the polygon. The triangles are painted in black and white so that any two triangles are painted in black and white so that any two triangles with a common side are painted in different colors. For each $N$ find the maximal difference between the numbers of black and white triangles.

The side $AD$ of a parallelogram $ABCD$ is divided into $n$ equal segments. The nearest to $A$ division point $P$ is connected with $B$. Prove that line $BP$ intersects the diagonal $AC$ at point $Q$ such that $AQ = \frac{AC}{n + 1}$

There is a row of $n$ chairs, numbered in order from left to right from $1$ to $n$. Additionally, the $n$ numbers from $1$ to $n$ are distributed on the backs of the chairs, one number per chair, such that the number on the back of a chair never matches the number of the chair itself. There is a child sitting on each chair. Every time the teacher claps, each child checks the number on the back of the chair they are sitting on and moves to the chair corresponding to that number. Prove that for any $m$ that is not a power of a prime, with $1 < m \leqslant n$, it is possible to distribute the numbers on the backrests such that, after the teacher claps $m$ times, for the first time, all the children are sitting in the chairs where they initially started. (During the process, it may happen that some children return to their original chairs, but they do not all do so simultaneously until the $m^{\text{th}}$ clap.)

Given the three numbers $x, y=x^x, z=x^{(x^x)}$ with $.9<x<1.0$. Arranged in order of increasing magnitude, they are: $\textbf{(A)}\ x, z, y \qquad\textbf{(B)}\ x, y, z \qquad\textbf{(C)}\ y, x, z \qquad\textbf{(D)}\ y, z, x \qquad\textbf{(E)}\ z, x, y$

A set $ X$ of positive integers is called [i]nice[/i] if for each pair $ a$, $ b\in X$ exactly one of the numbers $ a \plus{} b$ and $ |a \minus{} b|$ belongs to $ X$ (the numbers $ a$ and $ b$ may be equal). Determine the number of nice sets containing the number 2008. [i]Author: Fedor Petrov[/i]

A sequence $a_0,a_1,a_2,\cdots$ satisfies the conditions $a_0 = 0$ , $a_{n-1}^2 - a_{n-1} = a_n^2 + a_n$ 1) determine the two possible values of $a_1$ . then determine all possible values of $a_2$ . 2)for each $n$, prove that $a_{n+1}=a_n+1$ or $a_{n+1} = -a_n$ 3)Describe the possible values of $a_{1435}$ 4)Prove that the values that you got in (3) are correct

For all $x,y,z\in \mathbb{R}\backslash \{1\}$, such that $xyz=1$, prove that \[ \frac{x^2}{(x-1)^2}+\frac{y^2}{(y-1)^2}+\frac{z^2}{(z-1)^2}\ge 1 \]

Find the smallest constant $C > 0$ for which the following statement holds: among any five positive real numbers $a_1,a_2,a_3,a_4,a_5$ (not necessarily distinct), one can always choose distinct subscripts $i,j,k,l$ such that \[ \left| \frac{a_i}{a_j} - \frac {a_k}{a_l} \right| \le C. \]

Given $100$ coplanar points, no three collinear, prove that at most $70\%$ of the triangles formed by the points have all angles acute.

Let $f(x) = 2^x + 3^x$. For how many integers $1 \leq n \leq 2020$ is $f(n)$ relatively prime to all of $f(0), f(1), \dots, f(n-1)$?

We have a number $n$ for which we can find 5 consecutive numbers, none of which is divisible by $n$, but their product is. Show that we can find 4 consecutive numbers, none of which is divisible by $n$, but their product is.

In a contest, there are $m$ candidates and $n$ judges, where $n\geq 3$ is an odd integer. Each candidate is evaluated by each judge as either pass or fail. Suppose that each pair of judges agrees on at most $k$ candidates. Prove that \[{\frac{k}{m}} \geq {\frac{n-1}{2n}}. \]

The shaded region formed by the two intersecting perpendicular rectangles, in square units, is [asy] fill((0,0)--(6,0)--(6,-3.5)--(9,-3.5)--(9,0)--(10,0)--(10,2)--(9,2)--(9,4.5)--(6,4.5)--(6,2)--(0,2)--cycle,black); label("2",(0,.9),W); label("3",(7.3,4.5),N); draw((0,-3.3)--(0,-5.3),linewidth(1)); draw((0,-4.3)--(3.7,-4.3),linewidth(1)); label("10",(4.7,-3.7),S); draw((5.7,-4.3)--(10,-4.3),linewidth(1)); draw((10,-3.3)--(10,-5.3),linewidth(1)); draw((11,4.5)--(13,4.5),linewidth(1)); draw((12,4.5)--(12,2),linewidth(1)); label("8",(11.3,1),E); draw((12,0)--(12,-3.5),linewidth(1)); draw((11,-3.5)--(13,-3.5),linewidth(1));[/asy] $ \text{(A)}\ 23\qquad\text{(B)}\ 38\qquad\text{(C)}\ 44\qquad\text{(D)}\ 46\qquad\text{(E)}\ \text{unable to be determined from the information given} $

A particle falls in a vertical plane from rest under the influence of gravity and a force perpendicular to and proportional to its velocity. Obtain the equations of the trajectory and identify the curve.

Find all integers $n > 1$ for which there is a set $B$ of $n$ points in the plane such that for any $A \in B$ there are three points $X,Y,Z \in B$ with $AX = AY = AZ = 1$.

Alice, Bob, and Carol each independently roll a fair six-sided die and obtain the numbers $a, b, c$, respectively. They then compute the polynomial $f(x)=x^{3}+p x^{2}+q x+r$ with roots $a, b, c$. If the expected value of the sum of the squares of the coefficients of $f(x)$ is $\frac{m}{n}$ for relatively prime positive integers $m, n$, find the remainder when $m+n$ is divided by 1000 .

In a school tennis tournament with $ m \ge 2$ participants, each match consists of 4 sets. A player who wins more than half of all sets during a match gets 2 points for this match. A player who wins exactly half of all sets during the match gets 1 point, and a player who wins less than half of all sets gets 0 points. During the tournament, each participant plays exactly one match against each remaining player. Find the least number of participants m for which it is possible that some participant wins more sets than any other participant but obtains less points than any other participant.

$ABCDE$ is a cyclic pentagon, with circumcentre $O$. $AB=AE=CD$. $I$ midpoint of $BC$. $J$ midpoint of $DE$. $F$ is the orthocentre of $\triangle ABE$, and $G$ the centroid of $\triangle AIJ$.$CE$ intersects $BD$ at $H$, $OG$ intersects $FH$ at $M$. Show that $AM\perp CD$.

Find all functions $f:\mathbb{R}^+\rightarrow\mathbb{R}^+$ such that for all $x, y\in\mathbb{R}^+$, \[ \frac{f(x)}{y^2} - \frac{f(y)}{x^2} \le \left(\frac{1}{x}-\frac{1}{y}\right)^2\] ($\mathbb{R}^+$ denotes the set of positive real numbers.) [i](Proposed by Ivan Chan Guan Yu)[/i]

How many parts can space be divided into by : a) three half-plane? b) four half-planes?

Let $n\ge 1$ be a positive integer and $x_1,x_2\ldots ,x_n$ be real numbers such that $|x_{k+1}-x_k|\le 1$ for $k=1,2,\ldots ,n-1$. Prove that \[\sum_{k=1}^n|x_k|-\left|\sum_{k=1}^nx_k\right|\le\frac{n^2-1}{4}\] [i]Gh. Eckstein[/i]

Let $D$ be a regular dodecahedron, which is a polyhedron with $20$ vertices, $30$ edges, and $12$ regular pentagon faces. A tetrahedron is a polyhedron with $4$ vertices, $6$ edges, and $4$ triangular faces. Find the number of tetrahedra with positive volume whose vertices are vertices of $D$. [img]https://cdn.artofproblemsolving.com/attachments/c/d/44d11fa3326780941d0b6756fb2e5989c2dc5a.png[/img]