All Questions
3 questions
19
votes
4
answers
867
views
Size of sets with complete double
Let $[n]$ denote the set $\{0,1,...,n\}$. A subset $S\subseteq [n]$ is said to have complete double if $S+S=[2n]$. Let $m(n)$ be the smallest size of a subset of $[n]$ with complete double. My ...
3
votes
3
answers
498
views
How to find an integer set, s.t. the sums of at most 3 elements are all distinct?
How to find a set $A \subset \mathbb{N}$ such that any sum of at most three Elements $a_i \in A$ is different if at least one element in the sum is different.
Example with $|A|=3$: Out of the set $A :...
4
votes
1
answer
156
views
$B_k[1]$ sets with smallest possible $m = \max B_k[1]$ for given $k$ and $n = \lvert B_k[1]\rvert$ elements
Sidon sets are sets $A \subset \mathbb{N}$ such that for all $a_j,b_j \in A$ holds
$$a_1+a_2=b_1+b_2 \iff \{a_1,a_2\}=\{b_1,b_2\}.$$
Thus if you know the sum of two elements, you know which elements ...