Problem A
Usually the number of bits in a byte is 8 or 16 or 32 and recently 64. You don't have to write a formula to restrict it to this number of bits. You are not asked to do so. The general formula is 2^n - 1 for the problem of Millie and her golden keys. Somehow the system can be made to choose the right number of bits. Apple IIe s for example, used 8 bits and there was a location that told the processor that fact.
2^n - 1 <<<<< Answer
Problem B
In this case n = 4
2^n - 1 = 2^4 - 1 = 16 - 1 = 15
Millie can collect 15 keys <<<<<< Answer
15b is the answer to this question hope this was helpful
X = 12
because if you notice, each of the angles have a little arc in the corner, which means they are congruent. if all three angles are congruent, that means each angle is 60° because each triangle has a maximum value of 180°. therefore, this means it is an equilateral triangle.
that being said, each side must be equal as well. so, you can use any two sides to find x by using each one on a different side of an equation, then isolating and solving.
5x - 22 = 3x + 2 = 4x - 10
so
5x - 22 = 3x + 2
3x + 2 = 4x - 10
4x - 10 = 5x - 22
whichever one you solve for, x = 12. and if you plug in that number for x, each side equals the same number = 38
Dear Amjelugo, we can subtract 4 from 50 to get $46. 4/6 hr= $8, 11/6 hr= $22, and 5/6 hr=$10. 10+22+8=$40 46-40=$6 $6=3/6 hr. Enrique walked Mrs. Camacho's dog and pick up her groceries for 3 hr.
