On the bi-unitary analogues of Euler's arithmetical function and the gcd-sum function
Journal of integer sequences, Tome 12 (2009) no. 5
We give combinatorial-type formulae for the bi-unitary analogues of Euler's arithmetical function and the gcd-sum function and prove asymptotic formulae for the latter one and for another related function.
Classification :
11A25, 11N37, 05A15
Keywords: Euler's arithmetical function, M$\ddot $obius function, divisor function, gcd-sum function, unitary divisor, average order
Keywords: Euler's arithmetical function, M$\ddot $obius function, divisor function, gcd-sum function, unitary divisor, average order
@article{JIS_2009__12_5_a6,
author = {T\'oth, L\'aszl\'o},
title = {On the bi-unitary analogues of {Euler's} arithmetical function and the gcd-sum function},
journal = {Journal of integer sequences},
year = {2009},
volume = {12},
number = {5},
zbl = {1192.11005},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2009__12_5_a6/}
}
Tóth, László. On the bi-unitary analogues of Euler's arithmetical function and the gcd-sum function. Journal of integer sequences, Tome 12 (2009) no. 5. http://geodesic.mathdoc.fr/item/JIS_2009__12_5_a6/