Timeline for Number of subset sums
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 22, 2010 at 0:47 | comment | added | Gerry Myerson | @Marcos, OK, so when you wrote, "A more concrete question is," you meant, "Another way of asking the same question is," and when you used the word, "summands," that's not really what you meant. | |
| Jul 21, 2010 at 11:05 | comment | added | Marcos Villagra | What I mean is how many summations with $k$ terms equals $s$? So $k$ is fixed, and clearly $k < n$. | |
| Jul 21, 2010 at 11:03 | vote | accept | Marcos Villagra | ||
| Jul 21, 2010 at 10:32 | comment | added | Gerry Myerson | What do you mean, "how many summands does it have"? Do you mean, what is the value of $k$? But if there are many solutions, presumably there will be different values of $k$. | |
| Jul 21, 2010 at 10:06 | history | edited | darij grinberg | CC BY-SA 2.5 |
trivial typo fix
|
| Jul 21, 2010 at 9:10 | answer | added | falagar | timeline score: 5 | |
| Jul 21, 2010 at 8:31 | history | asked | Marcos Villagra | CC BY-SA 2.5 |