Loading the lesson
Loading the lesson
Search AllRounder.ai
Search the courses, subjects, tracks, games and features, or jump straight to a page.
Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
What is a bad binary string?
Think about the definition of bad strings.
How many binary strings are there of length 1?
Count the combinations.
What defines a bad string?
Consider the definition.
Is g(n) defined as the count of good strings?
Recall the definitions.
Prove that f(n) is equal to 2^n - g(n) for n > 2.
Start with base cases like n=3 and n=4.
Calculate the number of bad strings for n=5.
Remember to sum prior g(n) values and recalculate 2^5.
4 more questions in this section. Enroll free to practise them all.
Enroll free