Write an expression for the calculation the difference of the products of 5 and 2 and 5 and 1

1 answer:

3 0

Let's review the terminology. A product is what you get when you multiply two numbers. So, the product of 5 and 2 is basically "5*2," and the product of 5 and 1 is "5*1."

The difference means when you subtract one from the other. So, the difference of 5*2 and 5*1 means "(5*2)-(5*1)". (Note: I put in parentheses to make sure the reader understands that 5*2 is separate from 5*1. 5*2-5*1 is confusing: you might not know what to do first!)

So, "(5*2)-(5*1)" can be your answer, OR you can simplify it further by actually doing the multiplication: "10-5". If you want the answer, just subtract--the expression is equal to 5.

Answer: "(5*2)-(5*1)" OR "10-5" OR "5"

You might be interested in

A taxi chorges $1.00 flat

solmaris [256]

Answer:

Y=25x+1

Step-by-step explanation:

The x represents the fee per mile, and the y intercept is the one dollar fee.

5 0

3 years ago

For a continuous probablity distribution, 0 ≤ x ≤ 15. What is P(x > 15)

sleet_krkn [62]

If the support of the distribution is 0 ≤ x ≤ 15, then P(x > 15) is always 0

3 0

3 years ago

a plumber is paid $38.00 per hour for an eight-hour shift. for any hours over eight in a day, an overtime rate of one and one-ha

xxMikexx [17]

Hey You!

38.00 × 1.5 = 57

57 × 10 = 570

570 × 5 = 2,850

So, the plumber would be paid $2,850 for working overtime for 5 days.

And That's Your Answer! ^

7 0

4 years ago

The value square root of 53 of lies between which two consecutive integers?

Yanka [14]

√53 = 7.28

Therefore, it lies between 7 and 8.

6 0

4 years ago

The Janie Gioffre Drapery Company makes three types of draperies at two different locations. At location I, it can make 10 pairs

Tcecarenko [31]

Answer:

30 days at location I
35 days at location II

Step-by-step explanation:

Let x and y represent days of operation of Location I and Location II, respectively. Then we want to minimize the objective function ...

650x +750y

subject to the constraints on drape production:

10x +20y ≥ 1000 . . . . . order for deluxe drapes

20x +50y ≥ 2100 . . . . . order for better drapes

13x +6y ≥ 600 . . . . . . . order for standard drapes

I find a graphical solution works well for this. The vertices of the feasible solution space are (x, y) = (0, 100), (30, 35), (80, 10), (105, 0). The vertex at which the cost is minimized is

(x, y) = (30, 35)

This schedule will produce exactly the required numbers of deluxe and standard drapes, and 2350 pairs of better drapes, 250 more than required.

_____

In the attached graph, we have reversed the inequalities so that the solution space (feasible region) is white, not triple-shaded. Minimizing the objective function means choosing the vertex of the feasible region so that the line representing the objective function is as close to the origin as possible.

4 0

4 years ago