Found problems: 5802
Determine all possible values of positive integer $n$, such that there are $n$ different 3-element subsets $A_1,A_2,...,A_n$ of the set $\{1,2,...,n\}$, with $|A_i \cap A_j| \not= 1$ for all $i \not= j$.
(a) Let $a_0, a_1,a_2$ be real numbers and consider the polynomial $P(x) = a_0 + a_1x + a_2x^2$ .
Assume that $P(-1), P(0)$ and $P(1)$ are integers.
Prove that $P(n)$ is an integer for all integers $n$.
(b) Let $a_0,a_1, a_2, a_3$ be real numbers and consider the polynomial $Q(x) = a0 + a_1x + a_2x^2 + a_3x^3 $.
Assume that there exists an integer $i$ such that $Q(i),Q(i+1),Q(i+2)$ and $Q(i+3)$ are integers.
Prove that $Q(n)$ is an integer for all integers $n$.
Let $f$ be a function defined on the set of positive rational numbers with the property that $f(a\cdot b)=f(a)+f(b)$ for all positive rational numbers $a$ and $b$. Suppose that $f$ also has the property that $f(p)=p$ for every prime number $p$. For which of the following numbers $x$ is $f(x)<0?$
$\textbf{(A) } \frac{17}{32} \qquad \textbf{(B) } \frac{11}{16} \qquad \textbf{(C) } \frac{7}{9} \qquad \textbf{(D) } \frac{7}{6} \qquad \textbf{(E) } \frac{25}{11}$
We define the following sequence: $a_0=a_1=1$, $a_{n+1}=14a_n-a_{n-1}$. Prove that
$2a_n-1$ is a perfect square.
Let $(a_{n})_{n=1}^{\infty}$ be a sequence of positive real numbers and let $\alpha_{n}$ be the
arithmetic mean of $a_{1},..., a_{n}$ . Prove that for all positive integers $N$ ,
\[\sum_{n=1}^{N}\alpha_{n}^{2}\leq 4\sum_{n=1}^{N}a_{n}^{2}. \]
Let $(a_n)$ be a sequence of non-negative real numbers satisfying $a_{n+m}\le a_n+a_m$ for all non-negative integers $m,n$.
Prove that if $n\ge m$ then $a_n\le ma_1+\left(\dfrac{n}{m}-1\right)a_m$ holds.
The sequence $ (x_n)_{n \geq 1}$ is defined by:
$ x_1\equal{}1$
$ x_{n\plus{}1}\equal{}\frac{x_n}{n}\plus{}\frac{n}{x_n}$
Prove that $ (x_n)$ increases and $ [x_n^2]\equal{}n$.
Let \(m\) be a positive integer. Find, in terms of \(m\), all polynomials \(P(x)\) with integer coefficients such that for every integer \(n\), there exists an integer \(k\) such that \(P(k)=n^m\).
[i]Proposed by Raymond Feng[/i]
Alice and Bob play a game in which they take turns removing stones from a heap that initially has $n$ stones. The number of stones removed at each turn must be one less than a prime number. The winner is the player who takes the last stone. Alice plays first. Prove that there are infinitely many such $n$ such that Bob has a winning strategy. (For example, if $n=17,$ then Alice might take $6$ leaving $11;$ then Bob might take $1$ leaving $10;$ then Alice can take the remaining stones to win.)
Determine if there exists a positive integer $n$ such that $n$ has exactly $2000$ prime divisors and $2^{n}+1$ is divisible by $n$.
Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.
There are $n\ge 2$ line segments in the plane such that every two segments cross and no three segments meet at a point. Geoff has to choose an endpoint of each segment and place a frog on it facing the other endpoint. Then he will clap his hands $n-1$ times. Every time he claps,each frog will immediately jump forward to the next intersection point on its segment. Frogs never change the direction of their jumps. Geoff wishes to place the frogs in such a way that no two of them will ever occupy the same intersection point at the same time.
(a) Prove that Geoff can always fulfill his wish if $n$ is odd.
(b) Prove that Geoff can never fulfill his wish if $n$ is even.
Let $a_1$, $a_2$, $\ldots$ be an infinite sequence of positive integers. Suppose that there is an integer $N > 1$ such that, for each $n \geq N$, the number
$$\frac{a_1}{a_2} + \frac{a_2}{a_3} + \cdots + \frac{a_{n-1}}{a_n} + \frac{a_n}{a_1}$$
is an integer. Prove that there is a positive integer $M$ such that $a_m = a_{m+1}$ for all $m \geq M$.
[i]Proposed by Bayarmagnai Gombodorj, Mongolia[/i]
Let $n>1$ be a given integer. The Mint issues coins of $n$ different values $a_1, a_2, ..., a_n$, where each $a_i$ is a positive integer (the number of coins of each value is unlimited). A set of values $\{a_1, a_2,..., a_n\}$ is called [i]lucky[/i], if the sum $a_1+ a_2+...+ a_n$ can be collected in a unique way (namely, by taking one coin of each value).
(a) Prove that there exists a lucky set of values $\{a_1, a_2, ..., a_n\}$ with $$a_1+ a_2+...+ a_n < n \cdot 2^n.$$
(b) Prove that every lucky set of values $\{a_1, a_2,..., a_n\}$ satisfies $$a_1+ a_2+...+ a_n >n \cdot 2^{n-1}.$$
Proposed by Ilya Bogdanov
For a sequence, one can perform the following operation: select three adjacent terms $a,b,c,$ and change it into $b,c,a.$ Determine all the possible positive integers $n\geq 3,$ such that after finite number of operation, the sequence $1,2,\cdots, n$ can be changed into $n,n-1,\cdots,1$ finally.
Determine the greatest positive integer $k$ that satisfies the following property: The set of positive integers can be partitioned into $k$ subsets $A_1, A_2, \ldots, A_k$ such that for all integers $n \geq 15$ and all $i \in \{1, 2, \ldots, k\}$ there exist two distinct elements of $A_i$ whose sum is $n.$
[i]Proposed by Igor Voronovich, Belarus[/i]
Find, with proof, all positive integers $n$ for which $2^n + 12^n + 2011^n$ is a perfect square.
Alice has a map of Wonderland, a country consisting of $n \geq 2$ towns. For every pair of towns, there is a narrow road going from one town to the other. One day, all the roads are declared to be “one way” only. Alice has no information on the direction of the roads, but the King of Hearts has offered to help her. She is allowed to ask him a number of questions. For each question in turn, Alice chooses a pair of towns and the King of Hearts tells her the direction of the road connecting those two towns.
Alice wants to know whether there is at least one town in Wonderland with at most one outgoing road. Prove that she can always find out by asking at most $4n$ questions.
A function $ f: R^3\rightarrow R$ for all reals $ a,b,c,d,e$ satisfies a condition:
\[ f(a,b,c)\plus{}f(b,c,d)\plus{}f(c,d,e)\plus{}f(d,e,a)\plus{}f(e,a,b)\equal{}a\plus{}b\plus{}c\plus{}d\plus{}e\]
Show that for all reals $ x_1,x_2,\ldots,x_n$ ($ n\geq 5$) equality holds:
\[ f(x_1,x_2,x_3)\plus{}f(x_2,x_3,x_4)\plus{}\ldots \plus{}f(x_{n\minus{}1},x_n,x_1)\plus{}f(x_n,x_1,x_2)\equal{}x_1\plus{}x_2\plus{}\ldots\plus{}x_n\]
Some blue and red circular disks of identical size are packed together to form a triangle. The top level has one disk and each level has 1 more disk than the level above it. Each disk not at the bottom level touches two disks below it and its colour is blue if these two disks are of the same colour. Otherwise its colour is red.
Suppose the bottom level has 2048 disks of which 2014 are red. What is the colour of the disk at the top?
Arnim and Brentano have a little vase with $1500$ candies on the table and a huge sack with spare candies under the table. They play a game taking turns, Arnim begins . At each move a player can either eat $7$ candies or take $6$ candies from under the table and add them to the vase. A player cannot go under the table in two consecutive moves. A player is declared the winner if he leaves the vase empty. In any other case, if a player cannot make a move in his turn, the game is declared a tie. Is there a winning strategy for one of the players?
Let $ G$ be a finite non-commutative group of order $ t \equal{} 2^nm$, where $ n, m$ are positive and $ m$ is odd. Prove, that if the group contains an element of order $ 2^n$, then
(i) $ G$ is not simple;
(ii) $ G$ contains a normal subgroup of order $ m$.
$n$ being a given integer, find all functions $f\colon \mathbb{Z} \to \mathbb{Z}$, such that for all integers $x,y$ we have $f\left( {x + y + f(y)} \right) = f(x) + ny$.
In the night, stars in the sky are seen in different time intervals. Suppose for every $k$ stars ($k>1$), at least $2$ of them can be seen in one moment. Prove that we can photograph $k-1$ pictures from the sky such that each of the mentioned stars is seen in at least one of the pictures.
(The number of stars is finite. Define the moments that the $n^{th}$ star is seen as $[a_n,b_n]$ that $a_n<b_n$.)
For every natural number $n$, denote $Q(n)$ the sum of the digits in the decimal representation of $n$. Prove that there are infinitely many natural numbers $k$ with $Q(3^{k})>Q(3^{k+1})$.