Found problems: 526
If $ a,b,c\in {\rm Z}$ and
\[ \begin{array}{l} {x\equiv a\, \, \, \pmod{14}} \\
{x\equiv b\, \, \, \pmod {15}} \\
{x\equiv c\, \, \, \pmod {16}} \end{array}
\]
, the number of integral solutions of the congruence system on the interval $ 0\le x < 2000$ cannot be
$\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ \text{None}$
Let $\Phi$ denote the Euler totient function. Prove that for infinitely many $k$ we have $\Phi (2^k+1) < 2^{k-1}$ and that for infinitely many $m$ one has $\Phi (2^m+1) > 2^{m-1}$
(a) Let $ n$ be a positive integer. Prove that there exist distinct positive integers $ x, y, z$ such that
\[ x^{n\minus{}1} \plus{} y^n \equal{} z^{n\plus{}1}.\]
(b) Let $ a, b, c$ be positive integers such that $ a$ and $ b$ are relatively prime and $ c$ is relatively prime either to $ a$ or to $ b.$ Prove that there exist infinitely many triples $ (x, y, z)$ of distinct positive integers $ x, y, z$ such that
\[ x^a \plus{} y^b \equal{} z^c.\]
Natural number $n>1$ is given. Let $I$ be a set of integers that are relatively prime to $n$. Define the function $f:I=>N$. We call a function $k-periodic$ if for any $a,b$ , $f(a)=f(b)$ whenever $ k|a-b $. We know that $f$ is $n-periodic$. Prove that minimal period of $f$ divides all other periods.
Example: if $n=6$ and $f(1)=f(5)$ then minimal period is 1, if $f(1)$ is not equal to $f(5)$ then minimal period is 3.
An ordered pair $(x, y)$ of integers is a primitive point if the greatest common divisor of $x$ and $y$ is $1$. Given a finite set $S$ of primitive points, prove that there exist a positive integer $n$ and integers $a_0, a_1, \ldots , a_n$ such that, for each $(x, y)$ in $S$, we have:
$$a_0x^n + a_1x^{n-1} y + a_2x^{n-2}y^2 + \cdots + a_{n-1}xy^{n-1} + a_ny^n = 1.$$
[i]Proposed by John Berman, United States[/i]
Suppose $\, q_{0}, \, q_{1}, \, q_{2}, \ldots \; \,$ is an infinite sequence of integers satisfying the following two conditions:
(i) $\, m-n \,$ divides $\, q_{m}-q_{n}\,$ for $\, m > n \geq 0,$
(ii) there is a polynomial $\, P \,$ such that $\, |q_{n}| < P(n) \,$ for all $\, n$
Prove that there is a polynomial $\, Q \,$ such that $\, q_{n}= Q(n) \,$ for all $\, n$.
We call a positive integer $n{}$ [i]peculiar[/i] if, for any positive divisor $d{}$ of $n{}$ the integer $d(d + 1)$ divides $n(n + 1).$ Prove that for any four different peculiar positive integers $A, B, C$ and $D{}$ the following holds:
\[\gcd(A, B, C, D) = 1.\]
Prove that for each positive integer $ n$, there are pairwise relatively prime integers $ k_0,k_1,\ldots,k_n$, all strictly greater than $ 1$, such that $ k_0k_1\ldots k_n\minus{}1$ is the product of two consecutive integers.
Let $P=A_1A_2\cdots A_k$ be a convex polygon in the plane. The vertices $A_1, A_2, \ldots, A_k$ have integral coordinates and lie on a circle. Let $S$ be the area of $P$. An odd positive integer $n$ is given such that the squares of the side lengths of $P$ are integers divisible by $n$. Prove that $2S$ is an integer divisible by $n$.
Let $n$ be the least positive integer for which $149^n - 2^n$ is divisible by $3^3 \cdot 5^5 \cdot 7^7$. Find the number of positive divisors of $n$.
Matt has somewhere between $1000$ and $2000$ pieces of paper he's trying to divide into piles of the same size (but not all in one pile or piles of one sheet each). He tries $2$, $3$, $4$, $5$, $6$, $7$, and $8$ piles but ends up with one sheet left over each time. How many piles does he need?
Let $n$ be a given positive integer. We say that a positive integer $m$ is [i]$n$-good[/i] if and only if there are at most $2n$ distinct primes $p$ satisfying $p^2\mid m$.
(a) Show that if two positive integers $a,b$ are coprime, then there exist positive integers $x,y$ so that $ax^n+by^n$ is $n$-good.
(b) Show that for any $k$ positive integers $a_1,\ldots,a_k$ satisfying $\gcd(a_1,\ldots,a_k)=1$, there exist positive integers $x_1,\ldots,x_k$ so that $a_1x_1^n+a_2x_2^n+\cdots+a_kx_k^n$ is $n$-good.
(Remark: $a_1,\ldots,a_k$ are not necessarily pairwise distinct)
[i]Proposed by usjl.[/i]
Prove that for any polynomial $P$ with real coefficients, and for any positive integer $n$, there exists a polynomial $Q$ with real coefficients such that $P(x)^2 +Q(x)^2$ is divisible by $(1+x^2)^n$.
Let $m\geq 2$ be an integer. A positive integer $n$ has the property that for any positive integer $a$ coprime with $n$, we have $a^m - 1\equiv 0 \pmod n$.
Prove that $n \leq 4m(2^m-1)$.
Created by Harazi, modified by Marian Andronache.
Find all triples $(x,y,z)$ of positive integers such that $x \leq y \leq z$ and
\[x^3(y^3+z^3)=2012(xyz+2).\]
Determine all positive integers $n$ for which there exists an integer $m$ such that ${2^{n}-1}$ is a divisor of ${m^{2}+9}$.
Find an arithmetic progression of $2016$ natural numbers such that neither is a perfect power but its multiplication is a perfect power.
Clarification: A perfect power is a number of the form $n^k$ where $n$ and $k$ are both natural numbers greater than or equal to $2$.
Let $\mathbb R$ be the set of real numbers. We denote by $\mathcal F$ the set of all functions $f\colon\mathbb R\to\mathbb R$ such that
$$f(x + f(y)) = f(x) + f(y)$$
for every $x,y\in\mathbb R$ Find all rational numbers $q$ such that for every function $f\in\mathcal F$, there exists some $z\in\mathbb R$ satisfying $f(z)=qz$.
Let $S$ be a set of integers (not necessarily positive) such that
(a) there exist $a,b \in S$ with $\gcd(a,b)=\gcd(a-2,b-2)=1$;
(b) if $x$ and $y$ are elements of $S$ (possibly equal), then $x^2-y$ also belongs to $S$.
Prove that $S$ is the set of all integers.
Let $f(x)$ be a non-constant polynomial with integer coefficients and $n,k$ be natural numbers. Show that there exist $n$ consecutive natural numbers $a,a+1,\ldots,a+n-1$ such that the numbers $f(a),f(a+1),\ldots,f(a+n-1)$ all have at least $k$ prime factors. (We say that the number $p_1^{\alpha_1}\cdots p_s^{\alpha_s}$ has $\alpha_1+\ldots+\alpha_s$ prime factors.)
[color=darkblue]Let $ M$ be a set of aritmetic progressions with integer terms and ratio bigger than $ 1$.
[b]a)[/b] Prove that the set of the integers $ \mathbb{Z}$ can be written as union of the finite number of the progessions from $ M$ with different ratios.
[b]b)[/b] Prove that the set of the integers $ \mathbb{Z}$ can not be written as union of the finite number of the progessions from $ M$ with ratios integer numbers, any two of them coprime.[/color]
There are $ 2010 $ people sitting around a round table. First, we give one person $ x $ a candy. Next, we give candies to $1$ st person, $1+2$ th person, $ 1+2+3$ th person, $\cdots$ , and $1+2+\cdots + 2009 $ th person clockwise from $ x $. Find the number of people who get at least one candy.
Prove that for each positive integer $ n$ there exist $ n$ consecutive positive integers none of which is an integral power of a prime number.
Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.)
[i]Proposed by Hong Kong[/i]
Let $d(n)$ denote the number of divisors of a positive integer $n$. If $k$ is a given odd number, prove that there exist an increasing arithmetic progression in positive integers $(a_1,a_2,\ldots a_{2019}) $ such that $gcd(k,d(a_1)d(a_2)\ldots d(a_{2019})) =1$