Show that for $0 <\epsilon <1$ the expression $(x+y)^n(x^2-(2-\epsilon)xy+y^2)$ is a polynomial with positive coefficients for $n$ sufficiently large and integral. For $\epsilon =.002$ find the smallest admissible value of $n$.

If $a,b,c$ are positive real numbers such that $a+b+c=abc$ prove that $$\frac{abc}{3\sqrt{2}}\left ( \sum_{cyc}\frac{\sqrt{a^3+b^3}}{ab+1} \right )\geq \sum_{cyc}\frac{a}{a^2+1}$$

Is is true that if the perfect set $F\subseteq [0,1]$ is of zero Lebesgue measure then those functions in $C^1[0,1]$ which are one-to-one on $F$ form a dense subset of $C^1[0,1]$? (We use the metric $$d(f,g)=\sup_{x\in[0,1]} |f(x)-g(x)| + \sup_{x\in[0,1]} |f'(x)-g'(x)|$$ to define the topology in the space $C^1[0,1]$ of continuously differentiable real functions on $[0,1]$.)

Suppose $a$ and $b$ are positive integers with a curious property: $(a^3 - 3ab +\tfrac{1}{2})^n + (b^3 +\tfrac{1}{2})^n$ is an integer for at least $3$, but at most finitely many different choices of positive integers $n$. What is the least possible value of $a+b$?

We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.

In the rectangle $ABCD, BC = 5, EC = 1/3 CD$ and $F$ is the point where $AE$ and $BD$ are cut. The triangle $DFE$ has area $12$ and the triangle $ABF$ has area $27$. Find the area of the quadrilateral $BCEF$ . [img]https://1.bp.blogspot.com/-4w6e729AF9o/XNY9hqHaBaI/AAAAAAAAKL0/eCaNnWmgc7Yj9uV4z29JAvTcWCe21NIMgCK4BGAYYCw/s400/may%2B2011%2Bl1.png[/img]

Given $n$ points, some of them connected by non-intersecting segments. You can reach every point from every one, moving along the segments, and there is no couple, connected by two different ways. Prove that the total number of the segments is $(n-1)$.

The two circles $\Gamma_1$ and $\Gamma_2$ intersect at $P$ and $Q$. The common tangent that's on the same side as $P$, intersects the circles at $A$ and $B$,respectively. Let $C$ be the second intersection with $\Gamma_2$ of the tangent to $\Gamma_1$ at $P$, and let $D$ be the second intersection with $\Gamma_1$ of the tangent to $\Gamma_2$ at $Q$. Let $E$ be the intersection of $AP$ and $BC$, and let $F$ be the intersection of $BP$ and $AD$. Let $M$ be the image of $P$ under point reflection with respect to the midpoint of $AB$. Prove that $AMBEQF$ is a cyclic hexagon.

Consider the points $P$ =$(0,0)$,$Q$ = $(1,0)$, $R$= $(2,0)$, $S$ =$(3,0)$ in the $xy$-plane. Let $A,B,C,D$ be four finite sets of colours(not necessarily distinct nor disjoint). In how many ways can $P,Q,R$ be coloured bu colours in $A,B,C$ respectively if adjacent points have to get different colours? In how many ways can $P,Q,R,S$ be coloured by colours in $A,B,C,D$ respectively if adjacent points have to get different colors?

Given a finite string $S$ of symbols $X$ and $O$, we write $@(S)$ for the number of $X$'s in $S$ minus the number of $O$'s. (For example, $@(XOOXOOX) =-1$.) We call a string $S$ [b]balanced[/b] if every substring $T$ of (consecutive symbols) $S$ has the property $-2 \leq @(T) \leq 2$. (Thus $XOOXOOX$ is not balanced since it contains the sub-string $OOXOO$ whose $@$-value is $-3$.) Find, with proof, the number of balanced strings of length $n$.

There are \(100\) countries participating in an olympiad. Suppose \(n\) is a positive integers such that each of the \(100\) countries is willing to communicate in exactly \(n\) languages. If each set of \(20\) countries can communicate in exactly one common language, and no language is common to all \(100\) countries, what is the minimum possible value of \(n\)?

Turki has divided a square into finitely many white and green rectangles, each with sides parallel to the sides of the square. Within each white rectangle, he writes down its width divided by its height. Within each green rectangle, he writes down its height divided by its width. Finally, he calculates $S$, the sum of these numbers. If the total area of white rectangles equals the total area of green rectangles, determine the minimum possible value of $S$.

In the lower-left $3\times3$ square of an $8\times8$ chessboard there are nine pawns. Every pawn can jump horizontally or vertically over a neighboring pawn to the cell across it if that cell is free. Is it possible to arrange the nine pawns in the upperleft $3\times3$ square of the chessboard using finitely many such moves?

In triangle $ABC$, we have $\angle ABC=60$. The line through $B$ perpendicular to side $AB$ intersects angle bisector of $\angle BAC$ in $D$ and the line through $C$ perpendicular $BC$ intersects angle bisector of $\angle ABC$ in $E$. prove that $\angle BED\le 30$.

Suppose $a$ and $b$ are integers such that $$x^2+ax+b+1=0$$ has $2$ positive integer solutions. Show that $a^2+b^2$ is not prime.

Evaluate $\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1+...}}}}$.

