Prove that $\int_0^4 \left(1-\cos \frac{x}{2}\right)e^{\sqrt{x}}dx\leq -2e^2+30.$

Right triangular prism $ABCDEF$ with triangular faces $\vartriangle ABC$ and $\vartriangle DEF$ and edges $\overline{AD}$, $\overline{BE}$, and $\overline{CF}$ has $\angle ABC = 90^o$ and $\angle EAB = \angle CAB = 60^o$ . Given that $AE = 2$, the volume of $ABCDEF$ can be written in the form $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$. [img]https://cdn.artofproblemsolving.com/attachments/4/7/25fbe2ce2df50270b48cc503a8af4e0c013025.png[/img]

How many paths from $(0,0)$ to $(n,n)$ of length $2n$ are there with exactly $k$ steps. A step is an occurence of the pair $EN$ in the path

Let $(a_1,a_2,a_3,...,a_{2011})$ be a permutation of the numbers $1,2,3,...,2011$. Show that there exist two numbers $j,k$ such that $1\leq{j}<k\leq2011$ and $|a_j-j|=|a_k-k|$

Given eleven real numbers, prove that there exist two of them such that their decimal representations agree infinitely often.

Does there exist an increasing sequence of positive integers $a_1 , a_2 ,\cdots$ with the following two properties? (i) Every positive integer $n$ can be uniquely expressed in the form $n = a_j - a_i$ , (ii) $\frac{a_k}{k^3}$ is bounded.

Let $p$ be a prime number. We know that each natural number can be written in the form \[\sum_{i=0}^{t}a_ip^i (t,a_i \in \mathbb N\cup \{0\},0\le a_i\le p-1)\] Uniquely. Now let $T$ be the set of all the sums of the form \[\sum_{i=0}^{\infty}a_ip^i (0\le a_i \le p-1).\] (This means to allow numbers with an infinite base $p$ representation). So numbers that for some $N\in \mathbb N$ all the coefficients $a_i, i\ge N$ are zero are natural numbers. (In fact we can consider members of $T$ as sequences $(a_0,a_1,a_2,...)$ for which $\forall_{i\in \mathbb N}: 0\le a_i \le p-1$.) Now we generalize addition and multiplication of natural numbers to this set so that it becomes a ring (it's not necessary to prove this fact). For example: $1+(\sum_{i=0}^{\infty} (p-1)p^i)=1+(p-1)+(p-1)p+(p-1)p^2+...$ $=p+(p-1)p+(p-1)p^2+...=p^2+(p-1)p^2+(p-1)p^3+...$ $=p^3+(p-1)p^3+...=...$ So in this sum, coefficients of all the numbers $p^k, k\in \mathbb N$ are zero, so this sum is zero and thus we can conclude that $\sum_{i=0}^{\infty}(p-1)p^i$ is playing the role of $-1$ (the additive inverse of $1$) in this ring. As an example of multiplication consider \[(1+p)(1+p+p^2+p^3+...)=1+2p+2p^2+\cdots\] Suppose $p$ is $1$ modulo $4$. Prove that there exists $x\in T$ such that $x^2+1=0$. [i]Proposed by Masoud Shafaei[/i]

If $\phi$ is the Golden Ratio, we know that $\frac1\phi = \phi - 1$. Define a new positive real number, called $\phi_d$, where $\frac1{\phi_d} = \phi_d - d$ (so $\phi = \phi_1$). Given that $\phi_{2009} = \frac{a + \sqrt{b}}{c}$, $a, b, c$ positive integers, and the greatest common divisor of $a$ and $c$ is 1, find $a + b + c$.

Let $O$ be the circumcenter and $H$ the orthocenter of an acute-angled triangle $ABC$ such that $BC>CA$. Let $F$ be the foot of the altitude $CH$ of triangle $ABC$. The perpendicular to the line $OF$ at the point $F$ intersects the line $AC$ at $P$. Prove that $\measuredangle FHP=\measuredangle BAC$.

Let $r(m)$ be the number of positive integers a less than or equal to $m$ where $\gcd(a, m)$ is prime. Find the sum of all positive integers $m < 300$ such that $r(m) = \varphi(m),$ where $\varphi(m)$ denotes the number of positive integers $a$ less than $m$ where $\gcd(a, m) = 1.$

Let $a,b,c$ be positive real numbers. Prove that $\sqrt{\frac{a}{b+c}+\frac{b}{c+a}}+\sqrt{\frac{b}{c+a}+\frac{c}{a+b}}+\sqrt{\frac{c}{a+b}+\frac{a}{b+c}}\ge 3$

Find all triples $(a, b, c)$ of positive integers such that $a^3 + b^3 + c^3 = (abc)^2$.

Lamija and Faris are playing the following game. Cards, which are numerated from $1$ to $100$, are placed one next to other, starting from $1$ to $100$. Now Faris picks every $7$th card, and after that every card which contains number $7$. After that Lamija picks from remaining cards ones divisible with $5$, and after that cards which contain number $5$. Who will have more cards and how many ? How would game end, if Lamija started with "$5$ rule" and Faris continues with "$7$ rule"?

Given non-zero real numbers $u,v,w,x,y,z$, how many different possibilities are there for the signs of these numbers if $$(u+ix)(v+iy)(w+iz)=i?$$

Solve the inequation $\sqrt {3-x}-\sqrt {x+1}>\frac {1}{2}$.

In Wonderland there are at least $5$ towns. Some towns are connected directly by roads or railways. Every town is connected to at least one other town and for any four towns there exists some direct connection between at least three pairs of towns among those four. When entering the public transportation network of this land, the traveller must insert one gold coin into a machine, which lets him use a direct connection to go to the next town. But if the traveller continues travelling from some town with the same method of transportation that took him there, and he has paid a gold coin to get to this town, then going to the next town does not cost anything, but instead the traveller gains the coin he last used back. In other cases he must pay just like when starting travelling. Prove that it is possible to get from any town to any other town by using at most $2$ gold coins.

Determine all natural numbers $n \ge 2$ with the property that there are two permutations $(a_1, a_2,... , a_n) $ and $(b_1, b_2,... , b_n)$ of the numbers $1, 2,..., n$ such that $(a_1 + b_1, a_2 +b_2,..., a_n + b_n)$ are consecutive natural numbers. [i](Walther Janous)[/i]

Consider the permutation of $1,2,...,n$, which we denote as $\{a_1,a_2,...,a_n\}$. Let $f(n)$ be the number of these permutations satisfying the following conditions: (1)$a_1=1$ (2)$|a_i-a_{i-1}|\le2, i=1,2,...,n-1$ what is the residue when we divide $f(2015)$ by $4$ ?

A convex polygon is given, no two of whose sides are parallel. For each side we consider the angle the side subtends at the vertex farthest from the side. Show that the sum of these angles equals 180 degrees.

Let $A_0A_1A_2A_3A_4A_5$ be a convex hexagon inscribed in a circle. Define the points $A_0'$, $A_2'$, $A_4'$ on the circle, such that \[ A_0A_0' \parallel A_2A_4, \quad A_2A_2' \parallel A_4A_0, \quad A_4A_4' \parallel A_2A_0 . \] Let the lines $A_0'A_3$ and $A_2A_4$ intersect in $A_3'$, the lines $A_2'A_5$ and $A_0A_4$ intersect in $A_5'$ and the lines $A_4'A_1$ and $A_0A_2$ intersect in $A_1'$. Prove that if the lines $A_0A_3$, $A_1A_4$ and $A_2A_5$ are concurrent then the lines $A_0A_3'$, $A_4A_1'$ and $A_2A_5'$ are also concurrent.

