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
Answer:
2hms+2hns
Step-by-step explanation:
Answer:
x=2;DE,EF=9,DF=5
Step-by-step explanation:
Since DEF is isoceles, you can set the equations
x+7 and 2x+5 equal to each other
x+7=2x+5, now solve for x
-x=-2,
x=2, now plug in for each side
DE,EF=9
DF=3(2)-1=5
The first step to solve this problem is to find the area of
the rectangular piece of fabric.
A of triangle = bh/2
A = (14 cm) (6 cm) /2
A = 84 cm^2 / 2
A = 42 cm
And since there are 31 pieces of the fabric, the total area
of all the pieces of fabric is:
31 pieces of fabric x 42 square centimeters per piece =
1,302 square centimeters
To computer how many congruent triangular patches can be
cut, you have to divide the total area of the fabric pieces with the area of
the congruent triangle:
1,302 square centimeters / 21 square centimeters = 62
Therefore, Leia can cut 62 patches.
Answer:
i think its 360.......
Step-by-step explanation:
i hope it helps