Vol. 55, No. 1, 1974

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 294: 1
Vol. 293: 1  2
Vol. 292: 1  2
Vol. 291: 1  2
Vol. 290: 1  2
Vol. 289: 1  2
Vol. 288: 1  2
Vol. 287: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Subscriptions
Editorial Board
Officers
Special Issues
Submission Guidelines
Submission Form
Contacts
Author Index
To Appear
 
ISSN: 0030-8730
Linear GCD equations

David Jacobson

Vol. 55 (1974), No. 1, 177–193
Abstract

Let R be a GCD domain. Let A be an m×n matrix and B an m× 1 matrix with entries in R. Let c0,d R. We consider the linear GCD equation GCD(AX + B,c) = d. Let S denote its set of solutions. We prove necessary and sufficient conditions that S be nonempty. An element t in R is called a solution modulus if X + tRn S whenever X S. We show that if c∕d is a product of prime elements of R, then the ideal of solution moduli is a principal ideal of R and its generator t0 is determined. When R∕t0R is a finite ring, we derive an explicit formula for the number of distinct solutions ( mod t0) of GCD(AX + B,c) = d.

Mathematical Subject Classification 2000
Primary: 13G05
Secondary: 10B05
Milestones
Received: 22 February 1974
Revised: 3 September 1974
Published: 1 November 1974
Authors
David Jacobson