jump to navigation

Problem of the Day #343: Counting Binary Strings February 25, 2012

Posted by Alex in : potd , trackback

A binary string is a string where each character is either a ’0′ or a ’1′. How many binary strings are there of length $100,000$ that contain none of $\{001, 100, 1110, 1010\}$ as a substring?

Comments»

1. Albert - February 26, 2012

Hey, nice problem!