Danica drove her new car on a trip for a whole number of hours, averaging $55$ miles per hour. At the beginning of the trip, $abc$ miles were displayed on the odometer, where $abc$ is a 3-digit number with $a \ge 1$ and $a+b+c \le 7$. At the end of the trip, where the odometer showed $cba$ miles. What is $a^2+b^2+c^2$? $ \textbf{(A) } 26 \qquad\textbf{(B) }27\qquad\textbf{(C) }36\qquad\textbf{(D) }37\qquad\textbf{(E) }41\qquad $

Let $ABC$ be a triangle and let $D$ be a point on the segment $BC$ such that $AD=BC$. \\ Suppose $\angle{CAD}=x^{\circ}, \angle{ABC}=y^{\circ}$ and $\angle{ACB}=z^{\circ}$ and $x,y,z$ are in an arithmetic progression in that order where the first term and the common difference are positive integers. Find the largest possible value of $\angle{ABC}$ in degrees.

Determine all possible values of $x+\frac{1}{x}$ , where the real number $x$ satisfies the equation $$x^4+5x^3-4x^2+5x+1=0$$ and solve this equation.

Is it possible to partition a triangle, with line segments, into exactly five isosceles triangles? All the triangles in concern are assumed to be nondegenerated triangles.

In the Cartesian plane, a line segment is called [i]tame[/i] if it lies parallel to one of the coordinate axes and its distance to this axis is an integer. Otherwise it is called [i]wild[/i]. Let $m$ and $n$ be odd positive integers. The rectangle with vertices $(0,0),(m,0),(m,n)$ and $(0,n)$ is partitioned into finitely many triangles. Let $M$ be the set of these triangles. Assume that (1) Each triangle from $M$ has at least one tame side. (2) For each tame side of a triangle from $M$, the corresponding altitude has length $1$. (3) Each wild side of a triangle from $M$ is a common side of exactly two triangles from $M$. Show that at least two triangles from $M$ have two tame sides each.

Let $k$ be a positive integer. The organising commitee of a tennis tournament is to schedule the matches for $2k$ players so that every two players play once, each day exactly one match is played, and each player arrives to the tournament site the day of his first match, and departs the day of his last match. For every day a player is present on the tournament, the committee has to pay $1$ coin to the hotel. The organisers want to design the schedule so as to minimise the total cost of all players' stays. Determine this minimum cost.

There are two $3$-digit numbers which end in $99$. These two numbers are also the product of two integers which differ by $2$. What is the sum of these two numbers?

Points $E$ and $C$ are chosen on a semicircle with diameter $AB$ and center $O$ such that $OE \perp AB$ and the intersection point $D$ of $AC$ and $OE$ is inside the semicircle. Find all values of $\angle{CAB}$ for which the quadrilateral $OBCD$ is tangent.

Given trapezoid $ ABCD$ with parallel sides $ AB$ and $ CD$, assume that there exist points $ E$ on line $ BC$ outside segment $ BC$, and $ F$ inside segment $ AD$ such that $ \angle DAE \equal{} \angle CBF$. Denote by $ I$ the point of intersection of $ CD$ and $ EF$, and by $ J$ the point of intersection of $ AB$ and $ EF$. Let $ K$ be the midpoint of segment $ EF$, assume it does not lie on line $ AB$. Prove that $ I$ belongs to the circumcircle of $ ABK$ if and only if $ K$ belongs to the circumcircle of $ CDJ$. [i]Proposed by Charles Leytem, Luxembourg[/i]

How many noncongruent integer-sided triangles with positive area and perimeter less than $15$ are neither equilateral, isosceles, nor right triangles? $\textbf{(A) }3\qquad\textbf{(B) }4\qquad\textbf{(C) }5\qquad\textbf{(D) }6\qquad\textbf{(E) }7$

Points $A$ and $B$ are chosen on a circle $k$. Let AP and $BQ$ be segments of the same length tangent to $k$, drawn on different sides of line $AB$. Prove that the line $AB$ bisects the segment $PQ$.

Let $S_n$ be the number of subsets of the first $n$ positive integers that have the same number of even values and odd values; the empty set counts as one of these subsets. Compute the smallest positive integer $n$ such that $S_n$ is a multiple of $2020$.

Do there exist functions $f : R \to R$ and $g : R \to R$, $g$ being periodic, such that $$x^3= f(\lfloor x \rfloor ) + g(x)$$ for all real $x$ ?

Given a real number $t\neq -1$. Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that \[(t+1)f(1+xy)-f(x+y)=f(x+1)f(y+1)\] for all $x,y\in\mathbb{R}$.

