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
Easy the answer is B: 17 and one-third
100 is the easiest because 1/100 =0.01
33/100=0.33
Answer:
Step-by-step explanation:
9) PQR Is an isosceles triangle
=> ∠PRQ = (180° - x)/2
PRS is an isosceles right triangle
=> ∠PRS = 45°
Have: ∠PRS + ∠PRQ = 115°
=>
=> 180 - x = (115 - 45).2 = 140
<=> x = 180 - 140 = 40
10) ABD is an isosceles right triangle => ∠ABD = 45°
BCD is an equilateral triangle => ∠CBD = 60°
have: x = ∠ABD + ∠CBD = 45° + 60° = 105°
11) have: x = y (2)
PQT is an isosceles triangle => ∠PQT = 180 - 70.2 = 40
QTS is an isosceles triangle => ∠TQS = 180 -2x
QRS is an isosceles triangle => ∠RSQ = y
have: 40 + 180 - 2x + y = 180 => 2x - y = 40 (1)
(1)(2) =>
=> x + y = 80
12) EFJ Is an equilateral triangle => ∠FJE = 60
∠FJE is the outer angle of the triangle FHJ but FHJ is an isosceles triangle
=> 60 = 2.∠JHF => ∠JHF = 30°
∠JHF is the outer angle of the triangle FHG
=> 30° = 2x
<=> x = 15°