Finite sums of arithmetic progressions

We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer’s theorem and Hindman’s theorem. We also give tower bounds for a finite version of it.