Juan wrote a natural number and Maria added a digit $ 1$ to the left and a digit $ 1$ to the right. Maria's number exceeds to the number of Juan in $14789$. Find the number of Juan.

Show that for any positive real numbers $a$ and $b$ the following inequality hold, $$\frac{a(a+1)}{b+1}+\frac{b(b+1)}{a+1}\geq a+b.$$

Consider a curve $C$ on the $x$-$y$ plane expressed by $x=\tan \theta ,\ y=\frac{1}{\cos \theta}\left (0\leq \theta <\frac{\pi}{2}\right)$. For a constant $t>0$, let the line $l$ pass through the point $P(t,\ 0)$ and is perpendicular to the $x$-axis,intersects with the curve $C$ at $Q$. Denote by $S_1$ the area of the figure bounded by the curve $C$, the $x$-axis, the $y$-axis and the line $l$, and denote by $S_2$ the area of $\triangle{OPQ}$. Find $\lim_{t\to\infty} \frac{S_1-S_2}{\ln t}.$

Find all $f : N \longmapsto N$ that there exist $k \in N$ and a prime $p$ that: $\forall n \geq k \ f(n+p)=f(n)$ and also if $m \mid n$ then $f(m+1) \mid f(n)+1$

Let $X \subset \mathbb{R}^2$ be a set satisfying the following properties: (i) if $(x_1,y_1)$ and $(x_2,y_2)$ are any two distinct elements in $X$, then \[\text{ either, }\ \ x_1>x_2 \text{ and } y_1>y_2\\ \text{ or, } \ \ x_1<x_2 \text{ and } y_1<y_2\] (ii) there are two elements $(a_1,b_1)$ and $(a_2,b_2)$ in $X$ such that for any $(x,y) \in X$, \[a_1\le x \le a_2 \text{ and } b_1\le y \le b_2\] (iii) if $(x_1,y_1)$ and $(x_2,y_2)$ are two elements of $X$, then for all $\lambda \in [0,1]$, \[\left(\lambda x_1+(1-\lambda)x_2, \lambda y_1 + (1-\lambda)y_2\right) \in X\] Show that if $(x,y) \in X$, then for some $\lambda \in [0,1]$, \[x=\lambda a_1 +(1-\lambda)a_2, y=\lambda b_1 +(1-\lambda)b_2\]

Determine all pairs $(x,y)$ of positive integers such that $x^{2}y+x+y$ is divisible by $xy^{2}+y+7$.

In a narrow alley of width $w$ a ladder of length $a$ is placed with its foot at point $P$ between the walls. Resting against one wall at $Q$, the distance $k$ above the ground makes a $45^\circ$ angle with the ground. Resting against the other wall at $R$, a distance $h$ above the ground, the ladder makes a $75^\circ$ angle with the ground. The width $w$ is equal to $\textbf {(A) } a \qquad \textbf {(B) } RQ \qquad \textbf {(C) } k \qquad \textbf {(D) } \frac{h+k}{2} \qquad \textbf {(E) } h$

Show that there is a perfect square (a number which is a square of an integer) such that sum of its digits is $2011.$

Harry Potter would like to purchase a new owl which cost him 2 Galleons, a Sickle, and 5 Knuts. There are 23 Knuts in a Sickle and 17 Sickles in a Galleon. He currently has no money, but has many potions, each of which are worth 9 Knuts. How many potions does he have to exhange to buy this new owl? [i]2015 CCA Math Bonanza Individual Round #7[/i]

We inscribe a circle $\omega$ in equilateral triangle $ABC$ with radius $1$. What is the area of the region inside the triangle but outside the circle?

Given $n>4$, prove that every cyclic quadrilateral can be dissected into $n$ cyclic quadrilaterals.

The bisector of angle $A$ of triangle $ABC$ meet its circumcircle $\omega$ at point $W$. The circle $s$ with diameter $AH$ ($H$ is the orthocenter of $ABC$) meets $\omega$ for the second time at point $P$. Restore the triangle $ABC$ if the points $A$, $P$, $W$ are given.

A castaway is building a rectangular raft $ABCD$. He fixes a mast perpendicular to the raft, with ropes passing from the top of the mast (point $S$ in the figure) to the four corners of the raft. The rope $SA$ measures $8$ meters, the rope $SB$ measures $2$ meters and the rope $SC$ measures $14$ meters. Compute the length of the rope $SD$. [asy] size(250); // Coordinates for the parallelogram ABCD pair A = (0, 0); pair B = (8, 0); pair C = (10, 5); pair D = (2, 5); // Position of point S (outside the parallelogram) pair S = (5, 8); pair T = (5, 3); // Draw the parallelogram ABCD filldraw(A--B--C--D--cycle, lightgray, black); // Draw the ropes from point S to each corner of the parallelogram draw(S--A, blue); draw(S--B, blue); draw(S--C, blue); draw(S--D, blue); draw(S--T, black); // Mark the points dot(A); dot(B); dot(C); dot(D); dot(S); dot(T); // Label the points label("A", A, SW); label("B", B, SE); label("C", C, NE); label("D", D, NW); label("S", S, N); [/asy]

