Is there a solution of the Cauchy problem \[x(x^2+y^2)\frac{\partial u}{\partial x}+y^3\frac{\partial u}{\partial y}=0,\;u|_{y=0}=1\] in a neighbourhood of the point $(x_0,0)$ of the $x$-axis? Is it unique?

Let $ABC$ be a triangle and $ABDE, BCFZ, CAKL$ be three similar rectangles constructed externally of the triangle. Let $A'$ be the intersection of $EF$ and $ZK, B'$ the intersection of $KZ$ and $DL$, and $C'$ the intersection of $DL$ and $EF$. Prove that $AA'$ passes through the midpoint of the line segment $B'C'$. Kostas Vittas

Let $a,b,c$ be sides of a triangle. Prove that \[ 2 < \frac{a+b}{c} + \frac{b+c}{a} + \frac{c+a}{b} - \frac{a^3+b^3+c^3}{abc}\leq 3 \]

Solve in integers $x$ and $y$ the equation $x^3-y^3=2xy+8$.

The sequence $ u_n$, $ n\equal{}0,1,2,...$ is defined by $ u_0\equal{}0, u_1\equal{}1$ and for each $ n \ge 1$, $ u_{n\plus{}1}$ is the smallest positive integer greater than $ u_n$ such that $ \{ u_0,u_1,...,u_{n\plus{}1} \}$ contains no three elements in arithmetic progression. Find $ u_{100}$.

Find all functions $f$ defined on the set of positive reals which take positive real values and satisfy: $f(xf(y))=yf(x)$ for all $x,y$; and $f(x)\to0$ as $x\to\infty$.

A collection of $n$ squares on the plane is called tri-connected if the following criteria are satisfied: (i) All the squares are congruent. (ii) If two squares have a point $P$ in common, then $P$ is a vertex of each of the squares. (iii) Each square touches exactly three other squares. How many positive integers $n$ are there with $2018\leq n \leq 3018$, such that there exists a collection of $n$ squares that is tri-connected?

Find all positive integers $ n$ such that there exists a unique integer $ a$ such that $ 0\leq a < n!$ with the following property: \[ n!\mid a^n \plus{} 1 \] [i]Proposed by Carlos Caicedo, Colombia[/i]

Let $ABC$ be an acute angled triangle with orthocenter $H$ and $AB<AC$. The point $T$ lies on line $BC$ so that $AT$ is a tangent to the circumcircle of $ABC$. Let lines $AH$ and $BC$ meet at point $D$ and let $M$ be the midpoint of $HC$. Let the circumcircle of $AHT$ meets $CH$ in $P \not=H$ and the circumcircle of $PDM$ meet $BC$ in $Q \not=D$. Prove that $QT=QA$.

Mr. Vader gave out a multiple choice test, and every question had an answer that was one of A, B, or C. After the test, he curved the test so that everybody got +50 (so a person who got $x\%$ right would get a score of $x+50$). In the class, a score in the range $\left[90,\infty\right)$ gets an A, a score in the range $\left[80,90\right)$ gets a B, and a score in the range $\left[70,80\right)$ gets a C. After the curve, Mr. Vader makes this statement: ``Guess A, get an A. Guess B, get a B. Guess C, get a C.'' That is, answering every question with the answer choice X would give, with the curve, a score receiving a grade of X, where X is one of A, B, C. Luke, a student in Mr. Vader's class, was told ahead of time that there were either $5$ or $6$ answers as A on the test. Find the sum of all possible values of the number of questions on the test, given this information. [i]2017 CCA Math Bonanza Tiebreaker Round #4[/i]

The first number in the following sequence is $1$. It is followed by two $1$'s and two $2$'s. This is followed by three $1$'s, three $2$'s, and three $3$'s. The sequence continues in this fashion. \[1,1,1,2,2,1,1,1,2,2,2,3,3,3,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,\dots.\] Find the $2014$th number in this sequence.

