ON SUMS INVOLVING THE EULER TOTIENT FUNCTION
Isao Kiuchi, YUKI TSURUTA
Abstract
Isao Kiuchi, YUKI TSURUTA
Abstract
Abstract Let $\gcd (n_{1},\ldots ,n_{k})$ denote the greatest common divisor of positive integers $n_{1},\ldots ,n_{k}$ and let $\phi $ be the Euler totient function. For any real number $x>3$ and any integer $k\geq 2$ , we investigate the asymptotic behaviour of $\sum _{n_{1}\ldots n_{k}\leq x}\phi (\gcd (n_{1},\ldots ,n_{k})). $
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract Let $\gcd (n_{1},\ldots ,n_{k})$ denote the greatest common divisor of positive integers $n_{1},\ldots ,n_{k}$ and let $\phi $ be the Euler totient function. For any real number $x>3$ and any integer $k\geq 2$ , we investigate the asymptotic behaviour of $\sum _{n_{1}\ldots n_{k}\leq x}\phi (\gcd (n_{1},\ldots ,n_{k})). $
Key concepts: Euler's totient function, Mathematics, Combinatorics, Euler's formula, Integer (computer science), Greatest common divisor, Function (biology), Arithmetic function