A positive integer $\ell \ge 2$ is called [i]sweet[/i] if there exists a positive integer $n \ge 10$ such that when the leftmost nonzero decimal digit of $n$ is deleted, the resulting number $m$ satisfies $n = m\ell.$ Let $S$ denote the set of all sweet numbers $\ell.$ If the sum $\sum_{\ell \in S} \tfrac{1}{\ell-1}$ can be written as $\tfrac{A}{B}$ for relatively prime positive integers $A,B,$ find $A+B.$

Evaluate $ \int_0^{\frac{\pi}{4}} \frac{\tan x}{1\plus{}\sin x}\ dx$.

$(NET 4)$ A boy has a set of trains and pieces of railroad track. Each piece is a quarter of circle, and by concatenating these pieces, the boy obtained a closed railway. The railway does not intersect itself. In passing through this railway, the train sometimes goes in the clockwise direction, and sometimes in the opposite direction. Prove that the train passes an even number of times through the pieces in the clockwise direction and an even number of times in the counterclockwise direction. Also, prove that the number of pieces is divisible by $4.$

[b]p1.[/b] What is $6\times 7 + 4 \times 7 + 6\times 3 + 4\times 3$? [b]p2.[/b] How many integers $n$ have exactly $\sqrt{n}$ factors? [b]p3.[/b] A triangle has distinct angles $3x+10$, $2x+20$, and $x+30$. What is the value of $x$? [b]p4.[/b] If $4$ people of the Math Club are randomly chosen to be captains, and Henry is one of the $30$ people eligible to be chosen, what is the probability that he is not chosen to be captain? [b]p5.[/b] $a, b, c, d$ is an arithmetic sequence with difference $x$ such that $a, c, d$ is a geometric sequence. If $b$ is $12$, what is $x$? (Note: the difference of an aritmetic sequence can be positive or negative, but not $0$) [b]p6.[/b] What is the smallest positive integer that contains only $0$s and $5$s that is a multiple of $24$. [b]p7.[/b] If $ABC$ is a triangle with side lengths $13$, $14$, and $15$, what is the area of the triangle made by connecting the points at the midpoints of its sides? [b]p8.[/b] How many ways are there to order the numbers $1,2,3,4,5,6,7,8$ such that $1$ and $8$ are not adjacent? [b]p9.[/b] Find all ordered triples of nonnegative integers $(x, y, z)$ such that $x + y + z = xyz$. [b]p10.[/b] Noah inscribes equilateral triangle $ABC$ with area $\sqrt3$ in a cricle. If $BR$ is a diameter of the circle, then what is the arc length of Noah's $ARC$? [b]p11.[/b] Today, $4/12/14$, is a palindromic date, because the number without slashes $41214$ is a palindrome. What is the last palindromic date before the year $3000$? [b]p12.[/b] Every other vertex of a regular hexagon is connected to form an equilateral triangle. What is the ratio of the area of the triangle to that of the hexagon? [b]p13.[/b] How many ways are there to pick four cards from a deck, none of which are the same suit or number as another, if order is not important? [b]p14.[/b] Find all functions $f$ from $R \to R$ such that $f(x + y) + f(x - y) = x^2 + y^2$. [b]p15.[/b] What are the last four digits of $1(1!) + 2(2!) + 3(3!) + ... + 2013(2013!)$/ [b]p16.[/b] In how many distinct ways can a regular octagon be divided up into $6$ non-overlapping triangles? [b]p17.[/b] Find the sum of the solutions to the equation $\frac{1}{x-3} + \frac{1}{x-5} + \frac{1}{x-7} + \frac{1}{x-9} = 2014$ . [b]p18.[/b] How many integers $n$ have the property that $(n+1)(n+2)(n+3)(n+4)$ is a perfect square of an integer? [b]p19.[/b] A quadrilateral is inscribed in a unit circle, and another one is circumscribed. What is the minimum possible area in between the two quadrilaterals? [b]p20.[/b] In blindfolded solitary tic-tac-toe, a player starts with a blank $3$-by-$3$ tic-tac-toe board. On each turn, he randomly places an "$X$" in one of the open spaces on the board. The game ends when the player gets $3$ $X$s in a row, in a column, or in a diagonal as per normal tic-tac-toe rules. (Note that only $X$s are used, not $O$s). What fraction of games will run the maximum $7$ amount of moves? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ n(\ge2) $ be a positive integer. Find the minimum $ m $, so that there exists $x_{ij}(1\le i ,j\le n)$ satisfying: (1)For every $1\le i ,j\le n, x_{ij}=max\{x_{i1},x_{i2},...,x_{ij}\} $ or $ x_{ij}=max\{x_{1j},x_{2j},...,x_{ij}\}.$ (2)For every $1\le i \le n$, there are at most $m$ indices $k$ with $x_{ik}=max\{x_{i1},x_{i2},...,x_{ik}\}.$ (3)For every $1\le j \le n$, there are at most $m$ indices $k$ with $x_{kj}=max\{x_{1j},x_{2j},...,x_{kj}\}.$

