Zentralblatt MATH
Publications of (and about) Paul Erdös
Zbl.No: 332.10002
Autor: Eggleton, R.B.; Erdös, Paul; Selfridge, J.L.
Title: Computation of sequences maximizing least common multiples. (In English)
Source: Proc. 5th Manitoba Conf. numer. Math., Winnipeg 1975, 293-303 (1976).
Review: [For the entire collection see Zbl 327.00009.]
Let k,n be positive integers in the intervals 1 \leq k \leq \pi (n), 1 \leq n \leq 100, where \pi (n) is the number of primes up to n. For each pair k,n we specify one of the k-sets of positive integers up to n, with the property that its least common multiple is maximum. For each n, the specification takes the form of a sequence of integers and ``cancellative terms''; each k-set can immediately be read off once the sequence is given.
Classif.: * 11-04 Machine computation, programs (number theory)
11A05 Multiplicative structure of the integers
11B99 Sequences and sets
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag