Found problems: 1782
Find all the functions $ f: \mathbb{N}\rightarrow \mathbb{N}$ such that
\[ 3f(f(f(n))) \plus{} 2f(f(n)) \plus{} f(n) \equal{} 6n, \quad \forall n\in \mathbb{N}.\]
The integers $a_0, a_1, a_2, a_3,\ldots$ are defined as follows:
$a_0 = 1$, $a_1 = 3$, and $a_{n+1} = a_n + a_{n-1}$ for all $n \ge 1$.
Find all integers $n \ge 1$ for which $na_{n+1} + a_n$ and $na_n + a_{n-1}$ share a common factor greater than $1$.
You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.
A student wrote down the following sequence of numbers : the first number is 1, the second number is 2, and after that, each number is obtained by adding together all the previous numbers. Determine the 12th number in the sequence.
Find all roots of the equation :-
$1-\frac{x}{1}+\frac{x(x-1)}{2!} - \cdots +(-1)^n\frac{x(x-1)(x-2)...(x-n+1)}{n!}=0$.
Let $A$ and $B$ points in the plane and $C$ a point in the perpendiclar bisector of $AB$. It is constructed a sequence of points $C_1,C_2,\dots, C_n,\dots$ in the following way: $C_1=C$ and for $n\geq1$, if $C_n$ does not belongs to $AB$, then $C_{n+1}$ is the circumcentre of the triangle $\triangle{ABC_n}$.
Find all the points $C$ such that the sequence $C_1,C_2,\dots$ is defined for all $n$ and turns eventually periodic.
Note: A sequence $C_1,C_2, \dots$ is called eventually periodic if there exist positive integers $k$ and $p$ such that $C_{n+p}=c_n$ for all $n\geq{k}$.
Basketball star Shanille O'Keal's team statistician keeps track of the number, $S(N),$ of successful free throws she has made in her first $N$ attempts of the season. Early in the season, $S(N)$ was less than 80% of $N,$ but by the end of the season, $S(N)$ was more than 80% of $N.$ Was there necessarily a moment in between when $S(N)$ was exactly 80% of $N$?
The functions $f_0, f_1, f_2, ...$ are defined on the reals by $f_0(x) = 8$ for all $x$, $f_{n+1}(x) = \sqrt{x^2 + 6f_n(x)}$. For all $n$ solve the equation $f_n(x) = 2x$.
In Lineland there are $n\geq1$ towns, arranged along a road running from left to right. Each town has a [i]left bulldozer[/i] (put to the left of the town and facing left) and a [i]right bulldozer[/i] (put to the right of the town and facing right). The sizes of the $2n$ bulldozers are distinct. Every time when a left and right bulldozer confront each other, the larger bulldozer pushes the smaller one off the road. On the other hand, bulldozers are quite unprotected at their rears; so, if a bulldozer reaches the rear-end of another one, the first one pushes the second one off the road, regardless of their sizes.
Let $A$ and $B$ be two towns, with $B$ to the right of $A$. We say that town $A$ can [i]sweep[/i] town $B$ [i]away[/i] if the right bulldozer of $A$ can move over to $B$ pushing off all bulldozers it meets. Similarly town $B$ can sweep town $A$ away if the left bulldozer of $B$ can move over to $A$ pushing off all bulldozers of all towns on its way.
Prove that there is exactly one town that cannot be swept away by any other one.
Let be a natural number $ n. $ Solve in the set of $ 2\times 2 $ complex matrices the equation
$$ \begin{pmatrix} -2& 2007\\ 0&-2 \end{pmatrix} =X^{3n}-3X^n. $$
[i]Petru Vlad[/i]
We have a $2\times n$ rectangle. We call each $1\times1$ square a room and we show the room in the $i^{th}$ row and $j^{th}$ column as $(i,j)$. There are some coins in some rooms of the rectangle. If there exist more than $1$ coin in each room, we can delete $2$ coins from it and add $1$ coin to its right adjacent room OR we can delete $2$ coins from it and add $1$ coin to its up adjacent room. Prove that there exists a finite configuration of allowable operations such that we can put a coin in the room $(1,n)$.
For any $h = 2^{r}$ ($r$ is a non-negative integer), find all $k \in \mathbb{N}$ which satisfy the following condition: There exists an odd natural number $m > 1$ and $n \in \mathbb{N}$, such that $k \mid m^{h} - 1, m \mid n^{\frac{m^{h}-1}{k}} + 1$.
Let $ a$, $ b$, $ c$ be three integers. Prove that there exist six integers $ x$, $ y$, $ z$, $ x^{\prime}$, $ y^{\prime}$, $ z^{\prime}$ such that
$ a\equal{}yz^{\prime}\minus{}zy^{\prime};\ \ \ \ \ \ \ \ \ \ b\equal{}zx^{\prime}\minus{}xz^{\prime};\ \ \ \ \ \ \ \ \ \ c\equal{}xy^{\prime}\minus{}yx^{\prime}$.
The sequence $ (a_n)_{n\ge 1}$ is defined by $ a_1 \equal{} 3$, $ a_2 \equal{} 11$ and $ a_n \equal{} 4a_{n\minus{}1}\minus{}a_{n\minus{}2}$, for $ n \ge 3$. Prove that each term of this sequence is of the form $ a^2 \plus{} 2b^2$ for some natural numbers $ a$ and $ b$.
In the decimal expression of a $ 2009$-digit natural number there are only the digits $ 5$ and $ 8$. Prove that we can get a $ 2008$-digit number divisible by $ 11$ if we remove just one digit from the number.
There are$n$ balls numbered $1,2,\cdots,n$, respectively. They are painted with $4$ colours, red, yellow, blue, and green, according to the following rules:
First, randomly line them on a circle.
Then let any three clockwise consecutive balls numbered $i, j, k$, in order.
1) If $i>j>k$, then the ball $j$ is painted in red;
2) If $i<j<k$, then the ball $j$ is painted in yellow;
3) If $i<j, k<j$, then the ball $j$ is painted in blue;
4) If $i>j, k>j$, then the ball $j$ is painted in green.
And now each permutation of the balls determine a painting method.
We call two painting methods distinct, if there exists a ball, which is painted with two different colours in that two methods.
Find out the number of all distinct painting methods.
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 $S=\{1,2,3,\ldots,2012\}.$ We want to partition $S$ into two disjoint sets such that both sets do not contain two different numbers whose sum is a power of $2.$ Find the number of such partitions.
$n$ people (with names $1,2,\dots,n$) are around a table. Some of them are friends. At each step 2 friend can change their place. Find a necessary and sufficient condition for friendship relation between them that with these steps we can always reach to all of posiible permutations.
A strip of width $w$ is the set of all points which lie on, or between, two parallel lines distance $w$ apart. Let $S$ be a set of $n$ ($n \ge 3$) points on the plane such that any three different points of $S$ can be covered by a strip of width $1$.
Prove that $S$ can be covered by a strip of width $2$.
Show that for any $n\geq 2$, $2^{2^n}+1$ ends with 7
Let $f(x)$ be a continuous function such that $f(2x^2-1)=2xf(x)$ for all $x$. Show that $f(x)=0$ for $-1\le x \le 1$.
Let $P(x)$ be a polynomial of degree $n$ with real coefficients and let $a\geq 3$. Prove that
\[\max_{0\leq j \leq n+1}\left | a^j-P(j) \right |\geq 1\]
Start with a finite sequence $ a_1,a_2,\dots,a_n$ of positive integers. If possible, choose two indices $ j < k$ such that $ a_j$ does not divide $ a_k$ and replace $ a_j$ and $ a_k$ by $ \gcd(a_j,a_k)$ and $ \text{lcm}\,(a_j,a_k),$ respectively. Prove that if this process is repeated, it must eventually stop and the final sequence does not depend on the choices made. (Note: $ \gcd$ means greatest common divisor and lcm means least common multiple.)
We define an operation $\oplus$ on the set $\{0, 1\}$ by
\[ 0 \oplus 0 = 0 \,, 0 \oplus 1 = 1 \,, 1 \oplus 0 = 1 \,, 1 \oplus 1 = 0 \,.\]
For two natural numbers $a$ and $b$, which are written in base $2$ as $a = (a_1a_2 \ldots a_k)_2$ and $b = (b_1b_2 \ldots b_k)_2$ (possibly with leading 0's), we define $a \oplus b = c$ where $c$ written in base $2$ is $(c_1c_2 \ldots c_k)_2$ with $c_i = a_i \oplus b_i$, for $1 \le i \le k$. For example, we have $7 \oplus 3 = 4$ since $ 7 = (111)_2$ and $3 = (011)_2$.
For a natural number $n$, let $f(n) = n \oplus \left[ n/2 \right]$, where $\left[ x \right]$ denotes the largest integer less than or equal to $x$. Prove that $f$ is a bijection on the set of natural numbers.