Timeline for letter combinations to make words
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| May 7, 2013 at 20:14 | comment | added | Peter Taylor | @Griffin, you don't distinguish between them. That's the point. | |
| May 7, 2013 at 15:15 | comment | added | Howard | @Griffin I do not understand what you mean by your remark concerning distinguishability. Why do we need it for this question? And as PeterTaylor said - it makes complete sense to assume combination with repetition in this context. | |
| May 7, 2013 at 14:03 | comment | added | Griffin | Btw, combinations are defined on sets. | |
| May 7, 2013 at 14:02 | comment | added | Griffin |
How does one distinguish between {a,a} and {a,a} ?
|
|
| May 7, 2013 at 13:32 | comment | added | Peter Taylor | @Griffin, why not? Mathematical literature tends to be careful enough to say "combinations without repetitions" or "combinations with repetitions", but in this context it seems reasonable to understand "combinations with repetitions" (and all four current answers do). | |
| May 7, 2013 at 13:10 | comment | added | Griffin | Your combinations contain repeated characters (are not sets). I can't see how a combination of a bag makes sense. | |
| May 7, 2013 at 8:09 | history | edited | Howard | CC BY-SA 3.0 |
added 15 characters in body
|
| May 7, 2013 at 7:41 | history | edited | Howard | CC BY-SA 3.0 |
deleted 9 characters in body
|
| May 6, 2013 at 22:41 | comment | added | Peter Taylor | @DavidCarraher, the spec doesn't ask for more than one answer. It uses a singular noun more than once. | |
| May 6, 2013 at 21:02 | comment | added | DavidC | Your solution does not return all correct results. For example, you only list {O,P,S,T} for four letters. {A,L,E,S} and {A,T,E,S} are also correct answers. | |
| May 6, 2013 at 15:51 | history | answered | Howard | CC BY-SA 3.0 |