Consider a polynomial $P(x) = ax^2 + bx + c$ with $a > 0$ that has two real roots $x_1, x_2$. Prove that the absolute values of both roots are less than or equal to $1$ if and only if $a + b + c \ge 0, a -b + c \ge 0$, and $a - c \ge 0$.

Determine all pairs $(x, y)$ of positive integers such that \[\sqrt[3]{7x^2-13xy+7y^2}=|x-y|+1.\] [i]Proposed by Titu Andreescu, USA[/i]

A quadrilateral $ABCD$ is such that $\angle A= \angle C=60^o$ and $\angle B=100^o$. Let $O_1$ and $O_2$ be the centers of the incircles of triangles $ABD$ and $CBD$ respectively. Find the angle between the lines $AO_2$ and $CO_1$.

A particle moves on a circle with center $O$, starting from rest at a point $P$ and coming to rest again at a point $Q$, without coming to rest at any intermediate point. Prove that the acceleration vector of the particle does not vanish at any point between $P$ and $ Q$ and that, at some point $R$ between $P$ and $Q$, the acceleration vector points in along the radius $RO.$

Let $ABCD$ be a convex quadrilateral with $\angle BAC = \angle CAD$, $\angle ABC =\angle ACD$, $(AD \cap (BC =\{E\}$, $(AB \cap (DC = \{F\}$. Prove that: a) $AB\cdot DE = BC \cdot CE$ b) $AC^2 < \frac12 (AD \cdot AF + AB \cdot AE).$

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for all $x,y\in \mathbb{R}$, \[xf(y+x)+(y+x)f(y)=f(x^2+y^2)+2f(xy)\] [i]Proposed by Aritra Mondal[/i]

For a set $S \subseteq \mathbb{N}$, define $f(S) = \{\left\lceil \sqrt{s} \right\rceil \mid s \in S\}$. Find the number of sets $T$ such that $\vert f(T) \vert = 2$ and $f(f(T)) = \{2\}$.

Find all positive integers $n \geqslant 2$ for which there exist $n$ real numbers $a_1<\cdots<a_n$ and a real number $r>0$ such that the $\tfrac{1}{2}n(n-1)$ differences $a_j-a_i$ for $1 \leqslant i<j \leqslant n$ are equal, in some order, to the numbers $r^1,r^2,\ldots,r^{\frac{1}{2}n(n-1)}$.

Let $f$ be a function with the following properties: 1) $f(n)$ is defined for every positive integer $n$; 2) $f(n)$ is an integer; 3) $f(2)=2$; 4) $f(mn)=f(m)f(n)$ for all $m$ and $n$; 5) $f(m)>f(n)$ whenever $m>n$. Prove that $f(n)=n$.

Find all functions $f: \mathbb{Q}^{+}\to \mathbb{Q}^{+}$ such that for all $x,y \in \mathbb{Q}$: \[f \left( x+\frac{y}{x}\right) =f(x)+\frac{f(y)}{f(x)}+2y, \; x,y \in \mathbb{Q}^{+}.\]

Let $S$ be a nonempty finite set, and $\mathcal {F}$ be a collection of subsets of $S$ such that the following conditions are met: (i) $\mathcal {F}$ $\setminus$ {$S$} $\neq$ $\emptyset$ ; (ii) if $F_1, F_2 \in \mathcal {F}$, then $F_1 \cap F_2 \in \mathcal {F}$ and $F_1 \cup F_2 \in \mathcal {F}$. Prove that there exists $a \in S$ which belongs to at most half of the elements of $\mathcal {F}$.

The tangents to the circumcircle of $\triangle ABC$ at $B$ and $C$ meet at $D$. The circumcircle of $\triangle BCD$ meets sides $AC$ and $AB$ again at $E$ and $F$ respectively. Let $O$ be the circumcentre of $\triangle ABC$. Show that $AO$ is perpendicular to $EF$.

