An enumeration of the sets of non-interfering arithmetic progressions with specified periods
- Fay, Edward A.
Publication date
May 1967
DOI Publisher
Published by Elsevier Inc. ISSN
0021-9800Abstract
AbstractLet a positive integer n and an ordered n-tuple b={b1, b2, …, bn} of positive integers be given. Let G0 be the set of all b1b2 … bn possible choices of an ordered n-tuple a={a1, a2, …, an} of integers such that 0≦ai<bi, i=1,2, …, n. Let T be the subset of G0 consisting of those a satisfying the additional conditions aixxxaj mod(bi, bj); i, j=1,2, …, n, i<j; where (bi, bj) is the greatest common divisor of bi and bj. Concepts from the most elementary portions of number theory, group theory, combinatorial analysis, and graph theory are used to develop a rule for determining the size of T
Add to ORKG