[b]a)[/b] Prove that, for any point in the interior of a triangle, there are two points on the sides of this triangle such that the resultant of the vectors from the interior point those two points is the vector $ 0. $ [b]b)[/b] Prove that, for any point in the interior of a triangle, there are three points on the sides of this triangle such that the resultant of the vectors from the interior point those three points is the vector $ 0. $

A convex quadrilateral $ABCD$ is such that $\angle B = \angle D$ and are both acute angles. $E$ is on $AB$ such that $CB = CE$ and $F$ is on $AD$ such that $CF = CD$. If the circumcenter of $CEF$ is $O_1$ and the circumcenter of $ABD$ is $O_2$. Prove that $C,O_1,O_2$ are collinear. [i]Proposed by Kapil Pause[/i]

For each positive integer $n$, let \begin{eqnarray*} S_n &=& 1 + \frac 12 + \frac 13 + \cdots + \frac 1n, \\ T_n &=& S_1 + S_2 + S_3 + \cdots + S_n, \\ U_n &=& \frac{T_1}{2} + \frac{T_2}{3} + \frac{T_3}{4} + \cdots + \frac{T_n}{n+1}. \end{eqnarray*} Find, with proof, integers $0 < a, b,c, d < 1000000$ such that $T_{1988} = a S_{1989} - b$ and $U_{1988} = c S_{1989} - d$.

There are $n$ people, and given that any $2$ of them have contacted with each other at most once. In any group of $n-2$ of them, any one person of the group has contacted with other people in this group for $3^k$ times, where $k$ is a non-negative integer. Determine all the possible value of $n.$

For any finite set $S$, let $|S|$ denote the number of elements in $S$. FInd the number of ordered pairs $(A,B)$ such that $A$ and $B$ are (not necessarily distinct) subsets of $\{1,2,3,4,5\}$ that satisfy $$|A| \cdot |B| = |A \cap B| \cdot |A \cup B|$$

Given a set $ \mathcal{H}$ of points in the plane, $ P$ is called an "intersection point of $ \mathcal{H}$" if distinct points $ A,B,C,D$ exist in $ \mathcal{H}$ such that lines $ AB$ and $ CD$ are distinct and intersect in $ P$. Given a finite set $ \mathcal{A}_{0}$ of points in the plane, a sequence of sets is defined as follows: for any $ j\geq0$, $ \mathcal{A}_{j+1}$ is the union of $ \mathcal{A}_{j}$ and the intersection points of $ \mathcal{A}_{j}$. Prove that, if the union of all the sets in the sequence is finite, then $ \mathcal{A}_{i}=\mathcal{A}_{1}$ for any $ i\geq1$.

Define binary operations $\diamondsuit$ and $\heartsuit$ by $$a \, \diamondsuit \, b = a^{\log_{7}(b)} \qquad \text{and} \qquad a \, \heartsuit \, b = a^{\frac{1}{\log_{7}(b)}}$$ for all real numbers $a$ and $b$ for which these expressions are defined. The sequence $(a_n)$ is defined recursively by $a_3 = 3\, \heartsuit\, 2$ and $$a_n = (n\, \heartsuit\, (n-1)) \,\diamondsuit\, a_{n-1}$$ for all integers $n \geq 4$. To the nearest integer, what is $\log_{7}(a_{2019})$? $\textbf{(A) } 8 \qquad \textbf{(B) } 9 \qquad \textbf{(C) } 10 \qquad \textbf{(D) } 11 \qquad \textbf{(E) } 12$

