The 2-color Rado Number of x₁+x₂+\cdots +x_{m-1}=ax_m, II

Abstract: In the first installment of this series, we proved that, for every integer

a g e q 3

and every

m g e q 2 a^{2} - a + 2

, the 2-color Rado number of

x_{1} + x_{2} + c d o t s + x_{m - 1} = a x_{m}

is

l c e i l f r a c m - 1 a l c e i l f r a c m - 1 a c e i l c e i l

. Here we obtain the best possible improvement of the bound on

m .

We prove that if

3 | a

then the 2-color Rado number is

l c e i l f r a c m - 1 a l c e i l f r a c m - 1 a c e i l c e i l

when

m g e q 2 a + 1

but not when

m = 2 a,

and that if

3 m i d a

then the 2-color Rado number is

l c e i l f r a c m - 1 a l c e i l f r a c m - 1 a c e i l c e i l

when

m g e q 2 a + 2

but not when

m = 2 a + 1.

We also determine the 2-color Rado number for all

a g e q 3

and

m g e q f r a c a 2 + 1.

Recommendations

Cited in

(10)

This page was built for publication: The 2-color Rado Number of $x_1+x_2+\cdots +x_{m-1}=ax_m,$ II