Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The Van der Waerden number $w(l,k)$ is the least $n$ such that for every $k$-coloring of $[n]$ has a monochromatic $l$-term arithmetic progression. Prove that $w(l,k)>(lk^{l-1})^{1/2}$

Give some hints.

share|cite|improve this question
This looks like a job for the probabilistic method. – Chris Eagle Jan 29 '13 at 19:10
Yes, what's more details? – user60134 Jan 29 '13 at 19:13
The question begs for a please... – Sasha Jan 29 '13 at 19:14
What makes you think I have any more details? And what happened to wanting "hints"? – Chris Eagle Jan 29 '13 at 19:14

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.