A circle with center $O$ passes through the vertices $A$ and $C$ of the triangle $ABC$ and intersects the segments $AB$ and $BC$ again at distinct points $K$ and $N$ respectively. Let $M$ be the point of intersection of the circumcircles of triangles $ABC$ and $KBN$ (apart from $B$). Prove that $\angle OMB=90^{\circ}$.

Write the number 1997 as the sum of positive integers for which the product is maximal, and prove there's no better solution.

Each of the thirty squares in the diagram below contains a number $0, 1, 2, 3, 4, 5, 6, 7, 8, 9$ of which each number is used exactly three times. The sum of three numbers in three squares on each of the thirteen line segments is equal to $S$. [img]https://cdn.artofproblemsolving.com/attachments/8/0/3e056ebc252aee9ade1f45fd337cc6a2f84302.png[/img]

A [i]fortress[/i] is a finite collection of cells in an infinite square grid with the property that one can pass from any cell of the fortress to any other by a sequence of moves to a cell with a common boundary line (but it can have "holes"). The [i]walls[/i] of a fortress are the unit segments between cells belonging to the fortress and cells not belonging to the fortress. The [i]area[/i] $A$ of a fortress is the number of cells it consists of. The [i]perimeter[/i] $P$ is the total length of its walls. Each cell of the fortress can contain a [i]guard[/i] which can oversee the cells to the top, the bottom, the right and the left of this cell, up until the next wall (it also oversees its own cell). (a) Determine the smallest integer $k$ such that $k$ guards suffice to oversee all cells of any fortress of perimeter $P \le 2024$. (b) Determine the smallest integer $k$ such that $k$ guards suffice to oversee all cells of any fortress of area $A \le 2024$.

To each three-digit number, Matías added the number obtained by inverting its digits. For example, he added $729$ to the number $927$. Calculate in how many cases the result of the sum of Matías is a number with all its digits odd.

How many positive integers $ n$ satisfy the following condition: \[ (130n)^{50} > n^{100} > 2^{200}? \]$ \textbf{(A)}\ 0\qquad \textbf{(B)}\ 7\qquad \textbf{(C)}\ 12\qquad \textbf{(D)}\ 65\qquad \textbf{(E)}\ 125$

For positive integer $n$ we define $f(n)$ as sum of all of its positive integer divisors (including $1$ and $n$). Find all positive integers $c$ such that there exists strictly increasing infinite sequence of positive integers $n_1, n_2,n_3,...$ such that for all $i \in \mathbb{N}$ holds $f(n_i)-n_i=c$

Solve the equation $5^x7^y+4=3^z$ in nonnegative integers.

Given $a,b,c \in\mathbb{R}^+$, and that $a^2+b^2+c^2=3$. Prove that \[ \frac{1}{a^3+2}+\frac{1}{b^3+2}+\frac{1}{c^3+2}\ge 1 \]

Let $\triangle ABC$ be an acute-angled triangle. Let $P$ be the midpoint of $BC$, and $K$ the foot of the altitude from $A$ to side $BC$. Let $D$ be a point on segment $AP$ such that $\angle BDC = 90^\circ$. Let $E$ be the second point of intersection of line $BC$ with the circumcircle of $\triangle ADK$. Let $F$ be the second point of intersection of line $AE$ with the circumcircle of $\triangle ABC$. Prove that $\angle AFD = 90^\circ$.

Let $a,b,c$ be integers larger than $1$. Prove that \[a(a-1)+b(b-1)+c(c-1)\le (a+b+c-4)(a+b+c-5)+4.\]

23) A spring has a length of 1.0 meter when there is no tension on it. The spring is then stretched between two points 10 meters apart. A wave pulse travels between the two end points in the spring in a time of 1.0 seconds. The spring is now stretched between two points that are 20 meters apart. The new time it takes for a wave pulse to travel between the ends of the spring is closest to which of the following? A) 0.5 seconds B) 0.7 seconds C) 1 second D) 1.4 seconds E) 2 seconds

Find a number $n \geq 9$ such that for any $n$ numbers, not necessarily distinct, $a_1,a_2, \ldots , a_n$, there exists 9 numbers $a_{i_1}, a_{i_2}, \ldots , a_{i_9}, (1 \leq i_1 < i_2 < \ldots < i_9 \leq n)$ and $b_i \in {4,7}, i =1, 2, \ldots , 9$ such that $b_1a_{i_1} + b_2a_{i_2} + \ldots + b_9a_{i_9}$ is a multiple of 9.

