Playing with the Szemerédi's theorem

Number Theory Level pending

The Szemeredi's theorem states that, for every strictly positive integer k k and real number 0 < δ 1 2 0 < \delta \le \frac 12 , there exists a positive integer N = N ( k , δ ) N = N(k, \delta) such that every subset of { 1 , 2 , . . . , N } \{1, 2, ..., N\} of size at least N × δ N \times \delta contains an arithmetic progression of length k k .

For a given k k , a given δ \delta and N N the smallest possible number that satisfies the statement above, is N × δ N \times \delta an integer?

Yes, it's always right. No, it's always false when k = 2. No, there is one exception. No, it's always false.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...