It is already in simplest form
Hope this helps you!
The way you find profit is to subtract the revenue and the cost
Profit = Revenue - Cost
The revenue is the amount of money coming in, the cost is the amount of money going out. The goal of course is to have the revenue larger than the cost so that the profit is positive.
So the equation given is
P = 7.5n - (2.25n+15)
and its in the form
P = R - C
where...
R = 7.5n is the revenue equation
C = 2.25n+15 is the cost equation
Focus on the revenue equation
R = 7.5n
which is the same as
R = 7.50*n
This tells us that Sandra pulls in a total of 7.50*n dollars where n is some positive whole number. It represents the number of necklaces sold. For example, if she sold n = 10 necklaces, then
R = 7.50*n
R = 7.50*10
R = 750
meaning that Sandra has made $750 in revenue
As you can see above, the revenue is computed by multiplying the price per necklace ($7.50) by the number of necklaces sold (n) to get R = 7.50*n
So that's why the answer is $7.50
Note: The 2.25 is part of the cost equation. This is known as the variable cost. It is the cost to make one necklace ignoring the fixed cost (eg: rent). The variable cost often doesn't stay the same, but algebra textbooks often simplify this aspect.
Answer:
w=1 5/24
Step-by-step explanation:
7/9-4/3w=-5/6
-4/3w=-5/6-7/9
-4/3w=-15/18-14/18
-4/3w=-29/18
w=-29/18:(-4/3)
w=29/18*(3/4)
w=29*3/18*4
w=29/6*4
w=29/24
w=1 5/24
$46
heater and insurance for each sheep subtracted from the total amount leaves $740. Then divided by the amount of sheep equals $46!
Hope I helped!
Answer:
Step-by-step explanation:
From the given information; Let's assume that R should represent the set of all possible outcomes generated from a bit string of length 10 .
So; as each place is fitted with either 0 or 1
Similarly; the event E signifies the randomly generated bit string of length 10 does not contain a 0
Now;
if a 0 bit and a 1 bit are equally likely
The probability that a randomly generated bit string of length 10 does not contain a 0 if bits are independent and if a 0 bit and a 1 bit are equally likely is;
so ; if bits string should not contain a 0 and all other places should be occupied by 1; Then:
;
