Find the maximum value of the following integral. \[\int_0^{\infty} e^{-x}\sin tx\ dx\]

A $4$-dimensional hypercube of edge length $1$ is constructed in $4$-space with its edges parallel to the coordinate axes and one vertex at the origin. The coordinates of its sixteen vertices are given by $(a, b, c, d)$, where each of $a, b, c,$ and $d$ is either $0$ or $1$. The $3$-dimensional hyperplane given by $x + y + z + w = 2$ intersects the hypercube at $6$ of its vertices. Compute the $3$-dimensional volume of the solid formed by the intersection.

Points $A,B,C,D$ have been marked on checkered paper (see fig.). Find the tangent of the angle $ABD$. [img]https://cdn.artofproblemsolving.com/attachments/6/1/eeb98ccdee801361f9f66b8f6b2da4714e659f.png[/img]

Let the polynomial $P(x)=a_{21}x^{21}+a_{20}x^{20}+\cdots +a_1x+a_0$ where $1011\leq a_i\leq 2021$ for all $i=0,1,2,...,21.$ Given that $P(x)$ has an integer root and there exists an positive real number$c$ such that $|a_{k+2}-a_k|\leq c$ for all $k=0,1,...,19.$ a) Prove that $P(x)$ has an only integer root. b) Prove that $$\sum_{k=0}^{10}(a_{2k+1}-a_{2k})^2\leq 440c^2.$$

[b]p1.[/b] Consider a parallelogram $ABCD$ with sides of length $a$ and $b$, where $a \ne b$. The four points of intersection of the bisectors of the interior angles of the parallelogram form a rectangle $EFGH$. A possible configuration is given below. Show that $$\frac{Area(ABCD)}{Area(EFGH)}=\frac{2ab}{(a - b)^2}$$ [img]https://cdn.artofproblemsolving.com/attachments/e/a/afaf345f2ef7c8ecf4388918756f0b56ff20ef.png[/img] [b]p2.[/b] A metal wire of length $4\ell$ inches (where $\ell$ is a positive integer) is used as edges to make a cardboard rectangular box with surface area $32$ square inches and volume $8$ cubic inches. Suppose that the whole wire is used. (i) Find the dimension of the box if $\ell= 9$, i.e., find the length, the width, and the height of the box without distinguishing the different orders of the numbers. Justify your answer. (ii) Show that it is impossible to construct such a box if $\ell = 10$. [b]p3.[/b] A Pythagorean n-tuple is an ordered collection of counting numbers $(x_1, x_2,..., x_{n-1}, x_n)$ satisfying the equation $$x^2_1+ x^2_2+ ...+ x^2_{n-1} = x^2_{n}.$$ For example, $(3, 4, 5)$ is an ordinary Pythagorean $3$-tuple (triple) and $(1, 2, 2, 3)$ is a Pythagorean $4$-tuple. (a) Given a Pythagorean triple $(a, b, c)$ show that the $4$-tuple $(a^2, ab, bc, c^2)$ is Pythagorean. (b) Extending part (a) or using any other method, come up with a procedure that generates Pythagorean $5$-tuples from Pythagorean $3$- and/or $4$-tuples. Few numerical examples will not suffice. You have to find a method that will generate infinitely many such $5$-tuples. (c) Find a procedure to generate Pythagorean $6$-tuples from Pythagorean $3$- and/or $4$- and/or $5$-tuples. Note. You can assume without proof that there are infinitely many Pythagorean triples. [b]p4.[/b] Consider the recursive sequence defined by $x_1 = a$, $x_2 = b$ and $$x_{n+2} =\frac{x_{n+1} + x_n - 1}{x_n - 1}, n \ge 1 .$$ We call the pair $(a, b)$ the seed for this sequence. If both $a$ and $b$ are integers, we will call it an integer seed. (a) Start with the integer seed $(2, 2019)$ and find $x_7$. (b) Show that there are infinitely many integer seeds for which $x_{2020} = 2020$. (c) Show that there are no integer seeds for which $x_{2019} = 2019$. [b]p5.[/b] Suppose there are eight people at a party. Each person has a certain amount of money. The eight people decide to play a game. Let $A_i$, for $i = 1$ to $8$, be the amount of money person $i$ has in his/her pocket at the beginning of the game. A computer picks a person at random. The chosen person is eliminated from the game and their money is put into a pot. Also magically the amount of money in the pockets of the remaining players goes up by the dollar amount in the chosen person's pocket. We continue this process and at the end of the seventh stage emerges a single person and a pot containing $M$ dollars. What is the expected value of $M$? The remaining player gets the pot and the money in his/her pocket. What is the expected value of what he/she takes home? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all integers $n$ such that both of the numbers: $$|n^3 - 4n^2 + 3n - 35| \text{ and } |n^2 + 4n + 8|$$ are both prime numbers.

