Find the function $f(x)$ which satisfies the following integral equation. \[f(x)=\int_0^x t(\sin t-\cos t)dt+\int_0^{\frac{\pi}{2}} e^t f(t)dt\]

The archipelago Barrantes - $n$ is a group of islands connected by bridges as follows: there are a main island (Humberto), in the first step I place an island below Humberto and one above from Humberto and I connect these 2 islands to Humberto. I put $2$ islands to the left of these $2$ new islands and I connect them with a bridge to the island that they have on their right. In the second step I take the last $2$ islands and I apply the same process that I applied to Humberto. In the third step I apply the same process to the $4$ new islands. We repeat this step n times we reflect the archipelago that we have on a vertical line to the right of Humberto. We connect Humberto with his reflection and so we have the archipelago Barrantes -$n$. However, the archipelago Barrantes -$n$ exists on a small planet cylindrical, so that the islands to the left of the archipelago are in fact the islands that are connected to the islands on the right. The figure shows the Barrantes archipelago -$2$, The islands at the edges are still numbered to show how the archipelago connects around the cylindrical world, the island numbered $1$ on the left is the same as the island numbered $1$ on the right. [img]https://cdn.artofproblemsolving.com/attachments/e/c/803d95ce742c2739729fdb4d74af59d4d0652f.png[/img] One day two bands of pirates arrive at the archipelago Barrantes - $n$: The pirates Black Beard and the Straw Hat Pirates. Blackbeard proposes a game to Straw Hat: The first player conquers an island, the next player must conquer an island connected to the island that was conquered in the previous turn (clearly not conquered on a previous shift). The one who cannot conquer any island in his turn loses. Straw Hat decides to give the first turn to Blackbeard. Prove that Straw Hat has a winning strategy for every $n$.

Find all integer solutions of the equation \[x^2+y^2=(x-y)^3.\]

Find all solutions of the equation $(a^a)^5 = b^b$ in positive integers.

Find all positive integers $n$ such that there are $k \geq 2$ positive rational numbers $a_1, a_2, \ldots, a_k$ satisfying $a_1 + a_2 + \ldots + a_k = a_1 \cdot a_2 \cdots a_k = n.$

Prove the inequality [b]a.)[/b] $ \left( a_{1}+a_{2}+...+a_{k}\right) ^{2}\leq k\left( a_{1}^{2}+a_{2}^{2}+...+a_{k}^{2}\right) , $ where $k\geq 1$ is a natural number and $a_{1},$ $a_{2},$ $...,$ $a_{k}$ are arbitrary real numbers. [b]b.)[/b] Using the inequality (1), show that if the real numbers $a_{1},$ $a_{2},$ $...,$ $a_{n}$ satisfy the inequality \[ a_{1}+a_{2}+...+a_{n}\geq \sqrt{\left( n-1\right) \left( a_{1}^{2}+a_{2}^{2}+...+a_{n}^{2}\right) }, \] then all of these numbers $a_{1},$ $a_{2},$ $\ldots,$ $a_{n}$ are non-negative.

Let $a, b, c, d > 0$ satisfy $36a + 4b + 4c + 3d = 25$. What is the maximum possible value of $ab^{1/2}c^{1/3}d^{1/4}$ ?

A positive integer $n$ is called [i]Olympic[/i], if there exists a quadratic trinomial with integer coeffecients $f(x)$ satisfying $f(f(\sqrt{n}))=0$. Determine, with proof, the largest Olympic number not exceeding $2015$. [i]A. Khrabrov[/i]

On the side $ \overline{DC} $ of the rectangle $ ABCD $ in which $ \frac{AB}{AD} = \sqrt{2} $ a semicircle is built externally. Any point $ M $ of the semicircle is connected by segments with $ A $ and $ B $ to obtain points $ K $ and $ L $ on $ \overline{DC} $, respectively. Prove that $ DL^2 + KC^2 = AB^2 $.

For each parabola $y = x^2+ px+q$ intersecting the coordinate axes in three distinct points, consider the circle passing through these points. Prove that all these circles pass through a single point, and find this point.

In triangle $ABC$, $\angle B=2\angle C$ and $\angle A>90^\circ$. Let $D$ be the point on the line $AB$ such that $CD$ is perpendicular to $AC$, and let $M$ be the midpoint of $BC$. Prove that $\angle AMB=\angle DMC$.

$25$ men sit around a circular table. Every hour there is a vote, and each must respond [i]yes [/i]or [i]no[/i]. Each man behaves as follows: on the $n^{\text{th}}$, vote if his response is the same as the response of at least one of the two people he sits between, then he will respond the same way on the $(n+1)^{\text{th}}$ vote as on the $n^{\text{th}}$ vote; but if his response is different from that of both his neighbours on the $n^{\text{th}}$ vote, then his response on the $(n+1)^{\text{th}}$ vote will be different from his response on the $n^{\text{th}}$ vote. Prove that, however everybody responded on the first vote, there will be a time after which nobody's response will ever change.

