Write a story that matches the expression -7h - 10

1 answer:

8 0

Wants to find how much money he will spend for a number of ride tickets, h, he purchases
he gets into an amusement park by paying a fee of 10 dollars
each ride is 7 dollars

so his looss is -7h-10

You might be interested in

The revenue for a business, as a function of units produced, x, is shown below by R(x). C(x) represents the cost of producing x

zavuch27 [327]

Answer:

huh....

Step-by-step explanation:

5 0

2 years ago

Shawn picked some vegetables from his garden.he picked 2.234 pounds of corn 2.205 pounds of tomatoes and 2.25 pounds of potatoes

Tatiana [17]

Answer: The correct answer is H.

Step-by-step explanation: The correct order of the weights from largest to smallest is shown in choice H. The correct order is 2.25, 2.234, 2.205.

5 0

3 years ago

Construct a 96% confidence interval if a sampling distribution has a mean of 20, standard deviation of 5, and size of 100?

garik1379 [7]

Answer:

wryestudrytfuygiuhi'ojpokplkojih;uglyfkdtrjsezdfxh jshfxdgjcfkhgvbj.k/nl

Step-by-step explanation:

6 0

2 years ago

Does anyone know what irrational numbers are and if so can you explain it to me???

Romashka [77]

An irrational number cannot be expressed as a ratio between two numbers and it cannot be written as a simple fraction because there is not a finite number of numbers when written as a decimal. <u>Instead, the numbers in the decimal would go on forever, without repeating. Ex) .7583947262......... It doesn't repeat and goes on forever</u>

3 0

3 years ago

We have 4different boxesand 6different objects. We want to distribute the objects into the boxes such that at no box is empty. I

Musya8 [376]

Answer:

Following are the solution to this question:

Step-by-step explanation:

They provide various boxes or various objects. It also wants objects to be distributed into containers, so no container is empty. All we select k objects of r to keep no boxes empty, which (r C k) could be done. All such k artifacts can be placed in k containers, each of them in k! Forms. There will be remaining $(r-k)$ objects. All can be put in any of k boxes. Therefore, these $(r-k)$ objects could in the $k^{(r-k)}$ manner are organized. Consequently, both possible ways to do this are

$=\binom{r}{k} \times k! \times k^{r-k}\\\\=\frac{r! \times k^{r-k}}{(r-k)!}$

Consequently, the number of ways that r objects in k different boxes can be arranged to make no book empty is every possible one

$= \frac{r!k^{r-k}}{(r-k)!}$

5 0

3 years ago