Английская Википедия:Erdős–Woods number

Материал из Онлайн справочника
Перейти к навигацииПерейти к поиску

Шаблон:Short description In number theory, a positive integer Шаблон:Mvar is said to be an Erdős–Woods number if it has the following property: there exists a positive integer Шаблон:Mvar such that in the sequence Шаблон:Math of consecutive integers, each of the elements has a non-trivial common factor with one of the endpoints. In other words, Шаблон:Mvar is an Erdős–Woods number if there exists a positive integer Шаблон:Mvar such that for each integer Шаблон:Mvar between Шаблон:Math and Шаблон:Mvar, at least one of the greatest common divisors Шаблон:Math or Шаблон:Math is greater than Шаблон:Math.

Examples

The first Erdős–Woods numbers are

16, 22, 34, 36, 46, 56, 64, 66, 70, 76, 78, 86, 88, 92, 94, 96, 100, 106, 112, 116Шаблон:OEIS.

History

Investigation of such numbers stemmed from the following prior conjecture by Paul Erdős:

There exists a positive integer Шаблон:Mvar such that every integer Шаблон:Mvar is uniquely determined by the list of prime divisors of Шаблон:Math.

Alan R. Woods investigated this question for his 1981 thesis. Woods conjectured[1] that whenever Шаблон:Math, the interval Шаблон:Math always includes a number coprime to both endpoints. It was only later that he found the first counterexample, Шаблон:Math, with Шаблон:Math. The existence of this counterexample shows that 16 is an Erdős–Woods number.

Шаблон:Harvtxt proved that there are infinitely many Erdős–Woods numbers,[2] and Шаблон:Harvtxt showed that the set of Erdős–Woods numbers is recursive.[3]

References

Шаблон:Reflist

External links

Шаблон:Classes of natural numbers