This is a game of 0s and 1s. flip the pancakes to generate a series of binary strings. the objective of the game is to make all the elements of the string 1. how many flips did it take you to turn all the sides of the pancakes red? can you calculate the minimum number of flips required to generate a string of all 1s using “n” number of pancakes? here is an interesting exercise for the mathematically inclined souls. you may already have noted that the string is of 2n length with n being the number of pancakes in the stack. convert the string into decimal system numbers. you will note that the string always starts with decimal 1. (0001=1 for a stack of 2, 000001=1 for a stack of 3 etc) when you reach your objective, that is when you turn all the elements to 1 you would have a decimal number 2^2n – 1. (1111=2^2.2-1 for a stack of 2, 111111=2^2.3-1 for a stack of 3) here is the interesting part. try to generate maximum number of integers between 1 to 2^2n-1. can you generate all integers?
Comments