Answer:
I know this problem is an
✔ equation
because it has an equals sign.
The t is the
✔ variable
.
The negative sign is the
✔ operation
.
The 7 and the 8 are both
✔ constants
.
Step-by-step explanation: i took the test :( crying cuz im bouta fail
Assuming that the missing operations are multiplication as it is with the first question "bd", then the answer would be as follows:
1.) Simply substitute the values of b and d before multiplying.
bd = (-2)(-6) = 12
2.) (-50)(-2) = 100
3.) (5/8)(7/12)= 35/96
Answer:
2. Judy =$5
Ben= $4
Step-by-step explanation:
2. Let Judy = x and Ben = y
8x + 10y = 80
9x + 5y = 65
Solve these simultaneous equations.
8
x + 10
y = 80
18
x + 10
y = 130
Take the second equation away from the first equation
−
10
x = −
50
x = 5
This means that Judy gets paid $5 an hour.
Therefore, Ben gets paid $4 an hour.
Answer:
3. 24 quarters and 16 dimes
Step-by-step explanation:
3. Let the number of dimes = x and the number of quarters = y
Value Value
Type Number of of
of of EACH ALL
coin coins coin coins
-------------------------------------------
dimes x $0.10 $0.10x
quarters y $0.25 $0.25y
-------------------------------------------
TOTALS 40 $7.60
x + y = 40
0.10x + 0.25y = 7.60
Get rid of decimals by multiplying every term by 100:
10x + 25y = 760
So we have the system of equations:
x + y = 40
10x + 25y = 760
We solve by substitution. Solve the first equation for y:
x + y = 40
y = 40 - x
Substitute (40 - x) for y in 10x + 25y = 760
10x + 25(40 - x) = 760
10x + 1000 - 25x = 760
-15x + 1000 = 760
-15x = -240
x = 16 = the number of dimes.
Substitute in y = 40 - x
y = 40 - (16)
y = 24 quarters.
$1.60 + $6.00 = $7.60
I hope that helped, sorry for taking so long :-)
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:
A F% isn't even a thing lol. But what do u need help with
Step-by-step explanation:
