Found problems: 8
$(FRA 6)$ Consider the integer $d = \frac{a^b-1}{c}$, where $a, b$, and $c$ are positive integers and $c \le a.$ Prove that the set $G$ of integers that are between $1$ and $d$ and relatively prime to $d$ (the number of such integers is denoted by $\phi(d)$) can be partitioned into $n$ subsets, each of which consists of $b$ elements. What can be said about the rational number $\frac{\phi(d)}{b}?$
For a natural number $x$ we define $f(x)$ to be the sum of all natural numbers less than $x$ and coprime with it. Let $m$ and $n$ be some natural numbers where $n$ is odd. Prove that there exist $x$, which is a multiple of $m$ and for which $f(x)$ is a perfect n-th power.
Let $ \,n > 6\,$ be an integer and $ \,a_{1},a_{2},\cdots ,a_{k}\,$ be all the natural numbers less than $ n$ and relatively prime to $ n$. If
\[ a_{2} \minus{} a_{1} \equal{} a_{3} \minus{} a_{2} \equal{} \cdots \equal{} a_{k} \minus{} a_{k \minus{} 1} > 0,
\]
prove that $ \,n\,$ must be either a prime number or a power of $ \,2$.
Find all pairs of $ (a, n) $ natural numbers such that $ \varphi (a ^ n + n) = 2 ^ n. $
($ \varphi (n) $ is the Euler function, that is, the number of integers from $1$ up to $ n $, relative prime to $ n $)
Let $k$ be a positive integer. A sequence $a_0,a_1,...,a_n,n>0$ of positive integers satisfies the following conditions:
$(i)$ $a_0=a_n=1$;
$(ii)$ $2\leq a_i\leq k$ for each $i=1,2,...,n-1$;
$(iii)$For each $j=2,3,...,k$, the number $j$ appears $\phi(j)$ times in the sequence $a_0,a_1,...,a_n$, where $\phi(j)$ is the number of positive integers that do not exceed $j$ and are coprime to $j$;
$(iv)$For any $i=1,2,...,n-1$, $\gcd(a_i,a_{i-1})=1=\gcd(a_i,a_{i+1})$, and $a_i$ divides $a_{i-1}+a_{i+1}$.
Suppose there is another sequence $b_0,b_1,...,b_n$ of integers such that $\frac{b_{i+1}}{a_{i+1}}>\frac{b_i}{a_i}$ for all $i=0,1,...,n-1$. Find the minimum value of $b_n-b_0$.
$(FRA 6)$ Consider the integer $d = \frac{a^b-1}{c}$, where $a, b$, and $c$ are positive integers and $c \le a.$ Prove that the set $G$ of integers that are between $1$ and $d$ and relatively prime to $d$ (the number of such integers is denoted by $\phi(d)$) can be partitioned into $n$ subsets, each of which consists of $b$ elements. What can be said about the rational number $\frac{\phi(d)}{b}?$
$a)$ Let $m$ and $n$ be positive integers. If $m>1$ prove that $ n \mid \phi(m^n-1)$ where $\phi$ is Euler function
$b)$ Prove that number of elements in sequence $1,2,...,n$ $(n \in \mathbb{N})$, which greatest common divisor with $n$ is $d$, is $\phi\left(\frac{n}{d}\right)$
Let $ \,n > 6\,$ be an integer and $ \,a_{1},a_{2},\cdots ,a_{k}\,$ be all the natural numbers less than $ n$ and relatively prime to $ n$. If
\[ a_{2} \minus{} a_{1} \equal{} a_{3} \minus{} a_{2} \equal{} \cdots \equal{} a_{k} \minus{} a_{k \minus{} 1} > 0,
\]
prove that $ \,n\,$ must be either a prime number or a power of $ \,2$.