[b]p1.[/b] Two players play the following game. On the lowest left square of an $8 \times 8$ chessboard there is a rook (castle). The first player is allowed to move the rook up or to the right by an arbitrary number of squares. The second layer is also allowed to move the rook up or to the right by an arbitrary number of squares. Then the first player is allowed to do this again, and so on. The one who moves the rook to the upper right square wins. Who has a winning strategy? [b]p2.[/b] Find the smallest positive whole number that ends with $17$, is divisible by $17$, and the sum of its digits is $17$. [b]p3.[/b] Three consecutive $2$-digit numbers are written next to each other. It turns out that the resulting $6$-digit number is divisible by $17$. Find all such numbers. [b]p4.[/b] Let $ABCD$ be a convex quadrilateral (a quadrilateral $ABCD$ is called convex if the diagonals $AC$ and $BD$ intersect). Suppose that $\angle CBD = \angle CAB$ and $\angle ACD = \angle BDA$ . Prove that $\angle ABC = \angle ADC$. [b]p5.[/b] A circle of radius $1$ is cut into four equal arcs, which are then arranged to make the shape shown on the picture. What is its area? [img]https://cdn.artofproblemsolving.com/attachments/f/3/49c3fe8b218ab0a5378ecc635b797a912723f9.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let n be a positive integer. Show that the product of $ n$ consecutive positive integers is divisible by $ n!$

Let $n$ be a positive integer. Determine the maximum of the sum $x_1+\cdots+x_n$ where $x_1,\ldots,x_n$ are non-negative integers satisfying the condition \[x_1^3+\cdots+x_n^3\le7n.\]

There are three types of piece shown as below. Today Alice wants to cover a $100 \times 101$ board with these pieces without gaps and overlaps. Determine the minimum number of $1\times 1$ pieces should be used to cover the whole board and not exceed the board. (There are an infinite number of these three types of pieces.) [asy] size(9cm,0); defaultpen(fontsize(12pt)); draw((9,10) -- (59,10) -- (59,60) -- (9,60) -- cycle); draw((59,10) -- (109,10) -- (109,60) -- (59,60) -- cycle); draw((9,60) -- (59,60) -- (59,110) -- (9,110) -- cycle); draw((9,110) -- (59,110) -- (59,160) -- (9,160) -- cycle); draw((109,10) -- (159,10) -- (159,60) -- (109,60) -- cycle); draw((180,11) -- (230,11) -- (230,61) -- (180,61) -- cycle); draw((180,61) -- (230,61) -- (230,111) -- (180,111) -- cycle); draw((230,11) -- (280,11) -- (280,61) -- (230,61) -- cycle); draw((230,61) -- (280,61) -- (280,111) -- (230,111) -- cycle); draw((280,11) -- (330,11) -- (330,61) -- (280,61) -- cycle); draw((280,61) -- (330,61) -- (330,111) -- (280,111) -- cycle); draw((330,11) -- (380,11) -- (380,61) -- (330,61) -- cycle); draw((330,61) -- (380,61) -- (380,111) -- (330,111) -- cycle); draw((401,11) -- (451,11) -- (451,61) -- (401,61) -- cycle); [/asy] [i]Proposed by amano_hina[/i]

Let $v$ and $w$ be real numbers such that, for all real numbers $a$ and $b$, the inequality \[(2^{a+b}+8)(3^a+3^b) \leq v(12^{a-1}+12^{b-1}-2^{a+b-1})+w\] holds. Compute the smallest possible value of $128v^2+w^2$. [i]Proposed by Luke Robitaille[/i]

Prove that for all n=3,4,5.... there excist odd x,y such $2^n=x^2 + 7y^2$ .

Let $O$ be the circumcenter of triangle $\triangle ABC$, where $\angle BAC=120^{\circ}$. The tangent at $A$ to $(ABC)$ meets the tangents at $B,C$ at $(ABC)$ at points $P,Q$ respectively. Let $H,I$ be the orthocenter and incenter of $\triangle OPQ$ respectively. Define $M,N$ as the midpoints of arc $\overarc{BAC}$ and $OI$ respectively, and let $MN$ meet $(ABC)$ again at $D$. Prove that $AD$ is perpendicular to $HI$.

The $n$ points $P_1,P_2, \ldots, P_n$ are placed inside or on the boundary of a disk of radius 1 in such a way that the minimum distance $D_n$ between any two of these points has its largest possible value $D_n.$ Calculate $D_n$ for $n = 2$ to 7. and justify your answer.

