Answer:
-3, -1.9, -3/4, 3/4, 0.8
Step-by-step explanation:
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.
3 letters to US = 3*0.94 = 2.82
2 local letters = 2*0.44 = 0.88
checking: 2.82+0.88 = 3.70
to get rid out of 0.04 cents you have to multiply it by 5. so total number of letters would be 5.
Using substitution:
4x+2y=12
y=8x+1
4x+2(8x+1)=12
distribute
4x+16x+2=12
combine like terms
18x+2=12
subtract 2 from both sides
20x=10
divide each side by 20
x=10/20
reduce
x=1/2
plug in x for the y= equation
y=8(1/2)+1
multiply
y=4+1
add
y=5
answer:
(1/2,5)
3/2 We look for a number that goes into both 9 and 6 without leaving a remainder, and that number is 3
