Colin has $900$ Choco Pies. He realizes that for some integer values of $n \le 900$, if he eats n pies a day, he will be able to eat the same number of pies every day until he runs out. How many possible values of $n$ are there?

We have $1998$ polygon such that sum of the areas is $1997,5$ $cm^2$. These polygons placing inside a square with side lenght $1$ $cm$. (Polygons no overflow). Prove that we can find a point such that, all polygons have this point.

Let $a_0, a_1, \ldots, a_9$ and $b_1 , b_2, \ldots,b_9$ be positive integers such that $a_9<b_9$ and $a_k \neq b_k, 1 \leq k \leq 8.$ In a cash dispenser/automated teller machine/ATM there are $n\geq a_9$ levs (Bulgarian national currency) and for each $1 \leq i \leq 9$ we can take $a_i$ levs from the ATM (if in the bank there are at least $a_i$ levs). Immediately after that action the bank puts $b_i$ levs in the ATM or we take $a_0$ levs. If we take $a_0$ levs from the ATM the bank doesn’t put any money in the ATM. Find all possible positive integer values of $n$ such that after finite number of takings money from the ATM there will be no money in it.

Let $x_1, ..., x_n$ $(n \geq 2)$ be real numbers from the interval $[1,2]$. Prove that $$|x_1-x_2|+...+|x_n-x_1| + \frac{1}{3} (|x_1-x_3|+...+|x_n-x_2|) \leq \frac{2}{3} (x_1+...+x_n)$$ and determine all cases of equality.

$(BEL 6)$ Evaluate $\left(\cos\frac{\pi}{4} + i \sin\frac{\pi}{4}\right)^{10}$ in two different ways and prove that $\dbinom{10}{1}-\dbinom{10}{3}+\frac{1}{2}\dbinom{10}{5}=2^4$

Given positive integer $M.$ For any $n\in\mathbb N_+,$ let $h(n)$ be the number of elements in $[n]$ that are coprime to $M.$ Define $\beta :=\frac {h(M)}M.$ Proof: there are at least $\frac M3$ elements $n$ in $[M],$ satisfy $$\left| h(n)-\beta n\right|\le\sqrt{\beta\cdot 2^{\omega(M)-3}}+1.$$ Here $[n]:=\{1,2,\ldots ,n\}$ for all positive integer $n.$ [i]Proposed by Bin Wang[/i]

Let $a,b,c$ are non-negative numbers such that $$2(a^2+b^2+c^2)+3(ab+bc+ca)=5(a+b+c)$$ then prove that $4(a^2+b^2+c^2)+2(ab+bc+ca)+7abc\le 25$

Given an acute triangle $ABC$ with circumcenter $O$ and orthocenter $H$. Let $K$ be a point inside $ABC$ which is not $O$ nor $H$. Point $L$ and $M$ are located outside the triangle $ABC$ such that $AKCL$ and $AKBM$ are parallelogram. At last, let $BL$ and $CM$ intersects at $N$, and let $J$ be the midpoint of $HK$. Show that $KONJ$ is also a parallelogram. [i]Raja Oktovin, Pekanbaru[/i]

Recall that in any row of Pascal's Triangle, the first and last elements of the row are $1$ and each other element in the row is the sum of the two elements above it from the previous row. With this in mind, define the $\textit{Pascal Squared Triangle}$ as follows: [list] [*] In the $n^{\text{th}}$ row, where $n\geq 1$, the first and last elements of the row equal $n^2$; [*] Each other element is the sum of the two elements directly above it. [/list] The first few rows of the Pascal Squared Triangle are shown below. \[\begin{array}{c@{\hspace{7em}} c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{4pt}}c@{\hspace{2pt}} c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{3pt}}c@{\hspace{2pt}} c@{\hspace{2pt}}c} \vspace{4pt} \text{Row 1: } & & & & & & 1 & & & & & \\\vspace{4pt} \text{Row 2: } & & & & & 4 & & 4 & & & & \\\vspace{4pt} \text{Row 3: } & & & & 9 & & 8 & & 9 & & & \\\vspace{4pt} \text{Row 4: } & & &16& &17& &17& & 16& & \\\vspace{4pt} \text{Row 5: } & &25 & &33& &34 & &33 & &25 & \end{array}\] Let $S_n$ denote the sum of the entries in the $n^{\text{th}}$ row. For how many integers $1\leq n\leq 10^6$ is $S_n$ divisible by $13$?

Suppose $P$ is a point inside a convex $2n$-gon, such that $P$ does not lie on any diagonal. Show that $P$ lies inside an even number of triangles whose vertices are vertices of the polygon.

Your answer to this problem will be an integer between $0$ and $100$, inclusive. From all the teams who submitted an answer to this problem, let the average answer be $A$. Estimate the value of $\left\lfloor \frac23 A \right\rfloor$. If your estimate is $E$ and the answer is $A$, your score for this problem will be \[\max\left(0,\lfloor15-2\cdot\left|A-E\right|\right \rfloor).\] [i]Proposed by Andrew Zhao[/i]

