Runs of integers with equally many distinct prime factors | NOVA. The University of Newcastle's Digital Repository

Home

Description	Size	Format
Author final version	162 KB	Adobe Acrobat PDF	View/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/933758

Title: Runs of integers with equally many distinct prime factors
Author/Creator: Eggleton, Roger B.; Kimberley, Jason S.; MacDougall, James A.
Description: We survey and update data on runs of consecutive integers each having exactly r distinct prime factors (briefly, of principal rank r). For 3 ≤ r ≤ 64 and other sporadic values, lower bounds are given for the size of longest runs of consecutive integers of principal rank r, together with upper bounds on the first occurrence of such runs. We also prove that there are infinitely many pairs of consecutive integers of principal rank r, for each r ≥ 3.
Relation: Bulletin of the Institute of Combinatorics and its Applications Vol. 64, p. 30-38
Relation: http://www.theica.org
Date: 2012
Publisher: Institute of Combinatorics and its Applications
Keyword(s): 11A51; factorisation; consecutive integers; sieve methods; Chinese Remainder Theorem
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/933758
Identifier: ISSN:1183-1278
Language: eng

28 Visitors

35 Hits

NOVA. The University of Newcastle's Digital Repository