• Bulletin of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1341-1354
• /
• 2021

Let r ≥ 2, and let k_i ≥ 2 for 1 ≤ i ≤ r. Mixed van der Waerden's theorem states that there exists a least positive integer w = w(k₁, k₂, k₃, …, k_r; r) such that for any n ≥ w, every r-colouring of [1, n] admits a k_i-term arithmetic progression with colour i for some i ∈ [1, r]. For k ≥ 3 and r ≥ 2, the mixed van der Waerden number w(k, 2, 2, …, 2; r) is denoted by w₂(k; r). B. Landman and A. Robertson [9] showed that for k < r < $\frac{3}{2}$(k - 1) and r ≥ 2k + 2, the inequality w₂(k; r) ≤ r(k - 1) holds. In this note, we establish some results on w₂(k; r) for 2 ≤ r ≤ k.