A swimmer is standing at a corner of a square swimming pool. She swims at a fixed speed and runs at a fixed speed (possibly different). No time is taken entering or leaving the pool. What path should she follow to reach the opposite corner of the pool in the shortest possible time?

BdMO National 2018 Higher Secondary P2 $AB$ is a diameter of a circle and $AD$ & $BC$ are two tangents of that circle.$AC$ & $BD$ intersect on a point of the circle.$AD=a$ & $BC=b$.If $a\neq b$ then $AB=?$

A $(3n + 1) \times (3n + 1)$ table $(n \in \mathbb{N})$ is given. Prove that deleting any one of its squares yields a shape cuttable into pieces of the following form and its rotations: ''L" shape formed by cutting one square from a $2 \times 2$ squares.

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$.

Find all $n$ such that there is a real polynomial $f(x)$ of degree $n$ such that $f(x) \ge f'(x)$ for all real $x$.

We call a positive integer $n$ $\textit{sixish}$ if $n=p(p+6)$, where $p$ and $p+6$ are prime numbers. For example, $187=11\cdot17$ is sixish, but $475=19\cdot25$ is not sixish. Define a function $f$ on the positive integers such that $f(n)$ is the sum of the squares of the positive divisors of $n$. For example, $f(10)=1^2+2^2+5^2+10^2=130$. (a) Find, with proof, an irreducible polynomial function $g(x)$ with integer coefficients such that $f(n)=g(n)$ for all sixish $n$. ("Irreducible" means that $g(x)$ cannot be factored as the product of two polynomials of smaller degree with integer coefficients.) (b) We call a positive integer $n$ $\textit{pseudo-sixish}$ if $n$ is not sixish but nonetheless $f(n)=g(n)$, where $g(n)$ is the polynomial function that you found in part (a). Find, with proof, all pseudo-sixish positive integers.

Let $\mathbb{Q}$ be the set of rational numbers. A function $f: \mathbb{Q} \to \mathbb{Q}$ is called aquaesulian if the following property holds: for every $x,y \in \mathbb{Q}$, \[ f(x+f(y)) = f(x) + y \quad \text{or} \quad f(f(x)+y) = x + f(y). \] Show that there exists an integer $c$ such that for any aquaesulian function $f$ there are at most $c$ different rational numbers of the form $f(r) + f(-r)$ for some rational number $r$, and find the smallest possible value of $c$.

The radius $R$ of a cylindrical box is $8$ inches, the height $H$ is $3$ inches. The volume $V = \pi R^2H$ is to be increased by the same fixed positive amount when $R$ is increased by $x$ inches as when $H$ is increased by $x$ inches. This condition is satisfied by: $ \textbf{(A)}\ \text{no real value of} \text{ } x\qquad$ $\textbf{(B)}\ \text{one integral value of} \text{ } x\qquad$ $\textbf{(C)}\ \text{one rational, but not integral, value of} \text{ } x\qquad$ $\textbf{(D)}\ \text{one irrational value of} \text{ } x\qquad$ $\textbf{(E)}\ \text{two real values of} \text{ } x $

Let the incircle $\gamma$ of triangle $ABC$ be tangent to $BA, BC$ at $D, E$, respectively. A tangent $t$ to $\gamma$ , distinct from the sidelines, intersects the line $AB$ at $M$. If lines $CM, DE$ meet at$ K$, prove that lines $AK,BC$ and $t$ are parallel or concurrent. Michel Bataille , France

Compute the number of triples $(f,g,h)$ of permutations on $\{1,2,3,4,5\}$ such that \begin{align*} & f(g(h(x))) = h(g(f(x))) = g(x) \\ & g(h(f(x))) = f(h(g(x))) = h(x), \text{ and } \\ & h(f(g(x))) = g(f(h(x))) = f(x), \\ \end{align*} for all $x\in \{1,2,3,4,5\}$.

For any 2 convex polygons $S$ and $T$, if all the vertices of $S$ are vertices of $T$, call $S$ a sub-polygon of $T$. [b]I. [/b]Prove that for an odd number $n \geq 5$, there exists $m$ sub-polygons of a convex $n$-gon such that they do not share any edges, and every edge and diagonal of the $n$-gon are edges of the $m$ sub-polygons. [b]II.[/b] Find the smallest possible value of $m$.

For a given integer $n \ge 2$, find the maximum possible value of $V_n = \sin x_1 \cos x_2 +\sin x_2 \cos x_3 +...+\sin x_n \cos x_1$, where $x_1,x_2,...,x_n$ are real numbers.

Let $N$ be a positive integer whose decimal representation contains $11235$ as a contiguous substring, and let $k$ be a positive integer such that $10^k>N$. Find the minimum possible value of \[\dfrac{10^k-1}{\gcd(N,10^k-1)}.\]

$n\ge 2 $ is an integer.Prove that the number of natural numbers $m$ so that $0 \le m \le n^2-1,x^n+y^n \equiv m (mod n^2)$ has no solutions is at least $\binom{n}{2}$

For a given positive integer number $n$ find all subsets $\{r_0,r_1,\cdots,r_n\}\subset \mathbb{N}$ such that $$ n^n+n^{n-1}+\cdots+1 | n^{r_n}+\cdots+ n^{r_0}. $$ Proposed by [i]Shayan Tayefeh[/i]