Found problems: 71
For all positive integers $n$, prove that there are integers $x, y$ relatively prime to $5$ such that $x^2 + y^2 = 5^n$.
Let $p$ be a given prime. For each prime $r$, we defind the function as following $F(r) =\frac{(p^{rp} - 1) (p - 1)}{(p^r - 1) (p^p - 1)}$.
1. Show that $F(r)$ is a positive integer for any prime $r \ne p$.
2. Show that $F(r)$ and $F(s)$ are coprime for any primes $r$ and $s$ such that $r \ne p, s \ne p$ and $r \ne s$.
3. Fix a prime $r \ne p$. Show that there is a prime divisor $q$ of $F(r)$ such that $p| q - 1$ but $p^2 \nmid q - 1$.
Given an integer $a>1$. Prove that there exists a sequence of positive integers
\[ n_1, n_2, n_3, \ldots \]
Such that
\[ \gcd(a^{n_i+1} + a^{n_i} - 1, \ a^{n_j + 1} + a^{n_j} - 1) =1 \] For every $i \neq j$.
For arbitrary positive integers $a, b$, denote $a @ b =\frac{a-b}{gcd(a,b)}$
Let $n$ be a positive integer. Prove that the following conditions are equivalent:
(i) $gcd(n, n @ m) = 1$ for every positive integer $m < n$,
(ii) $n = p^k$ where $p$ is a prime number and $k$ is a non-negative integer.
Let $a,b,c$ be coprime nonzero integers. Prove that for any coprime integers $u,v,w$ with $au+bv+cw = 0$ there exist integers $m,n, p$ such that $$\begin{cases} a = nw- pv \\ b = pu-mw \\ c = mv-nu \end{cases}$$
The integers $a$, $b$, $c$ and $d$ are such that $a$ and $b$ are relatively prime, $d\leq 2022$ and $a+b+c+d = ac + bd = 0$. Determine the largest possible value of $d$,
Find the largest $k$ such that for every positive integer $n$ we can find at least $k$ numbers in the set $\{n+1, n+2, ... , n+16\}$ which are coprime with $n(n+17)$.
Given an integer $n > 1$, let $1 = a_1 < a_2 < \cdots < a_t = n - 1$ be all positive integers less than $n$ that are coprime to $n$. Find all $n$ such that there is no $i \in \{1, 2, \ldots , t - 1\}$ satisfying $3 | a_i + a_{i+1}$.
Show that if $15$ numbers lie between $2$ and $1992$ and each pair is coprime, then at least one is prime.
Let $n$ be a positive integer and $A$ a set containing $8n + 1$ positive integers co-prime with $6$ and less than $30n$. Prove that there exist $a, b \in A$ two different numbers such that $a$ divides $b$.
We have $n$ positive integers greater than $1$ and less than $10000$ such that neither of them is prime but any two of them are relative prime. Find the maximum value of $n $.
Three natural numbers are such that the product of any two of them is divided by the sum of these two numbers. Prove that these three numbers have a common divisor greater than one.
Let $f(x)$ be a polynomial with integer coefficients, for which there exist $a,b\in \mathbb{Z}$ ($a\neq b$), such that $f(a)$ and $f(b)$ are coprime. Prove that there exist infinitely many values for $x$, such that each $f(x)$ is coprime with any other.
Consider the natural number prime $p, p> 5$. From the decimal number $\frac1p$, randomly remove $2012$ numbers, after the comma. Show that the remaining number can be represented as $\frac{a}{b}$ , where $a$ and $b$ are coprime numbers , and $b$ is multiple of $p$.
Let $x, y$ be positive integers such that $gcd(x, y) = 1$ and $x + 3y^2$ is a perfect square. Prove that $x^2 + 9y^4$ can't be a perfect square.
Find all natural numbers $n$ for which $1^{\phi (n)} + 2^{\phi (n)} +... + n^{\phi (n)}$ is coprime with $n$.
$(FRA 1)$ Let $a$ and $b$ be two nonnegative integers. Denote by $H(a, b)$ the set of numbers $n$ of the form $n = pa + qb,$ where $p$ and $q$ are positive integers. Determine $H(a) = H(a, a)$. Prove that if $a \neq b,$ it is enough to know all the sets $H(a, b)$ for coprime numbers $a, b$ in order to know all the sets $H(a, b)$. Prove that in the case of coprime numbers $a$ and $b, H(a, b)$ contains all numbers greater than or equal to $\omega = (a - 1)(b -1)$ and also $\frac{\omega}{2}$ numbers smaller than $\omega$
Find all positive integers that can be written in the following way $\frac{b}{a}+\frac{c}{a}+\frac{c}{b}+\frac{a}{b}+\frac{a}{c}+\frac{b}{c}$ .
Also, $a,b, c$ are positive integers that are pairwise relatively prime.
Let $n \ge 2$ be an integer and $p_1 < p_2 < ... < p_n$ prime numbers. Prove that there exists an integer $k$ relatively prime with $p_1p_2... p_n$ and such that $gcd (k + p_1p_2...p_i, p_1p_2...p_n) = 1$ for all $i = 1, 2,..., n - 1$.
Malik Talbi
Prove that two natural numbers whose digits are all ones are relatively prime if and only if the numbers of their digits are relatively prime.
Determine all the triples $\{a, b, c \}$ of positive integers coprime (not necessarily pairwise prime) such that $a + b + c$ simultaneously divides the three numbers $a^{12} + b^{12}+ c^{12}$, $ a^{23} + b^{23} + c^{23} $ and $ a^{11004} + b^{11004} + c^{11004}$
Given an integer number $n \ge 3$, show that the number of lists of jointly coprime positive integer numbers that sum to $n$ is divisible by $3$.
(For instance, if $n = 4$, there are six such lists: $(3, 1), (1, 3), (2, 1, 1), (1, 2, 1), (1, 1, 2)$ and $(1, 1, 1, 1)$.)
We want to partition the integers $1, 2, 3, . . . , 100$ into several groups such that within each group either any two numbers are coprime or any two are not coprime. At least how many groups are needed for such a partition?
[i]We call two integers coprime if they have no common divisor greater than $1$.[/i]
Prove that there exists an infinite sequence of perfect squares with the following properties:
(i) The arithmetic mean of any two consecutive terms is a perfect square,
(ii) Every two consecutive terms are coprime,
(iii) The sequence is strictly increasing.
For a natural number $m>1$ we'll denote with $f(m)$ the sum of all natural numbers less than $m$, which are also coprime to $m$. Find all natural numbers $n$, such that there exist natural numbers $k$ and $\ell$ which satisfy $f(n^{k})=n^{\ell}$.