Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with recreational-mathematics
Search options not deleted
user 101078
Applications of mathematics for the design and analysis of games and puzzles
10
votes
Accepted
$3\times 3$ magic squares consisting of entries of a dense set $D\subseteq \mathbb{N}$
Yes.
By Szemerédi's theorem, your set contains an arithmetic progression of arbitrary length. In particular, it contains a progression of length 9, say it's $d_1,\ldots,d_9$. Then
$$
\begin{pmatrix}
d …
- 7,193