In ancient times there was a Celtic tribe consisting of several families. Many of these families were at odds with each other, so that their chiefs would not shake hands. At some point at the annual meeting of the chiefs they found it even impossible to assemble four or more of them in a circle with each of them being willing to shake his neighbour's hand. To emphasize the gravity of the situation, the Druid collected three pieces of gold from each family. The Druid then let all those chiefs shake hands who were willing to. For each handshake of two chiefs he paid each of them a piece of gold as a reward. Show that the number of pieces of gold collected by the Druid exceeds the number of pieces paid out by at least three.

Let $ABC$ be an acute triangle, let $H$ and $O$ be its orthocentre and circumcentre, respectively, and let $S$ and $T$ be the feet of the altitudes from $B$ to $AC$ and from $C$ to $AB$, respectively. Let $M$ be the midpoint of the segment $ST$, and let $N$ be the midpoint of the segment $AH$. The line through $O$, parallel to $BC$, crosses the sides $AC$ and $AB$ at $F$ and $G$, respectively. The line $NG$ meets the circle $BGO$ again at $K$, and the line $NF$ meets the circle $CFO$ again at $L$. Prove that the triangles $BCM$ and $KLN$ are similar.

There are nonzero integers $a$, $b$, $r$, and $s$ such that the complex number $r+si$ is a zero of the polynomial $P(x) = x^3 - ax^2 + bx - 65$. For each possible combination of $a$ and $b$, let $p_{a,b}$ be the sum of the zeroes of $P(x)$. Find the sum of the $p_{a,b}$'s for all possible combinations of $a$ and $b$.

Let $\ell$ be a positive integer. We say that a positive integer $k$ is [i]nice [/i] if $k!+\ell$ is a square of an integer. Prove that for every positive integer $n \geqslant \ell$, the set $\{1, 2, \ldots,n^2\}$ contains at most $n^2-n +\ell$ nice integers. \\ \\ (Théo Lenoir)

Source: 2017 Canadian Open Math Challenge, Problem C4 ----- Let n be a positive integer and $S_n = \{1, 2, . . . , 2n - 1, 2n\}$. A [i]perfect pairing[/i] of $S_n$ is defined to be a partitioning of the $2n$ numbers into $n$ pairs, such that the sum of the two numbers in each pair is a perfect square. For example, if $n = 4$, then a perfect pairing of $S_4$ is $(1, 8),(2, 7),(3, 6),(4, 5)$. It is not necessary for each pair to sum to the same perfect square. (a) Show that $S_8$ has at least one perfect pairing. (b) Show that $S_5$ does not have any perfect pairings. (c) Prove or disprove: there exists a positive integer $n$ for which $S_n$ has at least $2017$ different perfect pairings. (Two pairings that are comprised of the same pairs written in a different order are considered the same pairing.)