Timeline for Getting number of binary digits combinations without "forbidden" patterns
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Nov 13, 2014 at 11:14 | history | suggested | Adrian | CC BY-SA 3.0 | clearer problem formulation |
| Nov 13, 2014 at 11:02 | review | Suggested edits | |||
| S Nov 13, 2014 at 11:14 | |||||
| Nov 14, 2012 at 3:54 | answer | added | halirutan | timeline score: 8 | |
| Nov 13, 2012 at 16:36 | vote | accept | CommunityBot | ||
| Nov 13, 2012 at 13:39 | answer | added | Dr. belisarius | timeline score: 16 | |
| Nov 13, 2012 at 12:36 | answer | added | kglr | timeline score: 2 | |
| Nov 13, 2012 at 12:26 | comment | added | image_doctor | The number of fixed digits, m, in a non-overlapping pattern of length, n, reduces the available combinations by an amount 2^(n-m). Finding the set of non-overlapping patterns, e.g. x1xxx0xx and x1xxx0x0 overlap, should compute the remaining available patterns. | |
| Nov 13, 2012 at 12:10 | answer | added | cormullion | timeline score: 1 | |
| Nov 13, 2012 at 12:07 | answer | added | jVincent | timeline score: 2 | |
| Nov 13, 2012 at 11:19 | history | edited | Sjoerd C. de Vries | CC BY-SA 3.0 | added 8 characters in body |
| Nov 13, 2012 at 10:45 | history | edited | user4449 | CC BY-SA 3.0 | deleted 26 characters in body |
| Nov 13, 2012 at 10:43 | history | tweeted | twitter.com/#!/StackMma/status/268303285449015296 | ||
| Nov 13, 2012 at 10:21 | review | First posts | |||
| Nov 13, 2012 at 11:30 | |||||
| Nov 13, 2012 at 10:18 | history | edited | user4449 | CC BY-SA 3.0 | added 95 characters in body |
| Nov 13, 2012 at 10:11 | history | edited | user4449 | CC BY-SA 3.0 | deleted 1 characters in body |
| Nov 13, 2012 at 10:02 | history | asked | user4449 | CC BY-SA 3.0 |