For positive integers and , let be the minimum integer such that any -coloring ${1,2,…,n} \to {1,2,…,s}k_iii1 \leq i \leq sk_1=k_2=…=k_s=kw(k;s)$. That such a minimum integer exists follows from van der Waerden’s theorem on arithmetic progressions. In the present paper we give a lower bound for for each fixed . We include a table with values of which match this lower bound closely for . We also give an upper bound for , an upper bound for , and a lower bound for for an arbitrary fixed . We discuss a number of other functions that are closely related to the van der Waerden function.

生成讲解博客的中文版本

生成AI智能校验的中文版本