In the interior of an ellipse with major axis 2 and minor axis 1, there are more than 6 segments with total length larger than 15. Prove that there exists a line passing through all of the segments.

Let $m\ge 2$ be an integer. Find the smallest positive integer $n>m$ such that for any partition with two classes of the set $\{ m,m+1,\ldots ,n \}$ at least one of these classes contains three numbers $a,b,c$ (not necessarily different) such that $a^b=c$. [i]Ciprian Manolescu[/i]

find all functions $f:\mathbb{N}\rightarrow\mathbb{N}$ st $f(f(m)+f(n))=m+n \,\forall m,n\in\mathbb{N}$ related: https://artofproblemsolving.com/community/c6h381298

Define $ \{ a_n \}_{n\equal{}1}$ as follows: $ a_1 \equal{} 1989^{1989}; \ a_n, n > 1,$ is the sum of the digits of $ a_{n\minus{}1}$. What is the value of $ a_5$?

Find all continuously differentiable functions $f:[0,1]\to(0,\infty)$ such that $\frac{f(1)}{f(0)}=e$ and $$\int^1_0\frac{\text dx}{f(x)^2}+\int^1_0f'(x)^2\text dx\le2.$$

Determine all functions $f: \mathbb{R} \backslash \{0 \} \rightarrow \mathbb{R}$ such that, for all nonzero $x$: $$ f(\frac{1}{x}) \ge 1 -f(x) \ge x^2f(x) $$

Matt is asked to write the numbers from 1 to 10 in order, but he forgets how to count. He writes a permutation of the numbers $\{1, 2, 3\ldots , 10\}$ across his paper such that: [list] [*]The leftmost number is 1. [*]The rightmost number is 10. [*]Exactly one number (not including 1 or 10) is less than both the number to its immediate left and the number to its immediate right.[/list] How many such permutations are there?

Find the maximum number of positive integers such that any two of them $a, b$ (with $a \ne b$) satisfy that$ |a - b| \ge \frac{ab}{100} .$

For an odd prime $ p, $ show that $ \sum_{k=1}^{p-1} \frac{k^p-k}{p}\equiv \frac{1+p}{2}\pmod p . $

Let $ABCD$ be a convex quadrilateral inscribed in a circle with $M$ and $N$ the midpoints of the diagonals $AC$ and $BD$ respectively. Suppose that $AC$ bisects $\angle BMD$. Prove that $BD$ bisects $\angle ANC$.

For positive integer $n$, define $S_n$ to be the minimum value of the sum \[ \sum_{k=1}^n \sqrt{(2k-1)^2+a_k^2}, \] where $a_1,a_2,\ldots,a_n$ are positive real numbers whose sum is 17. There is a unique positive integer $n$ for which $S_n$ is also an integer. Find this $n$.

Let $\mathcal{P}$ be a partition of $\{1,2,\dots ,2024\}$ into sets of two elements, such that for any $\{a,b\}\in\mathcal{P}$, either $|a-b|=1$ or $|a-b|=506$. Suppose that $\{1518,1519\}\in\mathcal{P}$. Determine the pair of $505$ in the partition.

In circle $\theta_1$ with radius $1$, circles $\phi_1, \phi_2, \dots, \phi_8$, with equal radii, are drawn such that for $1 \le i \le 8$, $\phi_i$ is tangent to $\omega_1$, $\phi_{i-1}$, and $\phi_{i+1}$, where $\phi_0 = \phi_8$ and $\phi_1 = \phi_9$. There exists a circle $\omega_2$ such that $\omega_1 \neq \omega_2$ and $\omega_2$ is tangent to $\phi_i$ for $1 \le i \le 8$. The radius of $\omega_2$ can be expressed in the form $a - b\sqrt{c} -d\sqrt{e - \sqrt{f}} + g \sqrt{h - j \sqrt{k}}$ such that $a, b, \dots, k$ are positive integers and the numbers $e, f, k, \gcd(h, j)$ are squarefree. What is $a+b+c+d+e+f+g+h+j+k$. [i]Proposed by Eugene Chen [/i]

