2012/05/24 by Robert J. Betts, Betts, Robert J.
Mathematics · #11P99 (Primary) 68R01 (Secondary) #Algebraic Geometry and Number Theory #Analytic Number Theory Research #FOS: Mathematics #Limits and Structures in Graph Theory #Number Theory (math.NT) #math.NT #msc:11P99 #msc:68R01
paper · pdf · doi:10.48550/arxiv.1205.5498
Withdrawn for a rewrite after comments by reviewer
openalex publication_date 2012/05/24 · arxiv created 2012/08/22 · arxiv updated 2012/08/24 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
Here we answer a conjecture by Ron Graham about getting finer upper bounds for van der Waerden numbers in the affirmative, but without the application of double induction or combinatorics as applied to sets of integers that contain some van der Waerden number as an element. Rather we obtain the result solely by exploiting certain properties of any integer greater than one that is divisible by another integer. Our mathematical methods are easily accessible by those whose field of specialization lies outside of combinatorial number theory, such as discrete mathematics, elementary number theory or analytic number theory.