Some Two Color, Four Variable Rado Numbers
Abstract
There exists a minimum integer N such that any 2-coloring of \1,2,...,N\ admits a monochromatic solution to x+y+kz = w for k, ∈ Z+, where N depends on k and . We determine N when -k ∈ \0,1,2,3,4,5\, for all k, for which 1/2((-k)2-2)(-k+1)≤ k ≤ -4, as well as for arbitrary k when =2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.