A Gcd-Sum Function Over Regular Integers Modulo n
László Tóth
Institute of Mathematics and Informatics
University of Pécs
Ifjúság u. 6
7624 Pécs
Hungary
Abstract:
We introduce a gcd-sum function involving regular integers (mod n)
and prove results giving its minimal order, maximal order and average
order.
Full version: pdf,
dvi,
ps,
latex
(Concerned with sequences
A055653 and
A018804.)
Received October 6 2008;
revised version received January 21 2009.
Published in Journal of Integer Sequences, February 13 2009.
Return to
Journal of Integer Sequences home page