Found problems: 1782
Suppose $\alpha_i > 0, \beta_i > 0$ for $1 \leq i \leq n, n > 1$ and that \[ \sum^n_{i=1} \alpha_i = \sum^n_{i=1} \beta_i = \pi. \] Prove that \[ \sum^n_{i=1} \frac{\cos(\beta_i)}{\sin(\alpha_i)} \leq \sum^n_{i=1} \cot(\alpha_i). \]
Numbers $d(n,m)$, with $m, n$ integers, $0 \leq m \leq n$, are defined by $d(n, 0) = d(n, n) = 0$ for all $n \geq 0$ and
\[md(n,m) = md(n-1,m)+(2n-m)d(n-1,m-1) \text{ for all } 0 < m < n.\]
Prove that all the $d(n,m)$ are integers.
$k$ is a positive integer. The sequence $a_1, a_2, a_3, ...$ is defined by $a_1 = k+1$, $a_{n+1} = a_n ^2 - ka_n + k$. Show that $a_m$ and $a_n$ are coprime (for $m \not = n$).
Prove that in a plane, arbitrary $ n$ points can be overlapped by discs that the sum of all the diameters is less than $ n$, and the distances between arbitrary two are greater than $ 1$. (where the distances between two discs that have no common points are defined as that the distances between its centers subtract the sum of its radii; the distances between two discs that have common points are zero)
A polynomial $ f(x)\equal{}ax^4\plus{}bx^3\plus{}cx^2\plus{}dx$ with $ a,b,c,d>0$ is such that $ f(x)$ is an integer for $ x \in \{ \minus{}2,\minus{}1,0,1,2 \}$ and $ f(1)\equal{}1$ and $ f(5)\equal{}70$.
$ (a)$ Show that $ a\equal{}\frac{1}{24}, b\equal{}\frac{1}{4},c\equal{}\frac{11}{24},d\equal{}\frac{1}{4}$.
$ (b)$ Prove that $ f(x)$ is an integer for all $ x \in \mathbb{Z}$.
A $m \times n$ table is filled with signs $"+"$ and $"-"$. A table is called irreducible if one cannot reduce it to the table filled with $"+"$, applying the following operations (as many times as one wishes).
$a)$ It is allowed to flip all the signs in a row or in a column. Prove that an irreducible table contains an irreducible $2\times 2$ sub table.
$b)$ It is allowed to flip all the signs in a row or in a column or on a diagonal (corner cells are diagonals of length $1$). Prove that an irreducible table contains an irreducible $4\times 4$ sub table.
$f: \mathbb R^{n}\longrightarrow\mathbb R^{n}$ is a bijective map, that Image of every $n-1$-dimensional affine space is a $n-1$-dimensional affine space.
1) Prove that Image of every line is a line.
2) Prove that $f$ is an affine map. (i.e. $f=goh$ that $g$ is a translation and $h$ is a linear map.)
A sequence of real numbers $\{a_n\}_n$ is called a [i]bs[/i] sequence if $a_n = |a_{n+1} - a_{n+2}|$, for all $n\geq 0$. Prove that a bs sequence is bounded if and only if the function $f$ given by $f(n,k)=a_na_k(a_n-a_k)$, for all $n,k\geq 0$ is the null function.
[i]Mihai Baluna - ISL 2004[/i]
Determine for which positive integers $ k$ the set \[ X \equal{} \{1990, 1990 \plus{} 1, 1990 \plus{} 2, \ldots, 1990 \plus{} k\}\] can be partitioned into two disjoint subsets $ A$ and $ B$ such that the sum of the elements of $ A$ is equal to the sum of the elements of $ B.$
Let $n$ be a positive integer, and let $A$ be a subset of $\{ 1,\cdots ,n\}$. An $A$-partition of $n$ into $k$ parts is a representation of n as a sum $n = a_1 + \cdots + a_k$, where the parts $a_1 , \cdots , a_k $ belong to $A$ and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set $\{ a_1 , a_2 , \cdots , a_k \} $.
We say that an $A$-partition of $n$ into $k$ parts is optimal if there is no $A$-partition of $n$ into $r$ parts with $r<k$. Prove that any optimal $A$-partition of $n$ contains at most $\sqrt[3]{6n}$ different parts.
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.
Let $S$ be the set of all rational numbers expressible in the form \[\frac{(a_1^2+a_1-1)(a_2^2+a_2-1)\ldots (a_n^2+a_n-1)}{(b_1^2+b_1-1)(b_2^2+b_2-1)\ldots (b_n^2+b_n-1)}\] for some positive integers $n, a_1, a_2 ,\ldots, a_n, b_1, b_2, \ldots, b_n$. Prove that there is an infinite number of primes in $S$.
Find all functions $f:\mathbb{R}^+\to\mathbb{R}^+$ such that whenever $a>b>c>d>0$ and $ad=bc$,
\[f(a+d)+f(b-c)=f(a-d)+f(b+c).\]
[i]Calvin Deng.[/i]
A $(2^n - 1) \times (2^n +1)$ board is to be divided into rectangles with sides parallel to the sides of the board and integer side lengths such that the area of each rectangle is a power of 2. Find the minimum number of rectangles that the board may be divided into.
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}$.
The game of circulate is played with a deck of $kn$ cards each with a number in $1,2,\ldots,n$ such that there are $k$ cards with each number. First, $n$ piles numbered $1,2,\ldots,n$ of $k$ cards each are dealt out face down. The player then flips over a card from pile $1$, places that card face up at the bottom of the pile, then next flips over a card from the pile whose number matches the number on the card just flipped. The player repeats this until he reaches a pile in which every card has already been flipped and wins if at that point every card has been flipped. Hamster has grown tired of losing every time, so he decides to cheat. He looks at the piles beforehand and rearranges the $k$ cards in each pile as he pleases. When can Hamster perform this procedure such that he will win the game?
[i]Brian Hamrick.[/i]
We call a sequence of integers a [i]Fibonacci-type sequence[/i] if it is infinite in both ways and $a_{n}=a_{n-1}+a_{n-2}$ for any $n\in\mathbb{Z}$. How many [i]Fibonacci-type sequences[/i] can we find, with the property that in these sequences there are two consecutive terms, strictly positive, and less or equal than $N$ ? (two sequences are considered to be the same if they differ only by shifting of indices)
[i]Proposed by I. Pevzner[/i]
Does there exist a convex pentagon, all of whose vertices are lattice points in the plane, with no lattice point in the interior?
Let $D$ be the set of positive reals different from $1$ and let $n$ be a positive integer.
If for $f: D\rightarrow \mathbb{R}$ we have $x^n f(x)=f(x^2)$,
and if $f(x)=x^n$ for $0<x<\frac{1}{1989}$ and for $x>1989$,
then prove that $f(x)=x^n$ for all $x \in D$.
In the following, a [i]word[/i] will mean a finite sequence of letters "$a$" and "$b$". The [i]length[/i] of a word will mean the number of the letters of the word. For instance, $abaab$ is a word of length $5$. There exists exactly one word of length $0$, namely the empty word.
A word $w$ of length $\ell$ consisting of the letters $x_1$, $x_2$, ..., $x_{\ell}$ in this order is called a [i]palindrome[/i] if and only if $x_j=x_{\ell+1-j}$ holds for every $j$ such that $1\leq j\leq\ell$. For instance, $baaab$ is a palindrome; so is the empty word.
For two words $w_1$ and $w_2$, let $w_1w_2$ denote the word formed by writing the word $w_2$ directly after the word $w_1$. For instance, if $w_1=baa$ and $w_2=bb$, then $w_1w_2=baabb$.
Let $r$, $s$, $t$ be nonnegative integers satisfying $r + s = t + 2$. Prove that there exist palindromes $A$, $B$, $C$ with lengths $r$, $s$, $t$, respectively, such that $AB=Cab$, if and only if the integers $r + 2$ and $s - 2$ are coprime.
Find all functions $f: \mathbb{N}_{0}\to \mathbb{N}_{0}$ such that for all $n\in \mathbb{N}_{0}$: \[f(m+f(n))=f(f(m))+f(n).\]
Prove that for all integers $n \geq 3$, there exist odd positive integers $x$, $y$ such that $7x^2 + y^2 = 2^n$.
Let $x_1$, ... , $x_{n+1} \in [0,1] $ and $x_1=x_{n+1} $. Prove that \[ \prod_{i=1}^{n} (1-x_ix_{i+1}+x_i^2)\ge 1. \]
A. Khrabrov, F. Petrov
Assume real numbers $a_i,b_i\,(i=0,1,\cdots,2n)$ satisfy the following conditions:
(1) for $i=0,1,\cdots,2n-1$, we have $a_i+a_{i+1}\geq 0$;
(2) for $j=0,1,\cdots,n-1$, we have $a_{2j+1}\leq 0$;
(2) for any integer $p,q$, $0\leq p\leq q\leq n$, we have $\sum_{k=2p}^{2q}b_k>0$.
Prove that $\sum_{i=0}^{2n}(-1)^i a_i b_i\geq 0$, and determine when the equality holds.
Let $k$ be a positive integer. Prove that one can partition the set $\{ 0,1,2,3, \cdots ,2^{k+1}-1 \}$ into two disdinct subsets $\{ x_1,x_2, \cdots, x_{2k} \}$ and $\{ y_1, y_2, \cdots, y_{2k} \}$ such that $\sum_{i=1}^{2^k} x_i^m =\sum_{i=1}^{2^k} y_i^m$ for all $m \in \{ 1,2, \cdots, k \}$.