Found problems: 5802
For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A [i]tromino[/i] is an $L$-shape formed by three connected unit squares.
$(a)$ For which values of $n$ is it possible to cover all the black squares with non-overlapping trominoes lying entirely on the chessboard?
$(b)$ When it is possible, find the minimum number of trominoes needed.
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). \]
Let $x_1, x_2, \dots, x_n$ be different real numbers. Prove that
\[\sum_{1 \leqslant i \leqslant n} \prod_{j \neq i} \frac{1-x_{i} x_{j}}{x_{i}-x_{j}}=\left\{\begin{array}{ll}
0, & \text { if } n \text { is even; } \\
1, & \text { if } n \text { is odd. }
\end{array}\right.\]
Let $n>1$ be a positive integer. Each unit square in an $n\times n$ grid of squares is colored either black or white,
such that the following conditions hold:
$\bullet$ Any two black squares can be connected by a sequence of black squares where every two consecutive squares in the sequence share an edge;
$\bullet$ Any two white squares can be connected by a sequence of white squares where every two consecutive squares in the sequence share an edge;
$\bullet$ Any $2\times 2$ subgrid contains at least one square of each color.
Determine, with proof, the maximum possible difference between the number of black squares and white squares in this grid (in terms of $n$).
Define a sequence of integers by $a_0=1$ , and $a_n=\sum_{k=0}^{n-1} \binom{n}{k}a_k$ , $n \geq 1$ . Let $m$ be a positive integer , let $p$ be a prime , and let $q$ and $r$ be non-negative integers . Prove that :
$$a_{p^mq+r} \equiv a_{p^{m-1}q+r} \pmod{p^m}$$
The sequence $(a_n)$ is determined by $a_1 = 0$ and
$(n+1)^3a_{n+1} = 2n^2(2n+1)a_n+2(3n+1)$ for $n \geq 1$.
Prove that infinitely many terms of the sequence are positive integers.
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.
Find all funtions $f : Z_{>0} \to Z_{>0}$ that satisfy $f(f(f(n))) + f(f(n)) + f(n) = 3n$ for all $n \in Z_{>0}$ .
$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$
$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$).
Let $a_1,a_2,\cdots$ be an infinity sequence of positive integers such that $a_1=2021$ and
$$a_{n+1}=(a_1+a_2+\cdots+a_n)^2-1$$
for all positive integers $n$. Prove that for any integer $n\ge 2$, $a_n$ is the product of at least $2n$ (not necessarily distinct) primes.
Find all odd natural numbers $n$ such that $d(n)$ is the largest divisor of the number $n$ different from $n$.
($d(n)$ is the number of divisors of the number n including $1$ and $n$ ).
Denote by $[a, b]$ the least common multiple of $a$ and $b$.
Let $n$ be a positive integer such that $[n, n + 1] > [n, n + 2] >...> [n, n + 35]$. Prove that $[n, n + 35] > [n,n + 36]$.
Determine all functions $ f: \mathbb{N} \rightarrow \mathbb{N}$ which satisfy:
$ f(x\plus{}f(y))\equal{}f(x)\plus{}y$ for all $ x,y \in \mathbb{N}$.
Find all functions $f\colon \mathbb{R} \rightarrow \mathbb{R}$ such that for all $x,y \in \mathbb{R}$,
\[f(x+yf(x))+y = xy + f(x+y).\]
[i]Proposed by Giannis Galamatis, Greece[/i]
A positive integer $d$ and a permutation of positive integers $a_1,a_2,a_3,\dots$ is given such that for all indices $i\geq 10^{100}$, $|a_{i+1}-a_{i}|\leq 2d$ holds. Prove that there exists infinity many indices $j$ such that $|a_j -j|< d$.
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)
Every member, starting from the third one, of two sequences $\{a_n\}$ and $\{b_n\}$ equals to the sum of two preceding ones. First members are: $a_1 = 1, a_2 = 2, b_1 = 2, b_2 = 1$. How many natural numbers are encountered in both sequences (may be on the different places)?
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.
Find all functions $f : \mathbb{R} \to \mathbb{R}$ such that for any real $x, y$ holds equality
$$f(xf(y)) + f(xy) = 2f(x)y$$
[i]Proposed by Arseniy Nikolaev[/i]
$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]
In a plane a set of $n\geq 3$ points is given. Each pair of points is connected by a segment. Let $d$ be the length of the longest of these segments. We define a diameter of the set to be any connecting segment of length $d$. Prove that the number of diameters of the given set is at most $n$.
Find all positive integers $n$ for which $$3x^n + n(x + 2) - 3 \geq nx^2$$ holds for all real numbers $x.$