Sequences of low factor integers

Rok, strany: 2000, 139 - 142

At the 2nd Czech and Polish Conference in Number Theory, A. Schinzel stated the problem to find $4n$ consecutive integers each with a prime factor less or equal to $n$ [A. Schinzel: Problem 1, Annales Mathematicae Silesianae 12 (1998), 173]. This paper describes a simple algorithm that allows us to find such a sequence. The problem is extended to sequences of $k· n$ consecutive integers. Examples of the least $n$ found for $k=2,…,8$ are given.

ISO 690:

Jȩdrzejewski, J. 2000. Sequences of low factor integers. In Tatra Mountains Mathematical Publications, vol. 20, no.3, pp. 139-142. 1210-3195.

APA:

Jȩdrzejewski, J. (2000). Sequences of low factor integers. Tatra Mountains Mathematical Publications, 20(3), 139-142. 1210-3195.