Compute \[\int_0^{10}(x-5)+(x-5)^2+(x-3)^2dx.\]

Find all positive integers such that $3^{2n}+3n^2+7$ is a perfect square.

In a $2 \times 8$ squared board, you want to color each square red or blue in such a way that on each $2 \times 2$ sub-board there are at least $3$ boxes painted blue. In how many ways can this coloring be done? Note. A $2 \times 2$ board is a square made up of $4$ squares that have a common vertex.

Given pyramid with base $n-gon$. How many maximum number of edges can be perpendicular to base?

Prove that for each positive integer $n$, there exists a positive integer with the following properties: It has exactly $n$ digits. None of the digits is 0. It is divisible by the sum of its digits.

Given a nonequilateral triangle $ABC$, the vertices listed counterclockwise, find the locus of the centroids of the equilateral triangles $A'B'C'$ (the vertices listed counterclockwise) for which the triples of points $A,B', C'; A',B, C';$ and $A',B', C$ are collinear. [i]Proposed by Poland.[/i]

Show that any two points lying inside a regular $ n\minus{}$gon $ E$ can be joined by two circular arcs lying inside $ E$ and meeting at an angle of at least $ \left(1 \minus{} \frac{2}{n} \right) \cdot \pi.$

Let $ABCD$ be a quadrilateral and let $l$ be a line. Let $l$ intersect the lines $AB,CD,BC,DA,AC,BD$ at points $X,X',Y,Y',Z,Z'$ respectively. Given that these six points on $l$ are in the order $X,Y,Z,X',Y',Z'$, show that the circles with diameter $XX',YY',ZZ'$ are coaxal.

A tetrahedron has five edges of length $3$ and circumradius $2$. What is the length of the sixth edge?

Rice University and Stanford University write questions and corresponding solutions for a high school math tournament. The Rice group writes 10 questions every hour but make a mistake in calculating their solutions 10% of the time. The Stanford group writes 20 problems every hour and makes solution mistakes 20% of the time. Each school works for 10 hours and then sends all problems to Smartie to be checked. However, Smartie isn’t really so smart, and only 75% of the problems she thinks are wrong are actually incorrect. Smartie thinks 20% of questions from Rice have incorrect solutions, and that 10% of questions from Stanford have incorrect solutions. This problem was definitely written and solved correctly. What is the probability that Smartie thinks its solution is wrong?

A positive integer is equal to the sum of the squares of its four smallest positive divisors. What is the largest prime that divides this positive integer?

A sequence $(a_n)$ of real numbers is defined by $a_0=1$, $a_1=2015$ and for all $n\geq1$, we have $$a_{n+1}=\frac{n-1}{n+1}a_n-\frac{n-2}{n^2+n}a_{n-1}.$$ Calculate the value of $\frac{a_1}{a_2}-\frac{a_2}{a_3}+\frac{a_3}{a_4}-\frac{a_4}{a_5}+\ldots+\frac{a_{2013}}{a_{2014}}-\frac{a_{2014}}{a_{2015}}$.

Non-negative integers $a, b, c, d$ satisfy the equation $a + b + c + d = 100$ and there exists a non-negative integer n such that $$a+ n =b- n= c \times n = \frac{d}{n} $$ Find all 5-tuples $(a, b, c, d, n)$ satisfying all the conditions above.

In a simple graph with 300 vertices no two vertices of the same degree are adjacent (boo hoo hoo). What is the maximal possible number of edges in such a graph?

Consider an integer $n\geq 2$ and an odd prime $p$. Let $U$ be the set of all positive integers $($strictly$)$ less than $p^n$ that are not divisible by $p$, and let $N$ be the number of elements of $U$. Does there exist permutation $a_1,a_2,\cdots a_N$ of the numbers in $U$ such that the sum $\sum_{k=1}^N a_ka_{k+1}$,where $a_{N+1}=a_1$, be divisible by $p^{n-1}$ but not by $p^n$? $Alexander \ Ivanov \, Bulgaria$

Let $ ABCD$ be a rhombus with $ \angle BAD \equal{} 60^{\circ}$. Points $ S$ and $ R$ are chosen inside the triangles $ ABD$ and $ DBC$, respectively, such that $ \angle SBR \equal{} \angle RDS \equal{} 60^{\circ}$. Prove that $ SR^2\geq AS\cdot CR$.

Given a triangle $ABC$ and a point $O$ on a plane. Let $\Gamma$ be the circumcircle of $ABC$. Suppose that $CO$ intersects with $AB$ at $D$, and $BO$ and $CA$ intersect at $E$. Moreover, suppose that $AO$ intersects with $\Gamma$ at $A,F$. Let $I$ be the other intersection of $\Gamma$ and the circumcircle of $ADE$, and $Y$ be the other intersection of $BE$ and the circumcircle of $CEI$, and $Z$ be the other intersection of $CD$ and the circumcircle of $BDI$. Let $T$ be the intersection of the two tangents of $\Gamma$ at $B,C$, respectively. Lastly, suppose that $TF$ intersects with $\Gamma$ again at $U$, and the reflection of $U$ w.r.t. $BC$ is $G$. Show that $F,I,G,O,Y,Z$ are concyclic.

