Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T07:17:21.792Z Has data issue: false hasContentIssue false

Square-Reduced Residue Systems (Mod r) and Related Arithmetical Functions

Published online by Cambridge University Press:  20 November 2018

R. Sivaramakrishnan*
Affiliation:
Department of Mathematics, University of Calicut, Kerala 673635, India
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We define a square-reduced residue system (mod r) as the set of integers a (mod r) such that the greatest common divisor of a and r, denoted by (a, r), is a perfect square ≥ 1 and contained in a residue system (mod r). This leads to a Class-division of integers (mod r) based on the 'square-free' divisors of r. The number of elements in a square-reduced residue system (mod r) is denoted by b(r). It is shown that

(1)

(2)

In view of (2), b(r) is said to be 'specially multiplicative'. The exponential sum associated with a square-reduced residue system (mod r) is defined by

where the summation is over a square-reduced residue system (mod r).

B(n, r) belongs to a new class of multiplicative functions known as 'Quasi-symmetric functions' and

(3)

As an application, the sum is considered in terms of the Cauchy-composition of even functions (mod r). It is found to be multiplicative in r. The evaluation of the above sum gives an identity involving Pillai's arithmetic function

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1979