Given $1980$ vectors in the plane, and there are some non-collinear among them. The sum of every $1979$ vectors is collinear to the vector not included in that sum. Prove that the sum of all vectors equals to the zero vector.

Prove that every polynomial of fourth degree can be represented in the form $P(Q(x))+R(S(x))$, where $P,Q,R,S$ are quadratic trinomials. [i]A. Golovanov[/i] [b]EDIT.[/b] It is confirmed that assuming the coefficients to be [b]real[/b], while solving the problem, earned a maximum score.

Let $ABC$ a triangle, $I$ the incenter, $D$ the contact point of the incircle with the side $BC$ and $E$ the foot of the bisector of the angle $A$. If $M$ is the midpoint of the arc $BC$ which contains the point $A$ of the circumcircle of the triangle $ABC$ and $\{F\} = DI \cap AM$, prove that $MI$ passes through the midpoint of $[EF]$.

Let $ ABCDE$ be a convex pentagon such that \[ \angle BAC \equal{} \angle CAD \equal{} \angle DAE\qquad \text{and}\qquad \angle ABC \equal{} \angle ACD \equal{} \angle ADE. \]The diagonals $BD$ and $CE$ meet at $P$. Prove that the line $AP$ bisects the side $CD$. [i]Proposed by Zuming Feng, USA[/i]

Five identical empty buckets of $2$-liter capacity stand at the vertices of a regular pentagon. Cinderella and her wicked Stepmother go through a sequence of rounds: At the beginning of every round, the Stepmother takes one liter of water from the nearby river and distributes it arbitrarily over the five buckets. Then Cinderella chooses a pair of neighbouring buckets, empties them to the river and puts them back. Then the next round begins. The Stepmother goal's is to make one of these buckets overflow. Cinderella's goal is to prevent this. Can the wicked Stepmother enforce a bucket overflow? [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Chitoge is painting a cube; she can paint each face either black or white, but she wants no vertex of the cube to be touching three faces of the same color. In how many ways can Chitoge paint the cube? Two paintings of a cube are considered to be the same if you can rotate one cube so that it looks like the other cube.

Write the following polynomial as a product of irreducible polynomials in $\mathbb{Z}[X]$ \[ f(X) = X^{2005} - 2005 X + 2004 . \]Justify your answer.

Let $P_{n}$ denote the number of paths in the coordinate plane traveling from $(0, 0)$ to $(n, 0)$ with three kinds of moves: [i]upstep[/i] $u = [1, 1]$, [i]downstep[/i] $d = [1,-1]$, and [i]flatstep[/i] $f = [1, 0]$ with the path always staying above the line $y = 0.$ Let $C_{n}= \frac{1}{n+1}\binom{2n}{n}$ be the $n^{th}$ Catalan number. Prove that $P_{n}= \sum_{i = 0}^\infty \binom{n}{2i}C_{i}$ and $C_{n}= \sum_{i = 0}^{2n}(-1)^{i}\binom{2n}{i}P_{2n-i}.$ [hide="Solution to Part 1"] Let a path string, $S_{k}$, denote a string of $u, d, f$ corresponding to upsteps, downsteps, and flatsteps of length $k$ which successfully travels from $(0, 0)$ to $(n, 0)$ without passing below $y = 0.$ Also, let each entry of a path string be a slot. Lastly, denote $u_{k}, d_{k}, f_{k}$ to be the number of upsteps, downsteps, and flatsteps, respectively, in $S_{k}.$ Note that in our situation, all such path strings are in the form $S_{n},$ so all our path strings have $n$ slots. Since the starting and ending $y$ values are the same, the number of upsteps must equal the number of downsteps. Let us observe the case when there are $2k$ downsteps and upsteps totally. Thus, there are $\binom{n}{2k}$ ways to choose the slots in which the upsteps and the downsteps appear. Now, we must arrange the downsteps and upsteps in such a way that $d_{n}= u_{n}$ and a greater number of upsteps preceed downsteps, as the path is always above $y = 0$. Note that a bijection exists between this and the number of ways to binary bracket $k$ letters. The number of binary brackets of $k$ letters is just the $k^{th}$ Catalan number. We then place the flatsteps in the rest of the slots. Thus, there are a total of $\sum_{k = 0}^\infty \binom{n}{2k}C_{k}$ ways to get an $S_{n}.$ [/hide]