Found problems: 341
Let $ \theta$ be an angle in the interval $ (0,\pi/2)$. Given that $ \cos \theta$ is irrational, and that $ \cos k \theta$ and $ \cos[(k \plus{} 1)\theta ]$ are both rational for some positive integer $ k$, show that $ \theta \equal{} \pi/6$.
Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers $m$ and $n$, the difference $f(m) - f(n)$ is divisible by $f(m- n)$. Prove that, for all integers $m$ and $n$ with $f(m) \leq f(n)$, the number $f(n)$ is divisible by $f(m)$.
[i]Proposed by Mahyar Sefidgaran, Iran[/i]
Let $n, m, k$ and $l$ be positive integers with $n \neq 1$ such that $n^k + mn^l + 1$ divides $n^{k+l} - 1$. Prove that
[list]
[*]$m = 1$ and $l = 2k$; or
[*]$l|k$ and $m = \frac{n^{k-l}-1}{n^l-1}$.
[/list]
Find all pairs of positive integers $m,n\geq3$ for which there exist infinitely many positive integers $a$ such that \[ \frac{a^m+a-1}{a^n+a^2-1} \] is itself an integer.
[i]Laurentiu Panaitopol, Romania[/i]
Let $c$ be a nonnegative integer, and define $a_n = n^2 + c$ (for $n \geq 1)$. Define $d_n$ as the greatest common divisor of $a_n$ and $a_{n + 1}$.
(a) Suppose that $c = 0$. Show that $d_n = 1,\ \forall n \geq 1$.
(b) Suppose that $c = 1$. Show that $d_n \in \{1,5\},\ \forall n \geq 1$.
(c) Show that $d_n \leq 4c + 1,\ \forall n \geq 1$.
Find the largest positive integer $k$ such that $\phi ( \sigma ( 2^k)) = 2^k$. ($\phi(n)$ denotes the number of positive integers that are smaller than $n$ and relatively prime to $n$, and $\sigma(n)$ denotes the sum of divisors of $n$). As a hint, you are given that $641|2^{32}+1$.
Let $P(x)$ be a polynomial with integer coefficients such that $P(0)=1$, and let $c > 1$ be an integer. Define $x_0=0$ and $x_{i+1} = P(x_i)$ for all integers $i \ge 0$. Show that there are infinitely many positive integers $n$ such that $\gcd (x_n, n+c)=1$.
[i]Proposed by Milan Haiman and Carl Schildkraut[/i]
Find all surjective functions $ f: \mathbb{N} \to \mathbb{N}$ such that for every $ m,n \in \mathbb{N}$ and every prime $ p,$ the number $ f(m + n)$ is divisible by $ p$ if and only if $ f(m) + f(n)$ is divisible by $ p$.
[i]Author: Mohsen Jamaali and Nima Ahmadi Pour Anari, Iran[/i]
Let $k,n\ge 1$ be relatively prime integers. All positive integers not greater than $k+n$ are written in some order on the blackboard. We can swap two numbers that differ by $k$ or $n$ as many times as we want. Prove that it is possible to obtain the order $1,2,\dots,k+n-1, k+n$.
Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$.
[i]Proposed by Dorlir Ahmeti, Albania[/i]
Given a positive integer $k > 1$, find all positive integers $n$ such that the polynomial $$P(z) = z^n + \sum_{j=0}^{2^k-2} z^j = 1 +z +z^2 + \cdots +z^{2^k-2} + z^n$$ has a complex root $w$ such that $|w| = 1$.
For how many positive integers $n \le 1000$ is $$\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor$$ not divisible by $3$? (Recall that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.)
$\textbf{(A) } 22 \qquad\textbf{(B) } 23 \qquad\textbf{(C) } 24 \qquad\textbf{(D) } 25 \qquad\textbf{(E) } 26$
Are there any triples $(a,b,c)$ of positive integers such that $(a-2)(b-2)(c-2)+12$ is a prime number that properly divides the positive number $a^2+b^2+c^2+abc-2017$?
Let $P(x)$ and $Q(x)$ be arbitrary polynomials with real coefficients, and let $d$ be the degree of $P(x)$. Assume that $P(x)$ is not the zero polynomial. Prove that there exist polynomials $A(x)$ and $B(x)$ such that:
(i) both $A$ and $B$ have degree at most $d/2$
(ii) at most one of $A$ and $B$ is the zero polynomial.
(iii) $\frac{A(x)+Q(x)B(x)}{P(x)}$ is a polynomial with real coefficients. That is, there is some polynomial $C(x)$ with real coefficients such that $A(x)+Q(x)B(x)=P(x)C(x)$.
Let $ a, b, c$ be integers satisfying $ 0 < a < c \minus{} 1$ and $ 1 < b < c$. For each $ k$, $ 0\leq k \leq a$, Let $ r_k,0 \leq r_k < c$
be the remainder of $ kb$ when divided by $ c$. Prove that the two sets $ \{r_0, r_1, r_2, \cdots , r_a\}$ and $ \{0, 1, 2, \cdots , a\}$ are different.
Find the number of rational numbers $r$, $0<r<1$, such that when $r$ is written as a fraction in lowest terms, the numerator and denominator have a sum of $1000$.
Given an integer ${n>1}$, denote by $P_{n}$ the product of all positive integers $x$ less than $n$ and such that $n$ divides ${x^2-1}$. For each ${n>1}$, find the remainder of $P_{n}$ on division by $n$.
[i]Proposed by John Murray, Ireland[/i]
Find the largest integer $ n$ satisfying the following conditions:
(i) $ n^2$ can be expressed as the difference of two consecutive cubes;
(ii) $ 2n\plus{}79$ is a perfect square.
For an ordered pair $(m,n)$ of distinct positive integers, suppose, for some nonempty subset $S$ of $\mathbb R$, that a function $f:S \rightarrow S$ satisfies the property that $f^m(x) + f^n(y) = x+y$ for all $x,y\in S$. (Here $f^k(z)$ means the result when $f$ is applied $k$ times to $z$; for example, $f^1(z)=f(z)$ and $f^3(z)=f(f(f(z)))$.) Then $f$ is called \emph{$(m,n)$-splendid}. Furthermore, $f$ is called \emph{$(m,n)$-primitive} if $f$ is $(m,n)$-splendid and there do not exist positive integers $a\le m$ and $b\le n$ with $(a,b)\neq (m,n)$ and $a \neq b$ such that $f$ is also $(a,b)$-splendid. Compute the number of ordered pairs $(m,n)$ of distinct positive integers less than $10000$ such that there exists a nonempty subset $S$ of $\mathbb R$ such that there exists an $(m,n)$-primitive function $f: S \rightarrow S$.
[i]Proposed by Vincent Huang[/i]
2. Find all natural $n>1$ for which value of the sum $2^2+3^2+...+n^2$ equals $p^k$ where p
is prime and k is natural
Find all $ f: Q^ \plus{} \to\ Z$ functions that satisfy $ f \left(\frac {1}{x} \right) \equal{} f(x)$ and $ (x \plus{} 1)f(x \minus{} 1) \equal{} xf(x)$ for all rational numbers that are bigger than 1.
For each positive integer $ n$, let $ c(n)$ be the largest real number such that
\[ c(n) \le \left| \frac {f(a) \minus{} f(b)}{a \minus{} b}\right|\]
for all triples $ (f, a, b)$ such that
--$ f$ is a polynomial of degree $ n$ taking integers to integers, and
--$ a, b$ are integers with $ f(a) \neq f(b)$.
Find $ c(n)$.
[i]Shaunak Kishore.[/i]
Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.
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.$$
Prove that there are infinitely many positive integers $n$ such that $2^{2^n+1}+1$ is divisible by $n$ but $2^n+1$ is not.
[i](Russia) Valery Senderov[/i]