Sequences of Low Factor Integers
by
David Jedelsky
University of Ostrava

On the 2nd Czech and Polish Conference on Number Theory professor Schinzel stated the problem to find the sequence of 4·n consecutive integers each with some prime factor less or equal to n [1]. We solve this problem with a simple algorithm. The algorithm is described with some discussion of the problem. Moreover, the problem is extended to sequences of k·n consecutive integers. Obtained results are presented, especially examples of smallest n found for k=2, ..., 8 are given.

1. Problem section, Annales Mathematicae Silesianae 12 (1998), page 173

Date received: April 19, 1999

Copyright © 1999 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cacf-41.