Let P = number of coins of pennies (1 penny = 1 cent)
Let N = number of coins of nickels (1 nickel = 5 cents)
Let D = number of coins of dimes (1 dime = 10 cents)
Let Q = number of coins of quarters (1 quarter = 25 cents)
a) P + N + D + Q = 284 coins, but P = 173 coins, then:
173 + N + D + Q =284 coins
(1) N + D + Q = 111 coins
b) D = N + 5 OR D - N =5 coins
(2) D - N = 5 coins
c) Let's find the VALUE in CENTS of (1) that is N + D + Q = 111 coins
5N + 10D + 25 Q = 2,278 - 173 (1 PENNY)
(3) 5N + 10D + 25Q = 2105 cents
Now we have 3 equation with 3 variables:
(1) N + D + Q = 111 coins
(2) D - N = 5 coins
(3) 5N + 10D + 25Q = 2105 cents
Solving it gives:
17 coins N ( x 5 = 85 cents)
22 coins D ( x 10 = 220 cents)
72 coins D ( x 25 = 1,800 cents)
and 173 P,
proof:
that makes a total of 85+2201800+172 =2,278 c or $22.78
Answer:
1 13/17 pages
Step-by-step explanation:
60pg/34hr ---> 30pg/17hr
30pg/17hr ---> (30/17)pg / 1 hr
30/17 = 1 13/17 pages
Answer:
i think u should check ur equation ion think its correct mane!
Step-by-step explanation:
Refer to the figure shown below.
The feasible region that satisfies all the constraints is the shaded region.
The bounding vertices are
A (0, 3)
B (0, 0)
C (5, 0)
D (1.5, 3.5)
All the functions that define the constraints are either linear or constant.
The maximum value is at vertex D, and equal to 3.5.