0
Still curious? Ask our experts.
Chat with our AI personalities
Ross
Lao
ProfessorAdd your answer:
Earn +20 pts
How many bit strings with length not exceeding n where n is a positive integer consist entirely of 1's?
What a delightful little problemette ! It has to be the sum of the integers from 1 to 'n' . If 'n' is an even number, then that's n/2 times (n+1), (as in the young Gauss).
How many different bit strings are there of length 7?
The number of different bit strings of length 7 can be calculated using the formula 2^n, where n is the length of the bit string. In this case, with a length of 7, there are 2^7 = 128 different bit strings possible. This is because each bit in the string can have 2 possible values (0 or 1), and there are 7 bits in total.
How many bit strings of length 8 are there which begin with a 0 and end with a 0?
-- There are 256 bit strings of length 8 . -- There are 4 bit strings of length 2, and you've restricted 2 of the 8 bits to 1 of those 4 . -- So you've restricted the whole byte to 1/4 of its possible values = 64 of them.
Factor strings of 52 length?
2 x 2 x 13
What are the factor strings for 12?
The factor strings for 12 is 6*2 , 2*2*3, 4*3 if you are doing a chart than you put the length is how long the problem.