Investigate the asymptotic behaviour of the solutions $y$ of the equation $x^5 + x^2y^2 = y^6$ that tend to zero as $x\to0$.

Let $\triangle ABC$ be a right triangle with right angle at $C$. Let $D$ and $E$ be points on $\overline{AB}$ with $D$ between $A$ and $E$ such that $\overline{CD}$ and $\overline{CE}$ trisect $\angle C$. If $\frac{DE}{BE} = \frac{8}{15}$, then $\tan B$ can be written as $\frac{m\sqrt{p}}{n}$, where $m$ and $n$ are relatively prime positive integers, and $p$ is a positive integer not divisible by the square of any prime. Find $m+n+p$.

The integers $1, 2, 3,. . . , 2016$ are written in a board. You can choose any pair of numbers in the board and replace them with their average. For example, you can replace $1$ and $2$ with $1.5$, or you can replace $1$ and $3$ with a second copy of $2$. After such replacements, the board will have only one number. (a) Prove that there is a sequence of substitutions that will make let the final number be $2$. (b) Prove that there is a sequence of substitutions that will make let the final number be $1000$.

Let $ m > 1$ be an integer, $ n$ is an odd number satisfying $ 3\le n < 2m,$ number $ a_{i,j} (i,j\in N, 1\le i\le m, 1\le j\le n)$ satisfies $ (1)$ for any $ 1\le j\le n, a_{1,j},a_{2,j},\cdots,a_{m,j}$ is a permutation of $ 1,2,3,\cdots,m; (2)$ for any $ 1 < i\le m, 1\le j\le n \minus{} 1, |a_{i,j} \minus{} a_{i,{j \plus{} 1}}|\le 1$ holds. Find the minimal value of $ M$, where $ M \equal{} max_{1 < i < m}\sum_{j \equal{} 1}^n{a_{i,j}}.$

The area of a circle whose circumference is $ 24\pi$ is $ k\pi$. What is the value of $ k$? $ \textbf{(A)}\ 6 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 24 \qquad \textbf{(D)}\ 36 \qquad \textbf{(E)}\ 144$

Which formula represents n-butane? $ \textbf{(A) }\ce{CH3CH2CH2CH3} \qquad\textbf{(B) } \ce{CH2=CHCH2CH3} \qquad\textbf{(C) } \ce{(CH3)2CHCH3} \qquad\textbf{(D) } \ce{(CH3)3CH}\qquad $

A rectangle with width $30$ inches has the property that all points in the rectangle are within $12$ inches of at least one of the diagonals of the rectangle. Find the maximum possible length for the rectangle in inches.

Given $10$ positive integers with a sum equal to $1000$. The product of their factorials is a $10$-th power of an integer. Prove that all these numbers are equal.

Assume $c$ is a real number. If there exists $x\in[1,2]$ such that $\max\left\{\left |x+\frac cx\right |, \left |x+\frac cx + 2\right |\right\}\geq 5$, please find the value range of $c$.

Let $n>1$ be a positive integer. Each cell of an $n\times n$ table contains an integer. Suppose that the following conditions are satisfied: [list=1] [*] Each number in the table is congruent to $1$ modulo $n$. [*] The sum of numbers in any row, as well as the sum of numbers in any column, is congruent to $n$ modulo $n^2$. [/list] Let $R_i$ be the product of the numbers in the $i^{\text{th}}$ row, and $C_j$ be the product of the number in the $j^{\text{th}}$ column. Prove that the sums $R_1+\hdots R_n$ and $C_1+\hdots C_n$ are congruent modulo $n^4$.

