English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In 1982, Beutelspacher and Brestovansky proved that for every integer $m\geq3,$ the 2-color Rado number of the equation $$x_1+x_2+...+x_{m-1}=x_m$$ is$m^2-m-1.$ In 2008, Schaal and Vestal proved that, for every $m\geq 6,$ the2-color Rado number of $$x_1+x_2+...+x_{m-1}=2x_m$$ is $\lceil\frac{m-1}{2}\lceil\frac{m-1}{2}\rceil\rceil.$ Here we prove that, for everyinteger $a\geq 3$ and every $m\geq 2a^2-a+2$, the 2-color Rado number of$$x_1+x_2+...+x_{m-1}=ax_m$$ is$\lceil\frac{m-1}{a}\lceil\frac{m-1}{a}\rceil\rceil.$ For the case $a=3,$ weshow that our formula gives the Rado number for all $m\geq 7,$ and we determinethe Rado number for all $m\geq 3.$

The 2-color Rado number of $x_1+x_2+...+x_{m-1}=ax_m$