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:
Your answer is -6.
Step-by-step explanation:
Simplify 2(2x+3) to get 4x+6
Then simplify -6(x+9) to get -6x-54
Now you have 4x+6=-6x-54
Move all of the coefficients to one side:
10x+6=-54
Move all of the constants to the other side:
10x=-60
Divide each side by 10:
10/10x=-60/10
To get your answer of -6.
Answer: 20.2
Add all the angles and set it equal to 180
Combine like terms
20x-2=180
X= 9.1
The equation for v is 2x+2
Replace x with 9.1 and then solve
Answer:
a) 50,000 + 2x > 70,000
Step-by-step explanation:
Mrs. Lobo has an annual salary of $50000 per year plus 4% commission on her sales.
If she makes $y commission from sales, Mrs Lobo total income per year is:
$50000 + $y.
She makes 4% commission on her sales of share with the average price of a share = $50
Average commission from sales = 4% × $50 = 0.04 × 50 = $2
If she sales x shares in a year, her commission would be $2x for the year. Therefore her total income for that year would be:
50000 + 2x
The amount of shares Mrs Lobbo must sell to make an annual income of at
least $70,000 is given by the inequality:
50,000 + 2x > 70,000
Step-by-step explanation:
5/10+2/10
7/10
0.7
................