We are given the set $$M = \{-2^{2022}, -2^{2021}, . . . , -2^{2}, -2, -1, 1, 2, 2^2, . . . , 2^{2021}, 2^{2022}\}.$$ Let $T$ be a subset of $M$, such that neighbouring numbers have the same difference when the elements are ordered by size. (a) Determine the maximum number of elements that such a set $T$ can contain. (b) Determine all sets $T$ with the maximum number of elements. [i](Walther Janous)[/i]

Let an integer $ n > 3$. Denote the set $ T\equal{}\{1,2, \ldots,n\}.$ A subset S of T is called [i]wanting set[/i] if S has the property: There exists a positive integer $ c$ which is not greater than $ \frac {n}{2}$ such that $ |s_1 \minus{} s_2|\ne c$ for every pairs of arbitrary elements $ s_1,s_2\in S$. How many does a [i]wanting set[/i] have at most are there ?

What time was it $2011$ minutes after midnight on January 1, 2011? $\textbf{(A)} \text{January 1 at 9:31PM}$ $\textbf{(B)} \text{January 1 at 11:51PM}$ $\textbf{(C)} \text{January 2 at 3:11AM}$ $\textbf{(D)} \text{January 2 at 9:31AM}$ $\textbf{(E)} \text{January 2 at 6:01PM}$

Given $\vartriangle ABC$ with circumcircle $\Omega$. Assume $\omega_a, \omega_b, \omega_c$ are circles which tangent internally to $\Omega$ at $T_a,T_b, T_c $ and tangent to $BC,CA,AB$ at $P_a, P_b, P_c$, respectively. If $AT_a,BT_b,CT_c$ are collinear, prove that $AP_a,BP_b,CP_c$ are collinear.

[b]p1.[/b] A matrix is a rectangular array of numbers. For example, $\begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix}$ and $\begin{pmatrix} 1 & 3 \\ 2 & 4 \end{pmatrix}$ are $2 \times 2$ matrices. A [i]saddle [/i] point in a matrix is an entry which is simultaneously the smallest number in its row and the largest number in its column. a. Write down a $2 \times 2$ matrix which has a saddle point, and indicate which entry is the saddle point. b. Write down a $2 \times 2$ matrix which has no saddle point c. Prove that a matrix of any size, all of whose entries are distinct, can have at most one saddle point. [b]p2.[/b] a. Find four different pairs of positive integers satisfying the equation $\frac{7}{m}+\frac{11}{n}=1$. b. Prove that the solutions you have found in part (a) are all possible pairs of positive integers satisfying the equation $\frac{7}{m}+\frac{11}{n}=1$. [b]p3.[/b] Let $ABCD$ be a quadrilateral, and let points $M, N, O, P$ be the respective midpoints of sides $AB$, $BC$, $CD$, $DA$. a. Show, by example, that it is possible that $ABCD$ is not a parallelogram, but $MNOP$ is a square. Be sure to prove that your construction satisfies all given conditions. b. Suppose that $MO$ is perpendicular to $NP$. Prove that $AC = BD$. [b]p4.[/b] A [i]Pythagorean triple[/i] is an ordered collection of three positive integers $(a, b, c)$ satisfying the relation $a^2 + b^2 = c^2$. We say that $(a, b, c)$ is a [i]primitive [/i] Pythagorean triple if $1$ is the only common factor of $a, b$, and $c$. a. Decide, with proof, if there are infinitely many Pythagorean triples. b. Decide, with proof, if there are infinitely many primitive Pythagorean triples of the form $(a, b, c)$ where $c = b + 2$. c. Decide, with proof, if there are infinitely many primitive Pythagorean triples of the form $(a, b, c)$ where $c = b + 3$. [b]p5.[/b] Let $x$ and $y$ be positive real numbers and let $s$ be the smallest among the numbers $\frac{3x}{2}$,$\frac{y}{x}+\frac{1}{x}$ and $\frac{3}{y}$. a. Find an example giving $s > 1$. b. Prove that for any positive $x$ and $y,s <2$. c. Find, with proof, the largest possible value of $s$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

What is the sum of real numbers satisfying the equation $\left \lfloor \frac{6x+5}{8} \right \rfloor = \frac{15x-7}{5}$? $ \textbf{(A)}\ 2 \qquad\textbf{(B)}\ \frac{81}{90} \qquad\textbf{(C)}\ \frac{7}{15} \qquad\textbf{(D)}\ \frac{4}{5} \qquad\textbf{(E)}\ \frac{19}{15} $

In a $9\times 9$ table, all cells contain zeros. The following operations can be performed on the table: 1. Choose an arbitrary row, add one to all the numbers in that row, and shift all these numbers one cell to the right (and place the last number in the first position). 2. Choose an arbitrary column, subtract one from all its numbers, and shift all these numbers one cell down (and place the bottommost number in the top cell). Is it possible to obtain a table in which all cells, except two, contain zeros, with 1 in the bottom-left cell and -1 in the top-right cell after several such operations? [i]Proposed by N. Vlasova[/i]

Prove that there exist infinitely many non prime positive integers $n$ such that $7^{n-1} - 3^{n-1}$ is divisible by $n$. Lê Anh Vinh

Compute $$\int_0^\pi\frac{1-\sin x}{1+\sin x}dx.$$