Consider the following $2 \times 3$ arrangement of pegs on a board. Jane places three rubber bands on the pegs on the board such that the following conditions are satisfied: $~$ [center] (I) No two rubber bands cross each other. (II) Each peg has a rubber band wrapped around it [/center]$~$ How many distinct arrangements could Jane create exist? One acceptable arrangement is shown below. [asy] size(100); filldraw(circle((0,0),0.2),black); filldraw(circle((1,0),0.2),black); filldraw(circle((2,0),0.2),black); filldraw(circle((0,1),0.2),black); filldraw(circle((1,1),0.2),black); filldraw(circle((2,1),0.2),black); draw((0,1.2)--(1,1.2)); draw((0,0.8)--(1,0.8)); draw((1,0.2)--(2,0.2)); draw((1,-0.2)--(2,-0.2)); draw((0,0.2)--(2,1.2)); draw((0,-0.2)--(2,0.8)); [/asy] $\textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }5\qquad\textbf{(D) }6\qquad\textbf{(E) }8$

Point $D$ is selected inside acute $\triangle ABC$ so that $\angle DAC = \angle ACB$ and $\angle BDC = 90^{\circ} + \angle BAC$. Point $E$ is chosen on ray $BD$ so that $AE = EC$. Let $M$ be the midpoint of $BC$. Show that line $AB$ is tangent to the circumcircle of triangle $BEM$. [i]Proposed by Anton Trygub[/i]

Let $ABC$ be a triangle with $\angle A = 90^o$ and $\angle B < \angle C$. The tangent at $A$ to the circumcircle $k$ of $\vartriangle ABC$ intersects line $BC$ at $D$. Let $E$ be the reflection of $A$ in $BC$. Also, let $X$ be the feet of the perpendicular from $A$ to $BE$ and let $Y$ be the midpoint of $AX$. Line $BY$ meets $k$ again at $Z$. Prove that line $BD$ is tangent to the circumcircle of $\vartriangle ADZ$.

Let $S$ is a finite set with $n$ elements. We divided $AS$ to $m$ disjoint parts such that if $A$, $B$, $A \cup B$ are in the same part, then $A=B.$ Find the minimum value of $m$.

As in the picture below, the rectangle on the left hand side has been divided into four parts by line segments which are parallel to a side of the rectangle. The areas of the small rectangles are $A,B,C$ and $D$. Similarly, the small rectangles on the right hand side have areas $A^\prime,B^\prime,C^\prime$ and $D^\prime$. It is known that $A\leq A^\prime$, $B\leq B^\prime$, $C\leq C^\prime$ but $D\leq B^\prime$. [asy] import graph; size(12cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-4.3,xmax=12.32,ymin=-10.68,ymax=6.3; draw((0,3)--(0,0)); draw((3,0)--(0,0)); draw((3,0)--(3,3)); draw((0,3)--(3,3)); draw((2,0)--(2,3)); draw((0,2)--(3,2)); label("$A$",(0.86,2.72),SE*lsf); label("$B$",(2.38,2.7),SE*lsf); label("$C$",(2.3,1.1),SE*lsf); label("$D$",(0.82,1.14),SE*lsf); draw((5,2)--(11,2)); draw((5,2)--(5,0)); draw((11,0)--(5,0)); draw((11,2)--(11,0)); draw((8,0)--(8,2)); draw((5,1)--(11,1)); label("$A'$",(6.28,1.8),SE*lsf); label("$B'$",(9.44,1.82),SE*lsf); label("$C'$",(9.4,0.8),SE*lsf); label("$D'$",(6.3,0.86),SE*lsf); dot((0,3),linewidth(1pt)+ds); dot((0,0),linewidth(1pt)+ds); dot((3,0),linewidth(1pt)+ds); dot((3,3),linewidth(1pt)+ds); dot((2,0),linewidth(1pt)+ds); dot((2,3),linewidth(1pt)+ds); dot((0,2),linewidth(1pt)+ds); dot((3,2),linewidth(1pt)+ds); dot((5,0),linewidth(1pt)+ds); dot((5,2),linewidth(1pt)+ds); dot((11,0),linewidth(1pt)+ds); dot((11,2),linewidth(1pt)+ds); dot((8,0),linewidth(1pt)+ds); dot((8,2),linewidth(1pt)+ds); dot((5,1),linewidth(1pt)+ds); dot((11,1),linewidth(1pt)+ds); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); [/asy] Prove that the big rectangle on the left hand side has area smaller or equal to the area of the big rectangle on the right hand side, i.e. $A+B+C+D\leq A^\prime+B^\prime+C^\prime+D^\prime$.

There are $n$ instruments in the laboratory, each two of them can be connected with a wire. Moreover, if four devices $A, B, C, D$, are such that wires of $AB$, $BC$ and $CD$ are connected but there is no connected pair between $CA$, $AD$ and $DB$, a collapse occurs. A professor invented a wiring diagram that does not collapse. Coming to the laboratory, he found that the collapse has not yet occurred, but the devices are connected not according to his scheme. Prove that he can implement his scheme, each time connecting or disconnecting a pair of devices, so that the collapse won’t happen anytime.

The figure shows $9$ circles connected by $12$ lines. Georg must colour each circle either red or blue. He gets one point for each line connecting circles with different colours. How many points can he at most achieve? [img]https://cdn.artofproblemsolving.com/attachments/3/9/983d3c5755547246899891db141fe2383f3dc1.png[/img]

It is known that $x$ and $y$ are reals satisfying \[ 5x^2 + 4xy + 11y^2 = 3. \] Without using calculus (differentials/integrals), determine the maximum value of $xy - 2x + 5y$.