Found problems: 1782
Consider the set $ S_n$ of all the $ 2^n$ numbers of the type $ 2\pm \sqrt{2 \pm \sqrt {2 \pm ...}},$ where number $ 2$ appears $ n\plus{}1$ times.
$ (a)$ Show that all members of $ S_n$ are real.
$ (b)$ Find the product $ P_n$ of the elements of $ S_n$.
Given a triangle $ABC$ for which $C=90$ degrees, prove that given $n$ points inside it, we can name them $P_1, P_2 , \ldots , P_n$ in some way such that:
$\sum^{n-1}_{k=1} \left( P_K P_{k+1} \right)^2 \leq AB^2$ (the sum is over the consecutive square of the segments from $1$ up to $n-1$).
[i]Edited by orl.[/i]
Let $a$ and $b$ be positive integers such that $ab+1$ divides $a^{2}+b^{2}$. Show that \[\frac{a^{2}+b^{2}}{ab+1}\] is the square of an integer.
Let $n$ be a positive integer. Let $S$ be a subset of points on the plane with these conditions:
$i)$ There does not exist $n$ lines in the plane such that every element of $S$ be on at least one of them.
$ii)$ for all $X \in S$ there exists $n$ lines in the plane such that every element of $S - {X} $ be on at least one of them.
Find maximum of $\mid S\mid$.
[i]Proposed by Erfan Salavati[/i]
Two players in turns color the sides of an $n$-gon. The first player colors any side that has $0$ or $2$ common vertices with already colored sides. The second player colors any side that has exactly $1$ common vertex with already colored sides. The player who cannot move, loses. For which $n$ the second player has a winning strategy?
Let $\mathbb Q$ be the set of all rational numbers and $\mathbb R$ be the set of real numbers. Function $f: \mathbb Q \to \mathbb R$ satisfies the following conditions:
(i) $f(0) = 0$, and for any nonzero $a \in Q, f(a) > 0.$
(ii) $f(x + y) = f(x)f(y) \qquad \forall x,y \in \mathbb Q.$
(iii) $f(x + y) \leq \max\{f(x), f(y)\} \qquad \forall x,y \in \mathbb Q , x,y \neq 0.$
Let $x$ be an integer and $f(x) \neq 1$. Prove that $f(1 + x + x^2+ \cdots + x^n) = 1$ for any positive integer $n.$
Fix an integer $k>2$. Two players, called Ana and Banana, play the following game of numbers. Initially, some integer $n \ge k$ gets written on the blackboard. Then they take moves in turn, with Ana beginning. A player making a move erases the number $m$ just written on the blackboard and replaces it by some number $m'$ with $k \le m' < m$ that is coprime to $m$. The first player who cannot move anymore loses.
An integer $n \ge k $ is called good if Banana has a winning strategy when the initial number is $n$, and bad otherwise.
Consider two integers $n,n' \ge k$ with the property that each prime number $p \le k$ divides $n$ if and only if it divides $n'$. Prove that either both $n$ and $n'$ are good or both are bad.
Find all surjective functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $m,n\in \mathbb{N}$: \[m \vert n \Longleftrightarrow f(m) \vert f(n).\]
Let $p(k)$ be the smallest prime not dividing $k$. Put $q(k) = 1$ if $p(k) = 2$, or the product of all primes $< p(k)$ if $p(k) > 2$. Define the sequence $x_0, x_1, x_2, ...$ by $x_0 = 1$, $x_{n+1} = \frac{x_np(x_n)}{q(x_n)}$. Find all $n$ such that $x_n = 111111$
Let $ n$ be a nonzero positive integer. A set of persons is called a $ n$-balanced set if in any subset of $ 3$ persons there exists at least two which know each other and in each subset of $ n$ persons there are two which don't know each other. Prove that a $ n$-balanced set has at most $ (n \minus{} 1)(n \plus{} 2)/2$ persons.
Find all pairs of positive integers $ (x,y)$ such that
\[ x^y \equal{} y^{x \minus{} y}.
\]
[i]Albania[/i]
Let $x,y$ and $z$ be positive real numbers. Show that $x^2+xy^2+xyz^2\ge 4xyz-4$.
Denote by $S_n$ the group of permutations of the sequence $(1,2,\dots,n).$ Suppose that $G$ is a subgroup of $S_n,$ such that for every $\pi\in G\setminus\{e\}$ there exists a unique $k\in \{1,2,\dots,n\}$ for which $\pi(k)=k.$ (Here $e$ is the unit element of the group $S_n.$) Show that this $k$ is the same for all $\pi \in G\setminus \{e\}.$
we are given $n$ rectangles in the plane. Prove that between $4n$ right angles formed by these rectangles there are at least $[4\sqrt n]$ distinct right angles.
For given integer $n \geq 3$, set $S =\{p_1, p_2, \cdots, p_m\}$ consists of permutations $p_i$ of $(1, 2, \cdots, n)$. Suppose that among every three distinct numbers in $\{1, 2, \cdots, n\}$, one of these number does not lie in between the other two numbers in every permutations $p_i$ ($1 \leq i \leq m$). (For example, in the permutation $(1, 3, 2, 4)$, $3$ lies in between $1$ and $4$, and $4$ does not lie in between $1$ and $2$.) Determine the maximum value of $m$.
Prove that for every positive integer $n$ there exists an $n$-digit number divisible by $5^n$ all of whose digits are odd.
Let $S$ be a set with 2002 elements, and let $N$ be an integer with $0 \leq N \leq 2^{2002}$. Prove that it is possible to color every subset of $S$ either black or white so that the following conditions hold:
(a) the union of any two white subsets is white;
(b) the union of any two black subsets is black;
(c) there are exactly $N$ white subsets.
Let $x_1,x_2,\ldots,x_n$ be real numbers. Prove that
\[ \sum_{i,j=1}^n |x_i+x_j|\geq n\sum_{i=1}^n |x_i| \]
Some checkers placed on an $n \times n$ checkerboard satisfy the following conditions:
(a) every square that does not contain a checker shares a side with one that does;
(b) given any pair of squares that contain checkers, there is a sequence of squares containing checkers, starting and ending with the given squares, such that every two consecutive squares of the sequence share a side.
Prove that at least $(n^{2}-2)/3$ checkers have been placed on the board.
Determine all functions $ f$ from the set of positive integers to the set of positive integers such that, for all positive integers $ a$ and $ b$, there exists a non-degenerate triangle with sides of lengths
\[ a, f(b) \text{ and } f(b \plus{} f(a) \minus{} 1).\]
(A triangle is non-degenerate if its vertices are not collinear.)
[i]Proposed by Bruno Le Floch, France[/i]
A sequence $ (S_n), n \geq 1$ of sets of natural numbers with $ S_1 = \{1\}, S_2 = \{2\}$ and
\[{ S_{n + 1} = \{k \in }\mathbb{N}|k - 1 \in S_n \text{ XOR } k \in S_{n - 1}\}.
\]
Determine $ S_{1024}.$
Find all functions $f: \mathbb{Z}^+\to \mathbb{R}$, which satisfies $f(n+1)\geq f(n)$ for all $n\geq 1$ and $f(mn)=f(m)f(n)$ for all $(m,n)=1$.
Do there exist positive integers $a_1<a_2<\ldots<a_{100}$ such that for $2\le k\le100$, the least common multiple of $a_{k-1}$ and $a_k$ is greater than the least common multiple of $a_k$ and $a_{k+1}$?
Let $n$ be an integer with $n\ge 3$. Consider all dissections of a convex $n$-gon into triangles by $n-3$ non-intersecting diagonals, and all colourings of the triangles with black and white so that triangles with a common side are always of a different colour. Find the least possible number of black triangles.
Prove that: there exists only one function $f:\mathbb{N^*}\to\mathbb{N^*}$ satisfying:
i) $f(1)=f(2)=1$;
ii)$f(n)=f(f(n-1))+f(n-f(n-1))$ for $n\ge 3$.
For each integer $m\ge 2$, find the value of $f(2^m)$.