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 sidon-sets
Search options answers only
not deleted
user 2233
7
votes
How to find an integer set, s.t. the sums of at most 3 elements are all distinct?
Note that there is a bit of a discrepancy between $B_3[1]$ sets and your notion. For $B_3[1]$ sets, one considers sums with exactly 3 elements, instead of at most 3 elements. However, I do not think …
- 32.1k