Timeline for Number of ways to choose + and - to make an equation correct
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 6, 2020 at 2:19 | answer | added | Antoine Labelle | timeline score: 4 | |
| Nov 6, 2020 at 1:34 | comment | added | Todd Trimble | @adamC If you want to delete, there's a button for that. If you can't use it for some reason, we can delete it for you. But please don't do it by manually destroying content. | |
| Nov 6, 2020 at 1:16 | review | Close votes | |||
| Nov 15, 2020 at 3:04 | |||||
| Nov 6, 2020 at 0:24 | comment | added | Arturo Magidin | Please do not remove all content from the question. | |
| Nov 6, 2020 at 0:23 | history | rollback | Arturo Magidin |
Rollback to Revision 2
|
|
| Nov 6, 2020 at 0:18 | review | Low quality posts | |||
| Nov 6, 2020 at 0:26 | |||||
| Nov 6, 2020 at 0:10 | history | edited | adamC | CC BY-SA 4.0 |
deleted 329 characters in body; edited title
|
| Nov 5, 2020 at 23:54 | comment | added | adamC | Yep! If I were to phrase it another way, how many ways can you choose $(c_1, ..., c_n) : c_i \in {-1, 1}$ and $\sum c_i \times a_i = b$ | |
| Nov 5, 2020 at 23:52 | comment | added | Ira Gessel | You might look at the Littlewood-Offord problem, en.wikipedia.org/wiki/Littlewood-Offord_problem. | |
| Nov 5, 2020 at 23:48 | comment | added | YCor | So, the sup over all $n$-tuples $(a_i)$ of nonzero elements and $b$, if I get it correctly. | |
| Nov 5, 2020 at 23:39 | comment | added | adamC | Forgot to mention that all $a_i$ must be non-zero. | |
| Nov 5, 2020 at 23:38 | history | edited | adamC | CC BY-SA 4.0 |
added 9 characters in body
|
| Nov 5, 2020 at 23:36 | comment | added | YCor | "The maximal": maximal over what? what is fixed and what is not fixed? if all $a_i$, and $b$ are zero, all $2^n$ choices of sign work. | |
| Nov 5, 2020 at 23:36 | review | First posts | |||
| Nov 6, 2020 at 2:20 | |||||
| Nov 5, 2020 at 23:30 | history | asked | adamC | CC BY-SA 4.0 |