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
I found the corresponding image. Pls. see attachment.
<span>The minimum number of rigid transformations required to show that polygon ABCDE is congruent to polygon FGHIJ is
2 (translation and rotation). A
rotation translation must be used to make the two polygons coincide.
A sequence of transformations of polygon ABCDE such that ABCDE does not coincide with polygon FGHIJ is
a translation 2 units down and a 90° counterclockwise rotation about point D </span>
Answer:
the answer is 2.90
Step-by-step explanation:
Picture a rectangle, if one side is 3.4 then the other side 3.4. Add those two togerther gives you 6.8. Now you can subtract 6.8 from the perimeter which is 12.6 then that gives you 5.8. Then you split the 5.8 which give you 2.90 which is the length of the rectangle. So if you label all the sides of the rectangle like this 3.4 + 3.4 + 2.90 + 2.90 = 12.6
Step-by-step explanation:
Given problem is to find nearest number,
= 8888888/2915
quotient = 3049
remainder= 1053
Now, 2915-1053 = 1862
8888888+1862 = 8890750
8888888-1053 = 8887835
Two numbers nearest to 8888888 which are exactly divisible by 2915 is 8887835 and 8890750
Basically you multiply like normal and then add in the decimal point (to figure out where it goes count how many numbers are behind the decimal (in this case 2) and then count that many places from the right into your answer and that's where it goes). So here 374 x22 =8228 but when you add in the decimal you get 82.28 :)