Consider five-dimensional Cartesian space $R^5 = \{(x_1, x_2, x_3, x_4, x_5) | x_i \in R\}$, and consider the hyperplanes with the following equations: $\bullet$ $x_i = x_j$ for every $1 \le i < j \le 5$, $\bullet$ $x_1 + x_2 + x_3 + x_4 + x_5 = -1$, $\bullet$ $x_1 + x_2 + x_3 + x_4 + x_5 = 0$, $\bullet$ $x_1 + x_2 + x_3 + x_4 + x_5 = 1$. Into how many regions do these hyperplanes divide $R^5$ ?

Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ which satisfy $yf(x)+f(y) \geq f(xy)$

Prove the following inequality. \[\frac{e-1}{n+1}\leqq\int^e_1(\log x)^n dx\leqq\frac{(n+1)e+1}{(n+1)(n+2)}\ (n=1,2,\cdot\cdot\cdot) \] 1994 Kyoto University entrance exam/Science

Let $f(N) = N \left( \frac{9}{10} \right)^N$ , and let $\frac{m}{n}$ denote the maximum value of $f(N)$, as $N$ ranges over the positive integers. If $m$ and $n$ are relatively prime positive integers, find the remainder when $m + n$ is divided by $1000$.

Find all triples $(a,b,c)$ of real numbers such that the following system holds: $$\begin{cases} a+b+c=\frac{1}{a}+\frac{1}{b}+\frac{1}{c} \\a^2+b^2+c^2=\frac{1}{a^2}+\frac{1}{b^2}+\frac{1}{c^2}\end{cases}$$ [i]Proposed by Dorlir Ahmeti, Albania[/i]

Find all solutions of the following system of $n$ equations in $n$ variables: \[\begin{array}{c}\ x_1|x_1| - (x_1 - a)|x_1 - a| = x_2|x_2|,x_2|x_2| - (x_2 - a)|x_2 - a| = x_3|x_3|,\ \vdots \ x_n|x_n| - (x_n - a)|x_n - a| = x_1|x_1|\end{array}\] where $a$ is a given number.

A gas diffuses one-third as fast as $\ce{O2}$ at $100^{\circ}\text{C}$. This gas could be: $ \textbf{(A)}\hspace{.05in}\text{He (M=4)}\qquad\textbf{(B)}\hspace{.05in}\ce{C2H5F}(\text{M=48})$ $\qquad\textbf{(C)}\hspace{.05in}\ce{C7H12}\text{(M=96)}\qquad\textbf{(D)}\hspace{.05in}\ce{C5F12}\text{(M=288)}\qquad$

If $a_1 \geq a_2 \geq \cdots \geq a_n \geq 0$ and $a_1+a_2+\cdots+a_n=1$, then prove: \[a_1^2+3a_2^2+5a_3^2+ \cdots +(2n-1)a_n^2 \leq 1\]

You have some cyan, magenta, and yellow beads on a non-reorientable circle, and you can perform only the following operations: 1. Move a cyan bead right (clockwise) past a yellow bead, and turn the yellow bead magenta. 2. Move a magenta bead left of a cyan bead, and insert a yellow bead left of where the magenta bead ends up. 3. Do either of the above, switching the roles of the words ``magenta'' and ``left'' with those of ``yellow'' and ``right'', respectively. 4. Pick any two disjoint consecutive pairs of beads, each either yellow-magenta or magenta-yellow, appearing somewhere in the circle, and swap the orders of each pair. 5. Remove four consecutive beads of one color. Starting with the circle: ``yellow, yellow, magenta, magenta, cyan, cyan, cyan'', determine whether or not you can reach a) ``yellow, magenta, yellow, magenta, cyan, cyan, cyan'', b) ``cyan, yellow, cyan, magenta, cyan'', c) ``magenta, magenta, cyan, cyan, cyan'', d) ``yellow, cyan, cyan, cyan''. [i]Proposed by Sammy Luo[/i]

Find all functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $n\in \mathbb{N}$: \[f(f(f(n)))+6f(n)=3f(f(n))+4n+2001.\]