In $ ABC$ we have $ AB \equal{} 25$, $ BC \equal{} 39$, and $ AC \equal{} 42$. Points $ D$ and $ E$ are on $ AB$ and $ AC$ respectively, with $ AD \equal{} 19$ and $ AE \equal{} 14$. What is the ratio of the area of triangle $ ADE$ to the area of quadrilateral $ BCED$? $ \textbf{(A)}\ \frac{266}{1521}\qquad \textbf{(B)}\ \frac{19}{75}\qquad \textbf{(C)}\ \frac{1}{3}\qquad \textbf{(D)}\ \frac{19}{56}\qquad \textbf{(E)}\ 1$

Denote $U$ as the set of $20$ diagonals of the regular polygon $P_1P_2P_3P_4P_5P_6P_7P_8$. Find the number of sets $S$ which satisfies the following conditions. 1. $S$ is a subset of $U$. 2. If $P_iP_j \in S$ and $P_j P_k \in S$, and $i \neq k$, $P_iP_k \in S$.

If $x$ cows give $x+1$ cans of milk in $x+2$ days, how many days will it take $x+3$ cows to give $x+5$ cans of milk? $\textbf{(A) }\frac{x(x+2)(x+5)}{(x+1)(x+3)}\qquad\textbf{(B) }\frac{x(x+1)(x+5)}{(x+2)(x+3)}\qquad$ $\textbf{(C) }\frac{(x+1)(x+3)(x+5)}{x(x+2)}\qquad\textbf{(D) }\frac{(x+1)(x+3)}{x(x+2)(x+5)}\qquad \textbf{(E) }\text{none of these}$

Let $n$ and $t$ be positive integers. What is the number of ways to place $t$ dominoes $(1\times 2$ or $2\times 1$ rectangles) in a $2\times n$ table so that there is no $2\times 2$ square formed by $2$ dominoes and each $2\times 3$ rectangle either does not have a horizontal domino in the middle and last cell in the first row or does not have a horizontal domino in the first and middle cell in the second row (or both)?

Find all integers $a,b,c $ such that $a+b+c=abc$

In the adjoining figure, CDE is an equilateral triangle and ABCD and DEFG are squares. The measure of $\angle GDA$ is $\text{(A)} \ 90^\circ \qquad \text{(B)} \ 105^\circ \qquad \text{(C)} \ 120^\circ \qquad \text{(D)} \ 135^\circ \qquad \text{(E)} \ 150^\circ$ [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair D=origin, C=D+dir(240), E=D+dir(300), F=E+dir(30), G=D+dir(30), A=D+dir(150), B=C+dir(150); draw(E--D--G--F--E--C--D--A--B--C); pair point=(0,0.5); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(-15)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); label("$G$", G, dir(point--G));[/asy]

The Fibonacci sequence $F_n$ is defined by $F_0=0,F_1=1$ and the recurrence relation $F_n=F_{n-1}+F_{n-2}$ for all integers $n\geq2$. Let $p\geq3$ be a prime number. [list=a] [*] Prove that $F_{p-1}+F_{p+1}-1$ is divisible by $p$. [*] Prove that $F_{p^{k+1}-1}+F_{p^{k+1}+1}-\left(F_{p^k-1}+F_{p^k+1}\right)$ is divisible by $p^{k+1}$ for any positive integer $k$. [/list]

Let $f(x)=a_0x^3+a_1x^2+a_2x+a_3$ be a polynomial with real coefficients ($a_0\ne0$) such that $|f(x)|\le1$ for every $x\in[-1,1]$. Prove that (a) there exist a constant $c$ (one and the same for all polynomials with the given property), for which (b) $|a_0|\le4$. [i]V. Petkov[/i]

Let $0 <a <b$ be two rational numbers. Let $M$ be a set of positive real numbers with the properties: (i) $a \in M$ and $b \in M$; (ii) if $x$ $\in M$ and $y \in M$, then $\sqrt{xy} \in M$. Let $M^*$denote the set of all irrational numbers in $M$. prove that every $c,d$ such that $a <c <d<b$, $M^*$ contains an element $m$ with property $c<m<d$

In triangle $ABC$, find the smallest possible value of $$|(\cot A + \cot B)(\cot B +\cot C)(\cot C + \cot A)|$$

Find all non-negative real numbers $x, y, z$ satisfying $x^2y^2 + 1 = x^2 + xy$, $y^2z^2 + 1 = y^2 + yz$ and $z^2x^2 + 1 = z^2 + xz$.

Find the function $f(x)$ such that \[f(x)^2f\left(\frac{1-x}{x+1}\right) =64x \] for $x\not=0,x\not=1,x\not=-1$.