Skip to main content

Timeline for Distance among integer set

Current License: CC BY-SA 4.0

11 events
when toggle format what by license comment
Jul 18, 2022 at 9:34 comment added Seva @huicj: $A$ is assumed to satisfy $|A-A|\le2|A|-1$, and $|A|=|A_0|+1$. Thus, $|A-A|-2\le2|A|-3=2|A_0|-1$.
Jul 18, 2022 at 8:19 comment added hui cj How can we get $|A-A|-2 \leq 2|A_0|-1$?
Jul 18, 2022 at 7:48 comment added Seva @huicj: I tried to explain that part of the (first) proof, hope is clear now.
Jul 18, 2022 at 7:47 history edited Seva CC BY-SA 4.0
added 162 characters in body
Jul 18, 2022 at 7:23 comment added hui cj The second one is clear to comprehend. I know what "Moreover, if A0 is a progression (the induction hypotheses), while A is not, then (A−A)∖(A0−A0) additionally contains the elements ±(an−a2)." means, but I still confused about how to deduce A is an arithmetic progression. Maybe I think we should demonstrate $⊆$ in $(A0−A0)∪{an−a1,a1−an}⊆A−A$ is equivalent to $=$? Can you expand a little about this? Thanks again!
Jul 18, 2022 at 6:23 history edited Seva CC BY-SA 4.0
added 528 characters in body
Jul 17, 2022 at 19:15 comment added Seva @huicj: $|S|$ is the number of elements of the set $S$. I updated the answer to address your second question.
Jul 17, 2022 at 19:14 history edited Seva CC BY-SA 4.0
added 492 characters in body
Jul 17, 2022 at 16:59 comment added hui cj Sorry, I can not figure out the what note | | means in your proof, and why the last equation means only arithmetic progression could be the answer?
Jul 17, 2022 at 16:15 comment added hui cj Thanks, that is exactly what I want to know!
Jul 17, 2022 at 15:46 history answered Seva CC BY-SA 4.0