Found problems: 5802
Find all functions $f:\mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ (where $\mathbb{Z}^+$ is the set of positive integers) such that $f(n!) = f(n)!$ for all positive integers $n$ and such that $m-n$ divides $f(m) - f(n)$ for all distinct positive integers $m, n$.
The lateral surface of a cylinder of revolution is divided by $n-1$ planes parallel to the base and $m$ parallel generators into $mn$ cases $( n\ge 1,m\ge 3)$. Two cases will be called neighbouring cases if they have a common side. Prove that it is possible to write a real number in each case such that each number is equal to the sum of the numbers of the neighbouring cases and not all the numbers are zero if and only if there exist integers $k,l$ such that $n+1$ does not divide $k$ and
\[ \cos \frac{2l\pi}{m}+\cos\frac{k\pi}{n+1}=\frac{1}{2}\]
[i]Ciprian Manolescu[/i]
We've colored edges of $K_n$ with $n-1$ colors. We call a vertex rainbow if it's connected to all of the colors. At most how many rainbows can exist?
[i]Proposed by Morteza Saghafian[/i]
The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).
The sequence $a_1, a_2, a_3, ...$ is defined by $a_1 = 0$, $a_n = a_{[n/2]} + (-1)^{n(n+1)/2}$. Show that for any positive integer $k$ we can find $n$ in the range $2^k \leq n < 2^{k+1}$ such that $a_n = 0$.
Find all functions $f:\mathbb{N}_0\to\mathbb{N}_0$ for which $f(0)=0$ and
\[f(x^2-y^2)=f(x)f(y) \]
for all $x,y\in\mathbb{N}_0$ with $x>y$.
A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even.
[i]Proposed by Jeck Lim, Singapore[/i]
Let $p$ be a prime number, and define a sequence by: $x_i=i$ for $i=,0,1,2...,p-1$ and $x_n=x_{n-1}+x_{n-p}$ for $n \geq p$
Find the remainder when $x_{p^3}$ is divided by $p$.
Kevin has a set $S$ of $2014$ points scattered on an infinitely large planar gameboard. Because he is bored, he asks Ashley to evaluate \[ x = 4f_4 + 6f_6 + 8f_8 + 10f_{10} + \cdots \] while he evaluates \[ y = 3f_3 + 5f_5+7f_7+9f_9 + \cdots, \] where $f_k$ denotes the number of convex $k$-gons whose vertices lie in $S$ but none of whose interior points lie in $S$.
However, since Kevin wishes to one-up everything that Ashley does, he secretly positions the points so that $y-x$ is as large as possible, but in order to avoid suspicion, he makes sure no three points lie on a single line. Find $\left\lvert y-x \right\rvert$.
[i]Proposed by Robin Park[/i]
Let $n$ be a positive integer. Let $P_n=\{2^n,2^{n-1}\cdot 3, 2^{n-2}\cdot 3^2, \dots, 3^n \}.$ For each subset $X$ of $P_n$, we write $S_X$ for the sum of all elements of $X$, with the convention that $S_{\emptyset}=0$ where $\emptyset$ is the empty set. Suppose that $y$ is a real number with $0 \leq y \leq 3^{n+1}-2^{n+1}.$
Prove that there is a subset $Y$ of $P_n$ such that $0 \leq y-S_Y < 2^n$
The function $f$, with domain on the set of non-negative integers, is defined by the following :
$\bullet$ $f (0) = 2$
$\bullet$ $(f (n + 1) -1)^2 + (f (n)-1) ^2 = 2f (n) f (n + 1) + 4$, taking $f (n)$ the largest possible value.
Determine $f (n)$.
Is there an infinite sequence of prime numbers $p_1$, $p_2$, $\ldots$, $p_n$, $p_{n+1}$, $\ldots$ such that $|p_{n+1}-2p_n|=1$ for each $n \in \mathbb{N}$?
Let $\mathbb{R}_{>0}$ be the set of the positive real numbers. Find all functions $f:\mathbb{R}_{>0} \rightarrow \mathbb{R}_{>0}$ such that $$f(xy+f(x))=f(f(x)f(y))+x$$ for all positive real numbers $x$ and $y$.
Consider $2011^2$ points arranged in the form of a $2011 \times 2011$ grid. What is the maximum number of points that can be chosen among them so that no four of them form the vertices of either an isosceles trapezium or a rectangle whose parallel sides are parallel to the grid lines?
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 $l_1,l_2,l_3,...,L_n$ be lines in the plane such that no two of them are parallel and no three of them are concurrent. Let $A$ be the intersection point of lines $l_i,l_j$. We call $A$ an "Interior Point" if there are points $C,D$ on $l_i$ and $E,F$ on $l_j$ such that $A$ is between $C,D$ and $E,F$. Prove that there are at least $\frac{(n-2)(n-3)}{2}$ Interior points.($n>2$)
note: by point here we mean the points which are intersection point of two of $l_1,l_2,...,l_n$.
I'm thinking of a five-letter word that rhymes with ``angry'' and ``hungry''. What is it?
$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$
Let $x_1, x_2, \ldots ,x_n(n\ge 2)$ be real numbers greater than $1$. Suppose that $|x_i-x_{i+1}|<1$ for $i=1, 2,\ldots ,n-1$. Prove that
\[\frac{x_1}{x_2}+\frac{x_2}{x_3}+\ldots +\frac{x_{n-1}}{x_n}+\frac{x_n}{x_1}<2n-1\]
Is it possible to place the numbers $0,1,2,\dots,9$ on a circle so that the sum of any three consecutive numbers is a) 13, b) 14, c) 15?
Let \(c\) be a positive real number. Alice wishes to pick an integer \(n\) and a sequence \(a_1\), \(a_2\), \(\ldots\) of distinct positive integers such that \(a_{i} \leq ci\) for all positive integers \(i\) and \[n, \qquad n + a_1, \qquad n + a_1 - a_2, \qquad n + a_1 - a_2 + a_3, \qquad \cdots\] is a sequence of distinct nonnegative numbers. Find all \(c\) such that Alice can fulfil her wish.
Determine all pairs $(f,g)$ of functions from the set of positive integers to itself that satisfy \[f^{g(n)+1}(n) + g^{f(n)}(n) = f(n+1) - g(n+1) + 1\] for every positive integer $n$. Here, $f^k(n)$ means $\underbrace{f(f(\ldots f)}_{k}(n) \ldots ))$.
[i]Proposed by Bojan Bašić, Serbia[/i]
A sequence of numbers is defined recursively by $a_1 = 1$, $a_2 = \frac{3}{7}$, and
$$a_n=\frac{a_{n-2} \cdot a_{n-1}}{2a_{n-2} - a_{n-1}}$$for all $n \geq 3$ Then $a_{2019}$ can be written as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive inegers. What is $p+q ?$
$\textbf{(A) } 2020 \qquad\textbf{(B) } 4039 \qquad\textbf{(C) } 6057 \qquad\textbf{(D) } 6061 \qquad\textbf{(E) } 8078$
Consider the set
\[A = \left\{1+\frac{1}{k} : k=1,2,3,4,\cdots \right\}.\]
[list=a]
[*]Prove that every integer $x \geq 2$ can be written as the product of one or more elements of $A$, which are not necessarily different.
[*]For every integer $x \geq 2$ let $f(x)$ denote the minimum integer such that $x$ can be written as the
product of $f(x)$ elements of $A$, which are not necessarily different.
Prove that there exist infinitely many pairs $(x,y)$ of integers with $x\geq 2$, $y \geq 2$, and \[f(xy)<f(x)+f(y).\] (Pairs $(x_1,y_1)$ and $(x_2,y_2)$ are different if $x_1 \neq x_2$ or $y_1 \neq y_2$).
[/list]
Find all pairs of positive integers \((a,b)\) with the following property: there exists an integer \(N\) such that for any integers \(m\ge N\) and \(n\ge N\), every \(m\times n\) grid of unit squares may be partitioned into \(a\times b\) rectangles and fewer than \(ab\) unit squares.
[i]Proposed by Holden Mui[/i]