Determine all monic polynomials $P(x)$ of degree $3$ with coefficients integers, which are divisible by $x-1$, when divided by $ x-5$ leave the same remainder as when divided by$ x+5$ and have a root between $2$ and $3$.

For each sequence of $n$ zeros and $n$ units, we assign a number that is a number sections of the same digits in it. (For example, sequence $00111001$ has $4$ such sections $00, 111,00, 1$.) For a given $n$ we sum up all the numbers assigned to each such sequence. Prove that the sum total is equal to $(n+1){2n \choose n} $

Let $n \geq 3$ be an integer. A labelling of the $n$ vertices, the $n$ sides and the interior of a regular $n$-gon by $2n + 1$ distinct integers is called [i]memorable[/i] if the following conditions hold: (a) Each side has a label that is the arithmetic mean of the labels of its endpoints. (b) The interior of the $n$-gon has a label that is the arithmetic mean of the labels of all the vertices. Determine all integers $n \geq 3$ for which there exists a memorable labelling of a regular $n$-gon consisting of $2n + 1$ consecutive integers.

Let $\Gamma_{1}$ be a circle. $AB$ is a diameter, $\ell$ is the tangent at $B$, and $M$ is a point on $\Gamma_{1}$ other than $A$. $\Gamma_{2}$ is a circle tangent to $\ell$, and also to $\Gamma_{1}$ at $M$. a) Determine the point of tangency $P$ of $\ell$ and $\Gamma_{2}$ and find the locus of the center of $\Gamma_{2}$ as $M$ varies. b) Show that there exists a circle that is always orthogonal to $\Gamma_{2}$, regardless of the position of $M$.

A sequence $y_1, y_2, \ldots, y_k$ of real numbers is called $\textit{zigzag}$ if $k=1$, or if $y_2-y_1, y_3-y_2, \ldots, y_k-y_{k-1}$ are nonzero and alternate in sign. Let $X_1, X_2, \ldots, X_n$ be chosen independently from the uniform distribution on $[0,1]$. Let $a\left(X_1, X_2, \ldots, X_n\right)$ be the largest value of $k$ for which there exists an increasing sequence of integers $i_1, i_2, \ldots, i_k$ such that $X_{i_1}, X_{i_2}, \ldots X_{i_k}$ is zigzag. Find the expected value of $a\left(X_1, X_2, \ldots, X_n\right)$ for $n \geq 2$.

A circle $k$ and a point $A$ outside it are given in the plane. Prove that all trapezoids, whose non-parallel sides meet at $A$, have the same intersection of diagonals.

How many ways can you arrange $3$ Alice’s, $1$ Bob, $3$ Chad’s, and $1$ David in a line if the Alice’s are all indistinguishable, the Chad’s are all indistinguishable, and Bob and David want to be adjacent to each other? (In other words, how many ways can you arrange $3$ A’s, $1$ B, $3$ C’s, and $1$ D in a row where the B and D are adjacent?)

Let $ x_1$, $ x_2$, $ \ldots$, $ x_n$ be real numbers satisfying the conditions: \[ \left\{\begin{array}{cccc} |x_1 \plus{} x_2 \plus{} \cdots \plus{} x_n | & \equal{} & 1 & \ \\ |x_i| & \leq & \displaystyle \frac {n \plus{} 1}{2} & \ \textrm{ for }i \equal{} 1, 2, \ldots , n. \end{array} \right. \] Show that there exists a permutation $ y_1$, $ y_2$, $ \ldots$, $ y_n$ of $ x_1$, $ x_2$, $ \ldots$, $ x_n$ such that \[ | y_1 \plus{} 2 y_2 \plus{} \cdots \plus{} n y_n | \leq \frac {n \plus{} 1}{2}. \]

Find all natural numbers $n$ such that $1+[\sqrt{2n}]~$ divides $2n$. ( For any real number $x$ , $[x]$ denotes the largest integer not exceeding $x$. )

Given $m,n\in\mathbb N_+,$ define $$S(m,n)=\left\{(a,b)\in\mathbb N_+^2\mid 1\leq a\leq m,1\leq b\leq n,\gcd (a,b)=1\right\}.$$ Prove that: for $\forall d,r\in\mathbb N_+,$ there exists $m,n\in\mathbb N_+,m,n\geq d$ and $\left|S(m,n)\right|\equiv r\pmod d.$

Define a function $f: \mathbb N \to \mathbb N$ by $f(1) = 1$, $f(n+1) = f(n) + 2^{f(n)}$ for every positive integer $n$. Prove that $f(1), f(2), \dots, f(3^{2013})$ leave distinct remainders when divided by $3^{2013}$.

How many digits could possibly be the last digit of a perfect square?