Suppose there are $m$ Martians and $n$ Earthlings at an intergalactic peace conference. To ensure the Martians stay peaceful at the conference, we must make sure that no two Martians sit together, such that between any two Martians there is always at least one Earthling. (a) Suppose all $m + n$ Martians and Earthlings are seated in a line. How many ways can the Earthlings and Martians be seated in a line? (b) Suppose now that the $m+n$ Martians and Earthlings are seated around a circular round-table. How many ways can the Earthlings and Martians be seated around the round-table?

Let $S = \{(x,y) | x = 1, 2, \ldots, 1993, y = 1, 2, 3, 4\}$. If $T \subset S$ and there aren't any squares in $T.$ Find the maximum possible value of $|T|.$ The squares in T use points in S as vertices.

$32$ stones, with pairwise different weights, and lever scales without weights are given. How to determine by $35$ scaling, which stone is the heaviest and which is the second by weight?

Let $x,y$ and $z$ be positive real numbers. Show that $x^2+xy^2+xyz^2\ge 4xyz-4$.

Let $a, b, c$ be the sides and $R$ be the circumradius of a triangle. Prove that \[\frac{1}{ab}+\frac{1}{bc}+\frac{1}{ca}\ge\frac{1}{R^2}.\]

In acute $\triangle ABC,$ let $D$ be the foot of perpendicular from $A$ on $BC$. Consider points $K, L, M$ on segment $AD$ such that $AK= KL= LM= MD$. Suppose the sum of the areas of the shaded region equals the sum of the areas of the unshaded regions in the following picture. Prove that $BD= DC$. [img]http://s27.postimg.org/a0d0plr4z/Untitled.png[/img]

If $0 < a < b$ then: $$\frac{\int \limits^{\frac{a+b}{2}}_{a}\left(\tan^{-1}t\right)dt}{\int \limits_{a}^{b}\left(\tan^{-1}t\right)dt}<\frac{1}{2}$$

Define a complexity of a set $a_1,a_2,\dots,$ consisting of 0 and 1 to be the smallest positive integer $k$ such that for some positive integers $\epsilon_1,\epsilon_2,\dots, \epsilon_k$ each number of the sequence $a_n$, $n>k$, has the same parity as $\epsilon_1 a_{n-1}+\epsilon_2 a_{n-2}+\dots+\epsilon_k a_{n-k}$. Sequence $a_1,a_2,\dots,$ has a complexity of $1000$. What is the complexity of sequence $1-a_1,1-a_2,\dots,$. [I]Proposed by A. Kirichenko[/i]

Let $n$ be a positive integer. $n$ people take part in a certain party. For any pair of the participants, either the two are acquainted with each other or they are not. What is the maximum possible number of the pairs for which the two are not acquainted but have a common acquaintance among the participants?

The numbers from $1$ to $2017$ are written on a board. Deka and Farid play the following game : each of them, on his turn, erases one of the numbers. Anyone who erases a multiple of $2, 3$ or $5$ loses and the game is over. Is there a winning strategy for Deka ?

There are $2000$ components in a circuit, every two of which were initially joined by a wire. The hooligans Vasya and Petya cut the wires one after another. Vasya, who starts, cuts one wire on his turn, while Petya cuts two or three. The hooligan who cuts the last wire from some component loses. Who has the winning strategy?

2. Each of $n$ members of a club is given a different item of information. The members are allowed to share the information, but, for security reasons, only in the following way: A pair may communicate by telephone. During a telephone call only one member may speak. The member who speaks may tell the other member all the information (s)he knows. Determine the minimal number of phone calls that are required to convey all the information to each of the members. Hi, from my sketches I'm thinking the answer is $2n-2$ but I dont know how to prove that this number of calls is the smallest. Can anyone enlighten me? Thanks

A boy and a girl were sitting on a long bench. Then twenty more children one after another came to sit on the bench, each taking a place between already sitting children. Let us call a girl brave if she sat down between two boys, and let us call a boy brave if he sat down between two girls. It happened, that in the end all girls and boys were sitting in the alternating order. Is it possible to uniquely determine the number of brave children?

Consider an isosceles triangle $ABC$, where $AB = AC$. $D$ is a point on the $AC$ side and $P$ a point on the segment $BD$ so that the angle $\angle APC = 90^o$ and $ \angle ABP = \angle BCP $. Determine the ratio $AD: DC$.