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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In the first installment of this series, we proved that, for every integer$a\geq 3$ and every $m\geq 2a^2-a+2$, the 2-color Rado number of $x_1 + x_2 +\cdots + x_{m-1} = ax_m$ is $\lceil\frac{m-1}{a} \lceil\frac{m-1}{a}\rceil\rceil$. 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$\lceil\frac{m-1}{a} \lceil\frac{m-1}{a} \rceil\rceil$ when $m\geq 2a+1$ butnot when $m=2a,$ and that if $3\nmid a$ then the 2-color Rado number is$\lceil\frac{m-1}{a} \lceil\frac{m-1}{a} \rceil\rceil$ when $m\geq 2a+2$ butnot when $m=2a+1.$ We also determine the 2-color Rado number for all $a\geq 3$and $m\geq \frac{a}{2}+1.$

The 2-color Rado Number of $x_1+x_2+\cdots +x_{m-1}=ax_m,$ II