Given an integer base $q\ge 2$ and a completely $q$-additive arithmetic function $f$ taking integer values, we deduce an asymptotic expression for the counting function$$N_f\left(x\right)=\#\left\{0\le n\<x\left|f\right(n)\mid n\right\}$$under a mild restriction on the values of $f$. When $f=s_q$, the base $q$ sum of digits function, the integers counted by $N_f$ are the so-called base $q$ Niven numbers, and our result provides a generalization of the asymptotic known in that case.

Let $S=\{x_1,\cdots ,x_n\}$ be a set of $n$ distinct positive integers and $e\ge 1$ an integer. Denote the $n\times n$ power GCD (resp. power LCM) matrix on $S$ having the $e$-th power of the greatest common divisor $(x_i,x_j)$ (resp. the $e$-th power of the least common multiple $[x_i,x_j]$) as the $(i,j)$-entry of the matrix by $\left({(x_i,x_j)}^e\right)$ (resp. $\left({[x_i,x_j]}^e\right))$. We call the set $S$ an odd gcd closed (resp. odd lcm closed) set if every element in $S$ is an odd number and $(x_i,x_j)\in S$ (resp. $[x_i,x_j]\in S$) for all $1\le i,j\le n$. In studying the divisibility of the power LCM and power GCD matrices, Hong conjectured in 2004 that...

In this paper we investigate the solutions of the equation in the title, where $\phi$ is the Euler function. We first show that it suffices to find the solutions of the above equation when $m=4$ and $x$ and $y$ are coprime positive integers. For this last equation, we show that aside from a few small solutions, all the others are in a one-to-one correspondence with the Fermat primes.

For a positive integer $n$ we write $\phi \left(n\right)$ for the Euler function of $n$. In this note, we show that if $b>1$ is a fixed positive integer, then the equation $$\phi \left(x\frac{b^n-1}{b-1}\right)=y\frac{b^m-1}{b-1},\text{where}x,y\in \{1,...,b-1\},$$ has only finitely many positive integer solutions $(x,y,m,n)$.