Found problems: 5802
Let be given $n$ positive integer. Lets write with $a_n$ the number of positive integer pairs $(x,y)$ such that $x+y$ is even and $1\leq x\leq y\leq n$. Lets write with $b_n$ the number of positive integer pairs $(x,y)$ such that $x+y\leq n+1$ and $1\leq x\leq y\leq n$.
Let $\mathbb{N}$ denote the set of positive integers. Find all functions $f \colon \mathbb{N} \to \mathbb{Z}$ such that \[\left\lfloor \frac{f(mn)}{n} \right\rfloor=f(m)\] for all positive integers $m,n$.
[i]Merlijn Staps[/i]
Determine all functions $f:\mathbb{Z}\rightarrow\mathbb{Z}$ with the property that \[f(x-f(y))=f(f(x))-f(y)-1\] holds for all $x,y\in\mathbb{Z}$.
Let $p$ be an odd prime number and $\mathbb{Z}_{>0}$ be the set of positive integers. Suppose that a function $f:\mathbb{Z}_{>0}\times\mathbb{Z}_{>0}\to\{0,1\}$ satisfies the following properties:
[list]
[*] $f(1,1)=0$.
[*] $f(a,b)+f(b,a)=1$ for any pair of relatively prime positive integers $(a,b)$ not both equal to 1;
[*] $f(a+b,b)=f(a,b)$ for any pair of relatively prime positive integers $(a,b)$.
[/list]
Prove that
$$\sum_{n=1}^{p-1}f(n^2,p) \geqslant \sqrt{2p}-2.$$
Find all pairs $(b,c)$ of positive integers, such that the sequence defined by $a_1=b$, $a_2=c$ and $a_{n+2}= \left| 3a_{n+1}-2a_n \right|$ for $n \geq 1$ has only finite number of composite terms.
[i]Proposed by Oleg Mushkarov and Nikolai Nikolov[/i]
Find all functions $f:\mathbb{N}\to \mathbb{N}$ so that for every natural numbers $m,n$ :$f(n)+2mn+f(m)$ is a perfect square.
The sequence $ (a_n)$ satisfies $ a_1 \equal{} 1$ and $ \displaystyle 5^{(a_{n\plus{}1}\minus{}a_n)} \minus{} 1 \equal{} \frac{1}{n\plus{}\frac{2}{3}}$ for $ n \geq 1$. Let $ k$ be the least integer greater than $ 1$ for which $ a_k$ is an integer. Find $ k$.
Prove that: \[ \frac{1989}{2}\minus{}\frac{1988}{3}\plus{}\frac{1987}{4}\minus{}\cdots\minus{}\frac{2}{1989}\plus{}\frac{1}{1990}\equal{}\frac{1}{996}\plus{}\frac{3}{997}\plus{}\frac{5}{998}\plus{}\cdots\plus{}\frac{1989}{1990}\]
Define a function $P(n)$ from the set of positive integers to itself, where $P(1)=1$ and if an integer $n > 1$ has prime factorization $$n = p_1^{a_1}p_2^{a_2} \dots p_k^{a_k}$$
then $$P(n) = a_1^{p_1}a_2^{p_2} \dots a_k^{p_k}.$$
Prove that $P(P(n)) \le n$ for all positive integers $n.$
[i]Proposed by Evan Chang (squareman), USA[/i]
Let $n \geqslant 2$ be an integer and let $1<a_1 \le a_2 \le \dots \le a_n$ be $n$ real numbers such that $a_1+a_2+\dots+a_n=2n$. Prove that$$a_1a_2\dots a_{n-1}+a_1a_2\dots a_{n-2}+\dots+a_1a_2+a_1+2 \leqslant a_1a_2\dots a_n.$$
[i]Proposed by Kapil Pause[/i]
Let $n \geqslant 3$ be a positive integer and let $\left(a_{1}, a_{2}, \ldots, a_{n}\right)$ be a strictly increasing sequence of $n$ positive real numbers with sum equal to 2. Let $X$ be a subset of $\{1,2, \ldots, n\}$ such that the value of
\[
\left|1-\sum_{i \in X} a_{i}\right|
\]
is minimised. Prove that there exists a strictly increasing sequence of $n$ positive real numbers $\left(b_{1}, b_{2}, \ldots, b_{n}\right)$ with sum equal to 2 such that
\[
\sum_{i \in X} b_{i}=1.
\]
Let be a number $ n\ge 2, $ a binary funcion $ b:\mathbb{Z}\rightarrow\mathbb{Z}_2, $ and $ \frac{n^3+5n}{6} $ consecutive integers. Show that among these consecutive integers there are $ n $ of them, namely, $ b_1,b_2,\ldots ,b_n, $ that have the properties:
$ \text{(i)} b\left( b_1\right) =b\left( b_2\right) =\cdots =b\left( b_n\right) $
$ \text{(ii)} 1\le b_2-b_1\le b_3-b_2\le \cdots\le b_n-b_{n-1} $
The harmonic table is a triangular array:
$1$
$\frac 12 \qquad \frac 12$
$\frac 13 \qquad \frac 16 \qquad \frac 13$
$\frac 14 \qquad \frac 1{12} \qquad \frac 1{12} \qquad \frac 14$
Where $a_{n,1} = \frac 1n$ and $a_{n,k+1} = a_{n-1,k} - a_{n,k}$ for $1 \leq k \leq n-1.$ Find the harmonic mean of the $1985^{th}$ row.
Prove that for any $ n\in \mathbb N$ the number $ 1\plus{}\dfrac{1}{3}\plus{}\dfrac{1}{5}\plus{}\ldots\plus{}\dfrac{1}{2n\plus{}1}$ is not an integer.
Find all functions $f : \mathbb{Z}\rightarrow \mathbb{Z}$ satisfying
\[f^{a^{2} + b^{2}}(a+b) = af(a) +bf(b)\]
for all integers $a$ and $b$
Given a positive integer $k$ show that there exists a prime $p$ such that one can choose distinct integers $a_1,a_2\cdots, a_{k+3} \in \{1, 2, \cdots ,p-1\}$ such that p divides $a_ia_{i+1}a_{i+2}a_{i+3}-i$ for all $i= 1, 2, \cdots, k$.
[i]South Africa [/i]
Let $g:[2013,2014]\to\mathbb{R}$ a function that satisfy the following two conditions:
i) $g(2013)=g(2014) = 0,$
ii) for any $a,b \in [2013,2014]$ it hold that $g\left(\frac{a+b}{2}\right) \leq g(a) + g(b).$
Prove that $g$ has zeros in any open subinterval $(c,d) \subset[2013,2014].$
Prove that every positive integer $n$, except a finite number of them, can be represented as a sum of $2004$ positive integers: $n=a_1+a_2+\cdots +a_{2004}$, where $1\le a_1<a_2<\cdots <a_{2004}$, and $a_i \mid a_{i+1}$ for all $1\le i\le 2003$.
[i]Chen Yonggao[/i]
Find all functions $f : Z \to Z$ satisfying $f(m + n) + f(mn -1) = f(m)f(n) + 2$ for all $m, n \in Z$.
For any integer $d > 0,$ let $f(d)$ be the smallest possible integer that has exactly $d$ positive divisors (so for example we have $f(1)=1, f(5)=16,$ and $f(6)=12$). Prove that for every integer $k \geq 0$ the number $f\left(2^k\right)$ divides $f\left(2^{k+1}\right).$
[i]Proposed by Suhaimi Ramly, Malaysia[/i]
The sequence $a_0,a_1,a_2,...$ is defined by $a_0 = 0, a_1 = a_2 = 1$ and $a_{n+2} +a_{n-1} = 2(a_{n+1} +a_n)$ for all $n \in N$. Show that all $a_n$ are perfect squares .
Sequences $(a_n)_{n=0}^{\infty}$ and $(b_n)_{n=0}^{\infty}$ are defined with recurrent relations :
$$a_0=0 , \;\;\; a_1=1, \;\;\;\; a_{n+1}=\frac{2018}{n} a_n+ a_{n-1}\;\;\; \text {for }\;\;\; n\geq 1$$ and
$$b_0=0 , \;\;\; b_1=1, \;\;\;\; b_{n+1}=\frac{2020}{n} b_n+ b_{n-1}\;\;\; \text {for }\;\;\; n\geq 1$$
Prove that :$$\frac{a_{1010}}{1010}=\frac{b_{1009}}{1009}$$
Denote $\langle x\rangle$ the distance of the real number x from the nearest integer. Let f be a linear, 1 periodic, continuous real function. Prove that there exist natural n and real numbers $a_1 , ..., a_n , b_1 , ..., b_n , c_1 , ..., c_n$ such that $$f(x) = \sum_{i = 1}^n c_i \langle a_ix + b_i \rangle$$ for every x iff there is a k such that $$\sum_{j = 1}^{2^k} f \left(x+{j\over2^k}\right)$$ is constant.
Let $a$ be a positive integer which is not a perfect square, and consider the equation \[k = \frac{x^2-a}{x^2-y^2}.\] Let $A$ be the set of positive integers $k$ for which the equation admits a solution in $\mathbb Z^2$ with $x>\sqrt{a}$, and let $B$ be the set of positive integers for which the equation admits a solution in $\mathbb Z^2$ with $0\leq x<\sqrt{a}$. Show that $A=B$.
Given the sequence $\{y_n\}_{n=1}^{\infty}$ defined by $y_1=y_2=1$ and
\[y_{n+2} = (4k-5)y_{n+1}-y_n+4-2k, \qquad n\ge1\]
find all integers $k$ such that every term of the sequence is a perfect square.