Results 71 to 80 of about 134 (102)

Counting invertible sums of squares modulo $n$ and a new generalization of Euler's totient function

open access: green, 2015
Catalina Calderón   +3 more
openalex   +2 more sources

ON SUMS INVOLVING THE EULER TOTIENT FUNCTION

Bulletin of the Australian Mathematical Society, 2023
AbstractLet $\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})). $
Kiuchi, Isao, Tsuruta, Yuki
openaire   +2 more sources

Home - About - Disclaimer - Privacy