Found problems: 5802
For a positive integer $n$, define $f(n)$ to be the number of sequences $(a_1,a_2,\dots,a_k)$ such that $a_1a_2\cdots a_k=n$ where $a_i\geq 2$ and $k\ge 0$ is arbitrary. Also we define $f(1)=1$. Now let $\alpha>1$ be the unique real number satisfying $\zeta(\alpha)=2$, i.e $ \sum_{n=1}^{\infty}\frac{1}{n^\alpha}=2 $
Prove that
[list]
(a) \[ \sum_{j=1}^{n}f(j)=\mathcal{O}(n^\alpha) \]
(b) There is no real number $\beta<\alpha$ such that
\[ \sum_{j=1}^{n}f(j)=\mathcal{O}(n^\beta) \]
[/list]
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.
Assume that $k$ and $n$ are two positive integers. Prove that there exist positive integers $m_1 , \dots , m_k$ such that \[1+\frac{2^k-1}{n}=\left(1+\frac1{m_1}\right)\cdots \left(1+\frac1{m_k}\right).\]
[i]Proposed by Japan[/i]
Given the sequence
$f_1(a)=sin(0,5\pi a)$
$f_2(a)=sin(0,5\pi (sin(0,5\pi a)))$
$...$
$f_n(a)=sin(0,5\pi (sin(...(sin(0,5\pi a))...)))$ , where $a$ is any real number.
What limit aspire the members of this sequence as $n \to \infty$?
For a positive integer $n$, consider the set
\[S = \{0, 1, 1 + 2, 1 + 2 + 3, \ldots, 1 + 2 + 3 +\ldots + (n - 1)\}\]
Prove that the elements of $S$ are mutually incongruent modulo $n$ if and only if $n$ is a power of $2$.
Prove the inequality:
\[\sum_{i < j}{\frac {a_{i}a_{j}}{a_{i} \plus{} a_{j}}}\leq \frac {n}{2(a_{1} \plus{} a_{2} \plus{}\cdots \plus{} a_{n})}\cdot \sum_{i < j}{a_{i}a_{j}}\]
for positive reals $ a_{1},a_{2},\ldots,a_{n}$.
[i]Proposed by Dusan Dukic, Serbia[/i]
Let $ n$ be a positive integer. Show that the numbers
\[ \binom{2^n \minus{} 1}{0},\; \binom{2^n \minus{} 1}{1},\; \binom{2^n \minus{} 1}{2},\; \ldots,\; \binom{2^n \minus{} 1}{2^{n \minus{} 1} \minus{} 1}\]
are congruent modulo $ 2^n$ to $ 1$, $ 3$, $ 5$, $ \ldots$, $ 2^n \minus{} 1$ in some order.
[i]Proposed by Duskan Dukic, Serbia[/i]
Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer.
Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers.
[i]Proposed by Matthew Babbitt[/i]
Let $\{b_n\}_{n\geq 1}^{\infty}$ be a sequence of positive integers. The sequence $\{a_n\}_{n\geq 1}^{\infty}$ is defined as follows: $a_1$ is a fixed positive integer and
\[a_{n+1}=a_n^{b_n}+1 ,\qquad \forall n\geq 1.\]
Find all positive integers $m\geq 3$ with the following property: If the sequence $\{a_n\mod m\}_{n\geq 1 }^{\infty}$ is eventually periodic, then there exist positive integers $q,u,v$ with $2\leq q\leq m-1$, such that the sequence $\{b_{v+ut}\mod q\}_{t\geq 1}^{\infty}$ is purely periodic.
Find all functions $f:\mathbb R\to\mathbb R$ such that $$f\left( x^2+xf(y)\right)=xf(x+y)$$ for all reals $x,y$.
For every positive integer $N\geq 2$ with prime factorisation $N=p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k}$ we define \[f(N):=1+p_1a_1+p_2a_2+\cdots+p_ka_k.\] Let $x_0\geq 2$ be a positive integer. We define the sequence $x_{n+1}=f(x_n)$ for all $n\geq 0.$ Prove that this sequence is eventually periodic and determine its fundamental period.
Let $S$ be a nonempty set of positive integers such that, for any (not necessarily distinct) integers $a$ and $b$ in $S$, the number $ab+1$ is also in $S$. Show that the set of primes that do not divide any element of $S$ is finite.
[i]Proposed by Carl Schildkraut[/i]
3. A 6×6 square has been tiled by 18 dominoes. Show that there exists a line that
divides the square into two parts, each of which is also tiled by dominoes
Let $\mathbb{Z}$ denote the set of integers and $S \subset \mathbb{Z} $ be the set of integers that are at least $10^{100}$. Fix a positive integer $c$. Determine all functions $f: S \rightarrow \mathbb{Z} $ satisfying
$f(xy+c)=f(x)+f(y)$, for all $x,y \in S$
Find all integers $b$ such that there exists a positive real number $x$ with \[ \dfrac {1}{b} = \dfrac {1}{\lfloor 2x \rfloor} + \dfrac {1}{\lfloor 5x \rfloor} \] Here, $\lfloor y \rfloor$ denotes the greatest integer that is less than or equal to $y$.
Let $d(n)$ be the number of positive divisors of a positive integer $n$ (including $1$ and $n$). Find all values of $n$ such that $n + d(n) = d(n)^2$.
Let $n\geq 0$ be an integer and let $p \equiv 7 \pmod 8$ be a prime number. Prove that
\[ \sum^{p-1}_{k=1} \left \{ \frac {k^{2^n}}p - \frac 12 \right\} = \frac {p-1}2 . \]
[i]Călin Popescu[/i]
Let $ f, g$ and $ a$ be polynomials with real coefficients, $ f$ and $ g$ in one variable and $ a$ in two variables. Suppose
\[ f(x) \minus{} f(y) \equal{} a(x, y)(g(x) \minus{} g(y)) \forall x,y \in \mathbb{R}\]
Prove that there exists a polynomial $ h$ with $ f(x) \equal{} h(g(x)) \text{ } \forall x \in \mathbb{R}.$
Turbo the snail plays a game on a board with $2024$ rows and $2023$ columns. There are hidden monsters in $2022$ of the cells. Initially, Turbo does not know where any of the monsters are, but he knows that there is exactly one monster in each row except the first row and the last row, and that each column contains at most one monster.
Turbo makes a series of attempts to go from the first row to the last row. On each attempt, he chooses to start on any cell in the first row, then repeatedly moves to an adjacent cell sharing a common side. (He is allowed to return to a previously visited cell.) If he reaches a cell with a monster, his attempt ends and he is transported back to the first row to start a new attempt. The monsters do not move, and Turbo remembers whether or not each cell he has visited contains a monster. If he reaches any cell in the last row, his attempt ends and the game is over.
Determine the minimum value of $n$ for which Turbo has a strategy that guarantees reaching the last row on the $n$-th attempt or earlier, regardless of the locations of the monsters.
[i]Proposed by Cheuk Hei Chu, Hong Kong[/i]
Let $n$ be an integer greater than or equal to $1$. Find, as a function of $n$, the smallest integer $k\ge 2$ such that, among any $k$ real numbers, there are necessarily two of which the difference, in absolute value, is either strictly less than $1 / n$, either strictly greater than $n$.
An elephant writes a sequence of numbers on a board starting with 1. Each minute, it doubles the sum of all the numbers on the board so far, and without erasing anything, writes the result on the board. It stops after writing a number greater than one billion. How many distinct prime factors does the largest number on the board have?
[i]Ray Li.[/i]
Archipelago consists of $ n$ islands : $ I_1,I_2,...,I_n$ and $ a_1,a_2,...,a_n$ - number of the roads on each island. $ a_1 \equal{} 55$, $ a_k \equal{} a_{k \minus{} 1} \plus{} (k \minus{} 1)$, ($ k \equal{} 2,3,...,n$)
a) Does there exist an island with 2008 roads?
b) Calculate $ a_1 \plus{} a_2 \plus{} ... \plus{} a_n.$
Let $n\ge 3$ be an integer, and let $a_2,a_3,\ldots ,a_n$ be positive real numbers such that $a_{2}a_{3}\cdots a_{n}=1$. Prove that
\[(1 + a_2)^2 (1 + a_3)^3 \dotsm (1 + a_n)^n > n^n.\]
[i]Proposed by Angelo Di Pasquale, Australia[/i]
Let $n$ be a natural number greater than 2. $l$ is a line on a plane. There are $n$ distinct points $P_1$, $P_2$, …, $P_n$ on $l$. Let the product of distances between $P_i$ and the other $n-1$ points be $d_i$ ($i = 1, 2,$ …, $n$). There exists a point $Q$, which does not lie on $l$, on the plane. Let the distance from $Q$ to $P_i$ be $C_i$ ($i = 1, 2,$ …, $n$). Find $S_n = \sum_{i = 1}^{n} (-1)^{n-i} \frac{c_i^2}{d_i}$.
Let $A$ be a non-empty set of positive integers. Suppose that there are positive integers $b_1,\ldots b_n$ and $c_1,\ldots,c_n$ such that
- for each $i$ the set $b_iA+c_i=\left\{b_ia+c_i\colon a\in A\right\}$ is a subset of $A$, and
- the sets $b_iA+c_i$ and $b_jA+c_j$ are disjoint whenever $i\ne j$
Prove that \[{1\over b_1}+\,\ldots\,+{1\over b_n}\leq1.\]