Points $E$ and $F$ lie inside a square $ABCD$ such that the two triangles $ABF$ and $BCE$ are equilateral. Show that $DEF$ is an equilateral triangle.

A ball of mass $m_\text{1}$ travels along the x-axis in the positive direction with an initial speed of $v_{\text{0}}$. It collides with a ball of mass $m_\text{2}$ that is originally at rest. After the collision, the ball of mass $m_\text{1}$ has velocity $v_{\text{1x}}\hat{x}+v_{\text{1y}}\hat{y}$ and the ball of mass $m_\text{2}$ has velocity $v_{\text{2x}}\hat{x}+v_{\text{2y}}\hat{y}$. Consider the following five statements: $\text{I)} \ \ \ \ \ \ 0=m_{\text{1}}v_{\text{1x}}+m_{\text{1}}v_{\text{2x}}$ $\text{II)} \ \ \ \ \ m_{\text{1}}v_{\text{0}}=m_{\text{1}}v_{\text{1y}}+m_{\text{2}}v_{\text{2y}}$ $\text{III)} \ \ \ \ 0=m_{\text{1}}v_{\text{1y}}+m_{\text{2}}v_{\text{2y}}$ $\text{IV)} \ \ \ \ m_{\text{1}}v_{\text{0}}=m_{\text{1}}v_{\text{1x}}+m_{\text{1}}v_{\text{1y}}$ $\text{V)} \ \ \ \ \ m_{\text{1}}v_{\text{0}}=m_{\text{1}}v_{\text{1x}}+m_{\text{2}}v_{\text{2x}}$ Of these five statements, the system must satisfy (a) $\text{I and II}$ (b) $\text{III and V}$ (c) $\text{II and V}$ (d) $\text{III and IV}$ (e) $\text{I and III}$

Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.

The table below shows the distance $ s$ in feet a ball rolls down an inclined plane in $ t$ seconds. \[ \begin{tabular}{|c|c|c|c|c|c|c|} \hline t & 0 & 1 & 2 & 3 & 4 & 5\\ \hline s & 0 & 10 & 40 & 90 & 160 & 250\\ \hline \end{tabular} \] The distance $ s$ for $ t \equal{} 2.5$ is: $ \textbf{(A)}\ 45\qquad \textbf{(B)}\ 62.5\qquad \textbf{(C)}\ 70\qquad \textbf{(D)}\ 75\qquad \textbf{(E)}\ 82.5$

In a regular polygon $H$ of $6n+1$ sides ($n$ is a positive integer), we paint $r$ vertices red, and the rest blue. Demonstrate that the number of isosceles triangles that have three of their vertices of the same color does not depend on the way we distribute the colors on the vertices of $H$.

A function $ f:\mathbb{R}^2\longrightarrow\mathbb{R} $ is [i]olympic[/i] if, any finite number of pairwise distinct elements of $ \mathbb{R}^2 $ at which the function takes the same value represent in the plane the vertices of a convex polygon. Prove that if $ p $ if a complex polynom of degree at least $ 1, $ then the function $ \mathbb{R}^2\ni (x,y)\mapsto |p(x+iy)| $ is olympic if and only if the roots of $ p $ are all equal.

The equation $166\times 56 = 8590$ is valid in some base $b \ge 10$ (that is, $1, 6, 5, 8, 9, 0$ are digits in base $b$ in the above equation). Find the sum of all possible values of $b \ge 10$ satisfying the equation.

$ ABCD$ is a square of side length $ \sqrt{3} + 1 $. Point $ P $ is on $ \overline{AC} $ such that $ AP = \sqrt{2} $. The square region bounded by $ ABCD $ is rotated $ 90^{\circ} $ counterclockwise with center $ P $, sweeping out a region whose area is $ \frac{1}{c} (a \pi + b) $, where $a $, $b$, and $ c $ are positive integers and $ \text{gcd}(a,b,c) = 1 $. What is $ a + b + c $? $\textbf{(A)} \ 15 \qquad \textbf{(B)} \ 17 \qquad \textbf{(C)} \ 19 \qquad \textbf{(D)} \ 21 \qquad \textbf{(E)} \ 23 $

$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$