Determination of the two-color Rado number for a₁x₁+...+a_mx_m=x₀

Abstract: For positive integers

a_{1}, a_{2}, ..., a_{m}

, we determine the least positive integer

R (a_{1}, ..., a_{m})

such that for every 2-coloring of the set

[1, n] = 1, ..., n

with

n g e R (a_{1}, ..., a_{m})

there exists a monochromatic solution to the equation

a_{1} x_{1} + ... + a_{m} x_{m} = x_{0}

with

x_{0}, ..., x_{m} i n [1, n]

. The precise value of

R (a_{1}, ..., a_{m})

is shown to be

a v^{2} + v - a

, where

a = m i n a_{1}, ..., a_{m}

and

v = s u m_{i = 1}^{m} a_{i}

. This confirms a conjecture of B. Hopkins and D. Schaal.

This page was built for publication: Determination of the two-color Rado number for $a_1x_1+...+a_mx_m=x_0$