Suppose that every integer has been given one of the colors red, blue, green, yellow. Let $x$ and $y$ be odd integers such that $|x| \ne |y|$. Show that there are two integers of the same color whose difference has one of the following values: $x,y,x+y,x-y$.

Find the number of triples $(x,a,b)$ where $x$ is a real number and $a,b$ belong to the set $\{1,2,3,4,5,6,7,8,9\}$ such that $$x^2-a\{x\}+b=0.$$ where $\{x\}$ denotes the fractional part of the real number $x$.

Triangle $ABC$ with $AB=50$ and $AC=10$ has area $120$. Let $D$ be the midpoint of $\overline{AB}$, and let $E$ be the midpoint of $\overline{AC}$. The angle bisector of $\angle BAC$ intersects $\overline{DE}$ and $\overline{BC}$ at $F$ and $G$, respectively. What is the area of quadrilateral $FDBG$? $ \textbf{(A) }60 \qquad \textbf{(B) }65 \qquad \textbf{(C) }70 \qquad \textbf{(D) }75 \qquad \textbf{(E) }80 \qquad $

The point $E$ is taken inside the square $ABCD$, the point $F$ is taken outside, so that the triangles $ABE$ and $BCF$ are congruent . Find the angles of the triangle $ABE$, if it is known that$EF$ is equal to the side of the square, and the angle $BFD$ is right.

A convex polygon is divided into some triangles. Let $V$ and $E$ be respectively the set of vertices and the set of egdes of all triangles (each vertex in $V$ may be some vertex of the polygon or some point inside the polygon). The polygon is said to be [i]good [/i] if the following conditions hold: i. There are no $3$ vertices in $V$ which are collinear. ii. Each vertex in $V$ belongs to an even number of edges in $E$. Find all good polygon.

On a lottery ticket a player has to mark $6$ numbers from $36$. Then $6$ numbers from these $36$ are drawn randomly and the ticket wins if none of the numbers that came out is marked on the ticket. Prove that a) it is possible to mark the numbers on $9$ tickets so that one of these tickets always wins, b) it is not possible to mark the numbers on $8$ tickets so that one of tickets always wins.

For every integer $ a>1$ an infinite list of integers is constructed $ L(a)$, as follows: [list] $ a$ is the first number in the list $ L(a)$.[/list] [list] Given a number $ b$ in $ L(a)$, the next number in the list is $ b\plus{}c$, where $ c$ is the largest integer that divides $ b$ and is smaller than $ b$.[/list] Find all the integers $ a>1$ such that $ 2002$ is in the list $ L(a)$.

On a large, flat field $n$ people are positioned so that for each person the distances to all the other people are different. Each person holds a water pistol and at a given signal fires and hits the person who is closest. When $n$ is odd show that there is at least one person left dry. Is this always true when $n$ is even?

Let $f(x)$ be a function acting on a string of $0$s and $1$s, defined to be the number of substrings of $x$ that have at least one $1$, where a substring is a contiguous sequence of characters in $x$. Let $S$ be the set of binary strings with $24$ ones and $100$ total digits. Compute the maximum possible value of $f(s)$ over all $s\in S$. For example, $f(110) = 5$ as $\underline{1}10$, $1\underline{1}0$, $\underline{11}0$, $1\underline{10}$, and $\underline{110}$ are all substrings including a $1$. Note that $11\underline{0}$ is not such a substring.

Let ${\left\{ {f(x)} \right\}}$ be a sequence of polynomial, where ${f_0}(x) = 2$, ${f_1}(x) = 3x$, and ${f_n}(x) = 3x{f_{n - 1}}(x) + (1 - x - 2{x^2}){f_{n - 2}}(x)$ $(n \ge 2)$ Determine the value of $n$ such that ${f_n}(x)$ is divisible by $x^3-x^2+x$.

A line through the centroid G of the triangle ABC intersects the side AB at P and the side AC at Q Show that $\frac{PB}{PA} \cdot \frac{QC}{QA} \leq \frac{1}{4}$. Sorry for Triple-Posting. If possible, please merge the solutions to one document. I think there was an error because it may have automatically triple-posted.

Find the largest possible value in the real numbers of the term $$\frac{3x^2 + 16xy + 15y^2}{x^2 + y^2}$$ with $x^2 + y^2 \ne 0$.

Let $P(x) =(x+1)^p (x-3)^q=x^n+a_1x^{n-1}+a_2x^{n-2}+...+a_{n-1}x+a_n$ where $p$ and $q$ are positive integers a) Given $a_1=a_2$, prove that $3n$ is a perfect square. b) Prove that there exist infinitely many pairs $(p, q)$ of positive integers p and q such that the equality $a_1=a_2$ is valid for the polynomial $P(x)$. (D. Bazylev)

Three equal circles $k_1, k_2, k_3$ intersect non-tangentially at a point $P$. Let $A$ and $B$ be the centers of circles $k_1$ and $k_2$. Let $D$ and $C$ be the intersection of $k_3$ with $k_1$ and $k_2$ respectively, which is different from $P$. Show that $ABCD$ is a parallelogram.