Given the inequalities: $a)$ $\left(\frac{2a}{b+c}\right)^2+\left(\frac{2b}{a+c}\right)^2+\left(\frac{2c}{a+b}\right)^2\geq \frac{a}{c}+\frac{b}{a}+\frac{c}{b}$ $b)$ $\left(\frac{a+b}{c}\right)^2+\left(\frac{b+c}{a}\right)^2+\left(\frac{c+a}{b}\right)^2\geq \frac{a}{b}+\frac{b}{c}+\frac{c}{a}+9$ For each of them either prove that it holds for all positive real numbers $a$, $b$, $c$ or present a counterexample $(a,b,c)$ which doesn't satisfy the inequality.

Let f:N→N be a function satisfying $ kf(n)\le f(kn)\le kf(n) \plus{} k \minus{} 1$ for all $ k, n\in N$. (a)Prove that $ f(a) \plus{} f(b)\le f(a \plus{} b)\le f(a) \plus{} f(b) \plus{} 1$ for all $ a, b\in N$. (b)If $ f$ satisfies $ f(2007n)\le 2007f(n) \plus{} 200$ for every $ n\in N$, show that there exists $ c\in N$ such that $ f(2007c) \equal{} 2007f(c)$.

Evaluate $ \int_0^{2008} \left(3x^2 \minus{} 8028x \plus{} 2007^2 \plus{} \frac {1}{2008}\right)\ dx$.

Let $ABC$ be a triangle. Let $M$ be a variable point interior to the segment $AB$, and let $\gamma_B$ be the circle through $M$ and tangent at $B$ to $BC$. Let $P$ and $Q$ be the touch points of $\gamma_B$ and its tangents from $A$, and let $X$ be the midpoint of the segment $PQ$. Similarly, let $N$ be a variable point interior to the segment $AC$, and let $\gamma_C$ be the circle through $M$ and tangent at $C$ to $BC$. Let $R$ and $S$ be the touch points of $\gamma_C$ and its tangents from $A$, and let $Y$ be the midpoint of the segment $RS$. Prove that the line through the centers of the circles $AMN$ and $AXY$ passes through a fixed point.

When real numbers $a,\ b$ move satisfying $\int_0^{\pi} (a\cos x+b\sin x)^2dx=1$, find the maximum value of $\int_0^{\pi} (e^x-a\cos x-b\sin x)^2dx.$

Let $\{a_n\}^{\infty}_0$ and $\{b_n\}^{\infty}_0$ be two sequences determined by the recursion formulas \[a_{n+1} = a_n + b_n,\] \[ b_{n+1} = 3a_n + b_n, n= 0, 1, 2, \cdots,\] and the initial values $a_0 = b_0 = 1$. Prove that there exists a uniquely determined constant $c$ such that $n|ca_n-b_n| < 2$ for all nonnegative integers $n$.

Let $ABC$ be a triangle with $AB=13$, $BC=14$, and $CA=15$. Points $P$, $Q$, and $R$ are chosen on segments $BC$, $CA$, and $AB$, respectively, such that triangles $AQR$, $BPR$, $CPQ$ have the same perimeter, which is $\frac{4}{5}$ of the perimeter of $PQR$. What is the perimeter of $PQR$? [i]2021 CCA Math Bonanza Individual Round #2[/i]

Let $F$ be the set of all fractions $m/n$ where $m$ and $n$ are positive integers with $m+n\le 2005$. Find the largest number $a$ in $F$ such that $a < 16/23$.

Find all triples $(a,b,c)$ of real numbers for which there exists a function $f:\mathbb{Z}^{+}\rightarrow\mathbb{Z}^{+}$ satisfying $af(n)+bf(n+1)+cf(n+2)<0$ for every $n\in\mathbb{Z}^{+}$ ($\mathbb{Z}^{+}$ denotes the set of positive integers). Proposed by [i]András Imolay[/i], Budapest

Let $\triangle ABC$ be a right triangle with $\angle A = 90^\circ$ and $AB = 1.$ Let $x$ be the length that $AC$ must be so that the perpendicular bisector of $AC$ is tangent to the incircle of $\triangle ABC.$ Let $y$ be the length that $BC$ must be so that the perpendicular bisector of $BC$ is tangent to the incircle of $\triangle ABC.$ (Note that $x$ and $y$ arise in different triangles.) Then $x+y=\tfrac{m}{n}$ for positive integers $m, n$ with $m,n$ in simplest form. Compute $m + n.$

Determine all real solutions to the system of equations: $$x_1 + x_2 +...+ x_{2004 }= 2004$$ $$x^4_1+ x^4_2+ ... + x^4_{2004} = x^3_1+x^3_2+... + x^3_{2004}$$

Let $(a_n)\subset (\frac{1}{2},1)$. Define the sequence $x_0=0,\displaystyle x_{n+1}=\frac{a_{n+1}+x_n}{1+a_{n+1}x_n}$. Is this sequence convergent? If yes find the limit.

At the round table, $10$ people are sitting, some of them are knights, and the rest are liars (knights always say pride, and liars always lie) . It is clear thath I have at least one knight and at least one liar. What is the largest number of those sitting at the table can say: ''Both of my neighbors are knights '' ? (A statement that is at least partially false is considered false.)