Vol. 3, No. 3, 2010

Download this article
Download this article For screen
For printing
Recent Issues

Volume 17
Issue 5, 723–899
Issue 4, 543–722
Issue 3, 363–541
Issue 2, 183–362
Issue 1, 1–182

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Editors' interests
 
Subscriptions
 
ISSN 1944-4184 (online)
ISSN 1944-4176 (print)
 
Author index
To appear
 
Other MSP journals
Distinct solution to a linear congruence

Donald Adams and Vadim Ponomarenko

Vol. 3 (2010), No. 3, 341–344
Abstract

Given n,k and a1,a2,,ak n, we give conditions for the equation a1x1 + a2x2 + + akxk = 1 in n to admit solutions with all the xi distinct.

A sufficient condition is that k ϕ(n) and ai be invertible in n for all i.

If n > 2 is prime, the following conditions together are necessary and sufficient: k n, each ai is nonzero, and either k < n or not all of the ai are equal.

Keywords
linear congruence, minimal zero-sum sequence, property B
Mathematical Subject Classification 2000
Primary: 11B50, 11D79
Milestones
Received: 7 July 2010
Revised: 29 September 2010
Accepted: 29 September 2010
Published: 16 October 2010

Proposed: Scott Chapman
Communicated by Scott Chapman
Authors
Donald Adams
Arizona State University
Tempe, AZ 85287-1804
United States
Vadim Ponomarenko
San Diego State University
Department of Mathematics and Statistics
5500 Campanile Dr.
San Diego, CA 92182-7720
United States
http://www-rohan.sdsu.edu/~vadim/