In general 2^n is the number of pieces of information n bits can store.
(a) Antonio can use the formula 2^n-1 to indicate the maximum size of numbers an n-bit word can store.
(b) for a 16-bit system, the maximum number of keys Millie can collect is 2^(16)-1 = 65536-1=65535
(c) For a 14 byte program, there are 14*8=112 bits.
Answer:
3 3/4
Step-by-step explanation:
Answer:
11 through 0
Step-by-step explanation:
Answer:
x = 105 degrees.
Step-by-step explanation:
The small polygon is a regular hexagon so each internal angle = 120 degrees while the large polygon is a regular octagon with internal angle =
135 degrees.
So angle x = 360 - ( 120 + 135)
= 360 - 255
= 105 degrees.
Note we use the fomula T = 180( n - 2) to find total internal angles in an n sided polygon. So for hexagon T = 180(6-2) = 180*4 = 720 so each internal angle in a regular hexagon = 720/6 = 120 degrees.