Let be a sequence of functions $ \left( f_n \right)_{n\ge 2}:\mathbb{R}_{\ge 0}\longrightarrow\mathbb{R} $ defined, for each $ n\ge 2, $ as $$ f_n(x)=2nx^{2+n} -2(n+2)x^{1+n} +(2+n)x +1. $$ [b]a)[/b] Prove that $ f_n $ has an unique local maxima $ x_n, $ for any $ n\ge 2. $ [b]b)[/b] Show that $ 1=\lim_{n\to\infty } x_n. $ [i]Cătălin Zîrnă[/i]

Find all composite positive integers \(m\) such that, whenever the product of two positive integers \(a\) and \(b\) is \(m\), their sum is a power of $2$. [i]Proposed by Harun Khan[/i]

The graphs of $y=3(x-h)^2+j$ and $y=2(x-h)^2+k$ have $y$-intercepts of $2013$ and $2014$, respectively, and each graph has two positive integer $x$-intercepts. Find $h$.

[b](a)[/b] Find the rearrangement $\{a_1, \dots , a_n\}$ of $\{1, 2, \dots, n\}$ that maximizes \[a_1a_2 + a_2a_3 + \cdots + a_na_1 = Q.\] [b](b)[/b] Find the rearrangement that minimizes $Q.$

Show that there exists a set of infinite positive integers such that the sum of an arbitrary finite subset of these is never a perfect square. What happens if we change the condition from not being a perfect square to not being a perfect power?

The sequence of positive integers $a_0, a_1, a_2, . . .$ is defined by $a_0 = 3$ and $$a_{n+1} - a_n = n(a_n - 1)$$ for all $n \ge 0$. Determine all integers $m \ge 2$ for which $gcd (m, a_n) = 1$ for all $n \ge 0$.

Putnam 1984/A5) Let $R$ be the region consisting of all triples $(x,y,z)$ of nonnegative real numbers satisfying $x+y+z\leq 1$. Let $w=1-x-y-z$. Express the value of the triple integral \[\iiint_{R}xy^{9}z^{8}w^{4}\ dx\ dy\ dz\] in the form $a!b!c!d!/n!$ where $a,b,c,d$ and $n$ are positive integers. [hide="A solution"]\[\iiint_{R}xy^{9}z^{8}w^{4}\ dx dy dz = 4\iiint_{R}\int_{0}^{1-x-y-z}xy^{9}z^{8}w^{3}\ dw dx dy dz = 4\iiiint_{Q}xy^{9}z^{8}w^{3}\ dw dx dy dz\] where $Q=\left\{ (x,y,z,w)\in\mathbb{R}^{4}|\ x,y,z,w\geq 0, x+y+z+w\leq 1\right\}$, which is a Dirichlet integral giving \[4\iiiint_{Q}x^{1}y^{9}z^{8}w^{3}\ dw dx dy dz = 4\cdot\frac{1!9!8!3!}{(2+10+9+4)!}= \frac{1!9!8!4!}{25!}\][/hide]

We are given a non-isosceles triangle $ABC$ with incenter $I$. Show that the circumcircle $k$ of the triangle $AIB$ does not touch the lines $CA$ and $CB$. Let $P$ be the second point of intersection of $k$ with $CA$ and let $Q$ be the second point of intersection of $k$ with $CB$. Show that the four points $A$, $B$, $P$ and $Q$ (not necessarily in this order) are the vertices of a trapezoid.

Let $ABC$ an isosceles triangle, $P$ a point belonging to its interior. Denote $M$, $N$ the intersection points of the circle $\mathcal{C}(A, AP)$ with the sides $AB$ and $AC$, respectively. Find the position of $P$ if $MN+BP+CP$ is minimum.

Does there exist a rectangle which can be dissected into $15$ congruent polygons which are not rectangles? Can a square be dissected into $15$ congruent polygons which are not rectangles?

Let be two positive real numbers $ a,b, $ and an infinite arithmetic sequence of natural numbers $ \left( x_n \right)_{n\ge 1} . $ Study the convergence of the sequences $$ \left( \frac{1}{x_n}\sum_{i=1}^n\sqrt[x_i]{b} \right)_{n\ge 1}\text{ and } \left( \left(\sum_{i=1}^n \sqrt[x_i]{a}/\sqrt[x_i]{b} \right)^\frac{x_n}{\ln x_n} \right)_{n\ge 1} , $$ and calculate their limits. [i]Dumitru Acu[/i]