• Communications of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.355-364
• /
• 2023

In this paper, we investigate the sums of the elements in the finite set $\{x^k:1{\leq}x{\leq}{\frac{n}{m}},\;gcd_u(x,n)=1\}$, where k, m and n are positive integers and gcd_u(x, n) is the unitary greatest common divisor of x and n. Moreover, for some cases of k and m, we can give the explicit formulae for the sums involving some well-known arithmetic functions.

• East Asian mathematical journal
• /
• v.31 no.3
• /
• pp.357-362
• /
• 2015

For a ring R of imaginary quadratic integers, using a concept of a unitary number system in place of the Motzkin's universal side divisor, we show that the following statements are equivalent: (1) R is Euclidean. (2) R has a unitary number system. (3) R is norm-Euclidean. Through an application of the above theorem we see that R admits binary or ternary number systems if and only if R is Euclidean.