Peter wants to create a new multiplication table for the four numbers $1, 2, 3, 4$ in such a way that the product of two of them is also one of them. He wants also that $(a\cdot b)\cdot c = a\cdot (b\cdot c)$ holds and that $ab \ne ac$ and $ba \ne ca$ and $b \ne c$. Peter is successful in constructing the new table. In his new table, $1\cdot 3 = 2$ and $2\cdot 2 = 4$. What is the product $3\cdot 1$ according to Peter's table?

Let $M$ be the midpoint of side $BC$ of acute triangle $ABC$. The circle centered at $M$ passing through $A$ intersects the lines $AB$ and $AC$ again at $P$ and $Q$, respectively. The tangents to this circle at $P$ and $Q$ meet at $D$. Prove that the perpendicular bisector of $BC$ bisects segment $AD$.

Is it possible to place $1995$ different natural numbers along a circle so that for any two of these numbers, the ratio of the greatest to the least is a prime? I feel that my solution's wording and notation is awkward (and perhaps unnecessarily complicated), so please feel free to critique it: [hide] Suppose that we do have such a configuration $a_{1},a_{2},...a_{1995}$. WLOG, $a_{2}=p_{1}a_{1}$. Then \[\frac{a_{2}}{a_{3}}= p_{2}, \frac{1}{p_{2}}\] \[\frac{a_{3}}{a_{4}}= p_{3}, \frac{1}{p_{3}}\] \[... \] \[\frac{a_{1995}}{a_{1}}= p_{1995}, \frac{1}{p_{1995}}\] Multiplying these all together, \[\frac{a_{2}}{a_{1}}= \frac{\prod p_{k}}{\prod p_{j}}= p_{1}\] Where $\prod p_{k}$ is some product of the elements in a subset of $\{ p_{2},p_{3}, ...p_{1995}\}$. We clear denominators to get \[p_{1}\prod p_{j}= \prod p_{k}\] Now, by unique prime factorization, the set $\{ p_{j}\}\cup \{ p_{1}\}$ is equal to the set $\{ p_{k}\}$. However, since there are a total of $1995$ primes, this is impossible. We conclude that no such configuration exists. [/hide]

Is $\cos 1^\circ$ rational? Prove.

The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?

A factory produces several types of mug, each with two colors, chosen from a set of six. Every color occurs in at least three different types of mug. Show that we can find three mugs which together contain all six colors.

Solve the following system for real $x,y,z$ \[ \{ \begin{array}{ccc} x+ y -z & =& 4 \\ x^2 - y^2 + z^2 & = & -4 \\ xyz & =& 6. \end{array} \]

Let $m$ and $n$ be positive integers. If $x_1$, $x_2$, $\cdots$, $x_m$ are positive integers whose arithmetic mean is less than $n+1$ and if $y_1$, $y_2$, $\cdots$, $y_n$ are positive integers whose arithmetic mean is less than $m+1$, prove that some sum of one or more $x$'s equals some sum of one or more $y$'s.

Find all non-constant polynomials $P(x)$ with integer coefficients and positive leading coefficient, such that $P^{2mn}(m^2)+n^2$ is a perfect square for all positive integers $m, n$.

Given that $A,B,$ and $C$ are noncollinear points in the plane with integer coordinates such that the distances $AB,AC,$ and $BC$ are integers, what is the smallest possible value of $AB?$

Let $n$ be a positive integer. Let $G (n)$ be the number of $x_1,..., x_n, y_1,...,y_n \in \{0,1\}$, for which the number $x_1y_1 + x_2y_2 +...+ x_ny_n$ is even, and similarly let $U (n)$ be the number for which this sum is odd. Prove that $$\frac{G(n)}{U(n)}= \frac{2^n + 1}{2^n - 1}.$$

a) Let $\{a_n\}_{n=1}^\infty$ is sequence of integers bigger than 1. Proove that if $x>0$ is irrational, then $\ds x_n>\frac{1}{a_{n+1}}$ for infinitely many $n$, where $x_n$ is fractional part of $a_na_{n-1}\dots a_1x$. b)Find all sequences $\{a_n\}_{n=1}^\infty$ of positive integers, for which exist infinitely many $x\in(0,1)$ such that $\ds x_n>\frac{1}{a_{n+1}}$ for all $n$. [i]Nikolai Nikolov, Emil Kolev[/i]

A semicircle is inscribed in a semicircle of radius $2$ as shown. Find the radius of the smaller semicircle. [img]https://cdn.artofproblemsolving.com/attachments/c/1/c60cd40eaecfe417aca46ce4fd386fe22af85b.png[/img]

On the coordinate plane, is there a line family of infinitely many lines $l_1,l_2,\cdots,l_n,\cdots$, satisfying the following? (1) Point$(1,1)\in l_n$ for all $n\in \mathbb{Z}_{+}$. (2) For all $n\in \mathbb{Z}_{+}$,$k_{n+1}=a_n-b_n$, where $k_{n+1}$ is the slope of $l_{n+1}$, $a_n,b_n$ are intercepts of $l_n$ on $x$-axis, $y$-axis. (3) $k_nk_{n+1}\geq0$ for all $n\in \mathbb{Z}_{+}$.

Call a natural number $N$ [i]good [/i]if its base $3$ expansion has no consecutive digits that are the same. For example, $289$ is good since its base $3$ representation is $1012013$. Find the $2024$th smallest good number ($0$ is not considered to be a natural number). Your answer should be in base $10$.

$n$ points are marked on the board points that are vertices of the regular $n$ -gon. One of the points is a chip. Two players take turns moving it to the other marked point and at the same time draw a segment that connects them. If two points already connected by a segment, such a move is prohibited. A player who can't make a move, lose. Which of the players can guarantee victory?