Found problems: 5802
You have a $2m$ by $2n$ grid of squares coloured in the same way as a standard checkerboard. Find the total number of ways to place $mn$ counters on white squares so that each square contains at most one counter and no two counters are in diagonally adjacent white squares.
Find all functions $f\colon \mathbb{Q}\to \mathbb{R}_{\geq 0}$ such that for any two rational numbers $x$ and $y$ the following conditions hold
[list]
[*] $f(x+y)\leq f(x)+f(y)$,
[*]$f(xy)=f(x)f(y)$,
[*]$f(2)=1/2$.
[/list]
If $a$ and $b$ are arbitrary positive real numbers and $m$ an integer, prove that
\[\Bigr( 1+\frac ab \Bigl)^m +\Bigr( 1+\frac ba \Bigl)^m \geq 2^{m+1}.\]
Find all one-to-one mappings $f:\mathbb{N}\to\mathbb{N}$ such that for all positive integers $n$ the following relation holds:
\[ f(f(n)) \leq \frac {n+f(n)} 2 . \]
We say that a positive integer $n$ is [i]fantastic[/i] if there exist positive rational numbers $a$ and $b$ such that
$$ n = a + \frac 1a + b + \frac 1b.$$
[b](a)[/b] Prove that there exist infinitely many prime numbers $p$ such that no multiple of $p$ is fantastic.
[b](b)[/b] Prove that there exist infinitely many prime numbers $p$ such that some multiple of $p$ is fantastic.
[i]Proposed by Walther Janous, Austria[/i]
On the Cartesian plane consider the set $V$ of all vectors with integer coordinates. Determine all functions $f : V \rightarrow \mathbb{R}$ satisfying the conditions:
(i) $f(v) = 1$ for each of the four vectors $v \in V$ of unit length.
(ii) $f(v+w) = f(v)+f(w)$ for every two perpendicular vectors $v, w \in V$
(Zero vector is considered to be perpendicular to every vector).
Find all continuous function $f:\mathbb{R}^{\geq 0}\rightarrow \mathbb{R}^{\geq 0}$ such that :
\[f(xf(y))+f(f(y)) = f(x)f(y)+2 \: \: \forall x,y\in \mathbb{R}^{\geq 0}\]
[i]Proposed by Mohammad Ahmadi[/i]
Given a natural number $n\geqslant 2$, find the smallest possible number of edges in a graph that has the following property: for any coloring of the vertices of the graph in $n{}$ colors, there is a vertex that has at least two neighbors of the same color as itself.
Let $g_0 = 1$, $g_1 = 2$, $g_2 = 3$, and $g_n = g_{n-1} + 2g_{n-2} + 3g_{n-3}$. For how many $0 \le i \le 100$ is it that $g_i$ is divisible by $5$?
Find all triples of positive integers $(a,b,p)$ with $a,b$ positive integers and $p$ a prime number such that $2^a+p^b=19^a$
There are eight different symbols designed on $n\geq 2$ different T-shirts. Each shirt contains at least one symbol, and no two shirts contain all the same symbols. Suppose that for any $k$ symbols $(1\leq k\leq 7)$ the number of shirts containing at least one of the $k$ symbols is even. Determine the value of $n$.
Define $f_{0}(x)=e^x$ and $f_{n+1}(x)=x f_{n}'(x)$. Show that $\sum_{n=0}^{\infty} \frac{f_{n}(1)}{n!}=e^e$.
Determine all functions $ f$ defined in the set of rational numbers and taking their values in the same set such that the equation $ f(x + y) + f(x - y) = 2f(x) + 2f(y)$ holds for all rational numbers $x$ and $y$.
Suppose that a sequence $(a_n)_{n=1}^{\infty}$ of integers has the following property: For all $n$ large enough (i.e. $n \ge N$ for some $N$ ), $a_n$ equals the number of indices $i$, $1 \le i < n$, such that $a_i + i \ge n$. Find the maximum possible number of integers which occur infinitely many times in the sequence.
Let $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.
A natural number $n$ is given. Determine all $(n - 1)$-tuples of nonnegative integers $a_1, a_2, ..., a_{n - 1}$ such that
$$\lfloor \frac{m}{2^n - 1}\rfloor + \lfloor \frac{2m + a_1}{2^n - 1}\rfloor + \lfloor \frac{2^2m + a_2}{2^n - 1}\rfloor + \lfloor \frac{2^3m + a_3}{2^n - 1}\rfloor + ... + \lfloor \frac{2^{n - 1}m + a_{n - 1}}{2^n - 1}\rfloor = m$$
holds for all $m \in \mathbb{Z}$.
Let $a,b,c$ be integer numbers such that $(a+b+c) \mid (a^{2}+b^{2}+c^{2})$. Show that there exist infinitely many positive integers $n$ such that $(a+b+c) \mid (a^{n}+b^{n}+c^{n})$.
[i]Laurentiu Panaitopol[/i]
There are $n$ cards. Max and Lewis play, alternately, the following game
Max starts the game, he removes exactly $1$ card, in each round the current player can remove any quantity of cards, from $1$ card to $t+1$ cards, which $t$ is the number of removed cards by the previous player, and the winner is the player who remove the last card. Determine all the possible values of $n$ such that Max has the winning strategy.
In the cabinet 2004 telephones are located; each two of these telephones are connected by a cable, which is colored in one of four colors. From each color there is one cable at least. Can one always select several telephones in such a way that among their pairwise cable connections exactly 3 different colors occur?
The infinite sequence $a_1,a_2,a_3,\ldots$ of positive integers is defined as follows: $a_1=1$, and for each $n \ge 2$, $a_n$ is the smallest positive integer, distinct from $a_1,a_2, \ldots , a_{n-1}$ such that:
$$\sqrt{a_n+\sqrt{a_{n-1}+\ldots+\sqrt{a_2+\sqrt{a_1}}}}$$
is an integer. Prove that all positive integers appear on the sequence $a_1,a_2,a_3,\ldots$
Consider the sequence $ a_1\equal{}\frac{3}{2}, a_{n\plus{}1}\equal{}\frac{3a_n^2\plus{}4a_n\minus{}3}{4a_n^2}.$
$ (a)$ Prove that $ 1<a_n$ and $ a_{n\plus{}1}<a_n$ for all $ n$.
$ (b)$ From $ (a)$ it follows that $ \displaystyle\lim_{n\to\infty}a_n$ exists. Find this limit.
$ (c)$ Determine $ \displaystyle\lim_{n\to\infty}a_1a_2a_3...a_n$.
Let $ \mathbb{N}_0$ denote the set of nonnegative integers. Find all functions $ f$ from $ \mathbb{N}_0$ to itself such that
\[ f(m \plus{} f(n)) \equal{} f(f(m)) \plus{} f(n)\qquad \text{for all} \; m, n \in \mathbb{N}_0.
\]
$A$ and $B$ play a game, given an integer $N$, $A$ writes down $1$ first, then every player sees the last number written and if it is $n$ then in his turn he writes $n+1$ or $2n$, but his number cannot be bigger than $N$. The player who writes $N$ wins. For which values of $N$ does $B$ win?
[i]Proposed by A. Slinko & S. Marshall, New Zealand[/i]
Let $n \geq 2$ be a fixed integer. Find the least constant $C$ such the inequality
\[\sum_{i<j} x_{i}x_{j} \left(x^{2}_{i}+x^{2}_{j} \right) \leq C
\left(\sum_{i}x_{i} \right)^4\]
holds for any $x_{1}, \ldots ,x_{n} \geq 0$ (the sum on the left consists of $\binom{n}{2}$ summands). For this constant $C$, characterize the instances of equality.
Suppose $S= \{1,2,\dots,n\}$ and $n \geq 3$. There is $f:S^k \longmapsto S$ that if $a,b \in S^k$ and $a$ and $b$ differ in all of elements then $f(a) \neq f(b)$. Prove that $f$ is a function of one of its elements.