Consider increasing integer sequences with elements from $1,\ldots,10^6$. Such a sequence is [i]Adriatic[/i] if its first element equals 1 and if every element is at least twice the preceding element. A sequence is [i]Tyrrhenian[/i] if its final element equals $10^6$ and if every element is strictly greater than the sum of all preceding elements. Decide whether the number of Adriatic sequences is smaller than, equal to, or greater than the number of Tyrrhenian sequences. (Proposed by Gerhard Woeginger, Austria)

Suppose that $f$ is a function with two continuous derivatives 2and $f(0) = 0.$ Prove that the function $g,$ defined by $g(0) = f '(0), g(x) = f(x) / x$ for $x \ne 0, $ has a continuous derivative.

Sequence $a_1, a_2, a_3, \cdots$ satisfies the following condition. [b](Condition)[/b] For all positive integer $n$, $\sum_{k=1}^{n}\frac{1}{2}\left(1 - (-1)^{\left[\frac{n}{k}\right]}\right)a_k=1$ holds. For a positive integer $m = 1001 \cdot 2^{2025}$, compute $a_m$.

Let $\{x\}$ denote the fractional part of $x$. Then $\lim \limits_{n\to \infty} \left\{ \left(1+\sqrt{2}\right)^{2n}\right\}$ equals [list=1] [*] 0 [*] 0.5 [*] 1 [*] Does not exists [/list]

Find all integers $a,b,c,x,y,z$ such that \[a+b+c=xyz, \; x+y+z=abc, \; a \ge b \ge c \ge 1, \; x \ge y \ge z \ge 1.\]

Let $ABC$ be a triangle with $AB=2\sqrt6, BC=5, CA=\sqrt{26}$, midpoint $M$ of $BC$, circumcircle $\Omega$, and orthocenter $H$. Let $BH$ intersect $AC$ at $E$ and $CH$ intersect $AB$ at $F$. Let $R$ be the midpoint of $EF$ and let $N$ be the midpoint of $AH$. Let $AR$ intersect the circumcircle of $AHM$ again at $L$. Let the circumcircle of $ANL$ intersect $\Omega$ and the circumcircle of $BNC$ at $J$ and $O$, respectively. Let circles $AHM$ and $JMO$ intersect again at $U$, and let $AU$ intersect the circumcircle of $AHC$ again at $V \neq A$. The square of the length of $CV$ can be expressed in the form $\dfrac mn$ for relatively prime positive integers $m$ and $n$. Find $100m+n$. [i]Proposed by Michael Ren[/i]

Show that $ \rho (f)$ changes continously over $ f$. It means for every bijection $ f: S^1\rightarrow S^1$ and $ \epsilon > 0$ there is $ \delta > 0$ such that if $ g: S^1\rightarrow S^1$ is a bijection such that $ \parallel{}f \minus{} g\parallel{} < \delta$ then $ |\rho(f) \minus{} \rho(g)| < \epsilon$. Note that $ \rho(f)$ is the rotatation number of $ f$ and $ \parallel{}f \minus{} g\parallel{} \equal{} \sup\{|f(x) \minus{} g(x)| | x\in S^1\}$.

In the reality show [i]Big Sister Brasil[/i], it is said that there is a [i]treta[/i] if two people are friends with each other and enemies with a third one. For audience purposes, the broadcaster wants a lot of [i]tretas[/i]. If friendship and enmity are reciprocal relationships, given $n$ people, what is the maximum number of [i]tretas[/i]?

Let $a$ and $b$ be two natural numbers that have an equal number $n$ of digits in their decimal expansions. The first $m$ digits (from left to right) of the numbers $a$ and $b$ are equal. Prove that if $m >\frac{n}{2},$ then $a^{\frac{1}{n}} -b^{\frac{1}{n}} <\frac{1}{n}$

A stone is placed in a square of a chessboard with $n$ rows and $n$ columns. We can alternately undertake two operations: [b](a)[/b] move the stone to a square that shares a common side with the square in which it stands; [b](b)[/b] move it to a square sharing only one common vertex with the square in which it stands. In addition, we are required that the first step must be [b](b)[/b]. Find all integers $n$ such that the stone can go through a certain path visiting every square exactly once.

Under the new AMC 10, 12 scoring method, $6$ points are given for each correct answer, $2.5$ points are given for each unanswered question, and no points are given for an incorrect answer. Some of the possible scores between $0$ and $150$ can be obtained in only one way, for example, the only way to obtain a score of $146.5$ is to have 24 correct answers and one unanswered question. Some scores can be obtained in exactly two ways; for example, a score of $104.5$ can be obtained with $17$ correct answers, $1$ unanswered question, and $7$ incorrect, and also with $12$ correct answers and $13$ unanswered questions. There are three scores that can be obtained in exactly three ways. What is their sum? $\textbf{(A) }175\qquad\textbf{(B) }179.5\qquad\textbf{(C) }182\qquad\textbf{(D) }188.5\qquad\textbf{(E) }201$

Find the value of $n$ such that $\frac{2019 + n}{2019 - n}= 5$