All categories

3 years ago

Greatest to least 0.04; 0.5; 0.021; 0.133

Mathematics

2 answers:

Andre45 [30]3 years ago

6 0

The answer is 0.5, 0.133, 0.04 and then 0.021! ♥

babymother [125]3 years ago

4 0

0.5, 0.04, 0.133, 0.021

You might be interested in

PLEASE HELP ME QUICKKK, FIRST CORRECT PERSON GETS BRAINLIEST

AfilCa [17]

Answer:

D) 13/100 = 2500/X

Step-by-step explanation:

..........

6 0

2 years ago

Read 2 more answers

Penny reads 13 pages in 1/3 hour. What is the unit rate for pages per hour? For hours per page?

Free_Kalibri [48]

39 pages per hour
13x3=39

8 0

2 years ago

Read 2 more answers

Which of the following statements best describes the location of −(−1) on a number line? (5 points)

Tanzania [10]

Answer:

It is 1 unit to the right of 0.

Step-by-step explanation:

6 0

2 years ago

Food and clothing are shipped to victims of a natural disaster. Each carton of food will feed 13 people, while each carton of c

lutik1710 [3]

Answer:

233 cartons of food; 467 cartons of clothing

Step-by-step explanation:

This linear programming problem can be formulated as two inequalities (in addition to the usual constraints that the variables be non-negative). One of these expresses the constraint on weight. Let f and c represent numbers of food and clothing containers, respectively.

40f +25c ≤ 21000

The other expresses the limit on volume.

20f + 5c ≤ 7000

_____

Feasible Region vertex

We can subtract the boundary line equation of the first inequality from that of 5 times the second to find f:

5(20f +5c) -(40f +25c) = 5(7000) -21000

60f = 14000

f = 233 1/3

The second boundary line equation can be rearranged to find c:

c = 1400 -4f = 466 2/3

The nearest integer numbers to these values are ...

(f, c) = (233, 467)

The other vertices of the feasible region are associated with one or the other variable being zero: (f, c) = (0, 840) or (350, 0).

Check of Integer Solution

Trying these in the constraint inequalities gives ...

40·233 +25·467 = 20,995 < 21000
20·233 +5·467 = 6995 < 7000

Selection of the Answer

The answer to the question will be the feasible region vertex that maximizes the number of people helped. That is, we want to maximize ...

p = 13f + 6c

The values of p at the vertices are ...

p = 13·233 + 6·467 = 5831

p = 13·0 + 6·840 = 5040

p = 13·350 + 6·0 = 2100

The most people are helped when the plane is filled with 233 food cartons and 467 clothing cartons.

7 0

3 years ago

a sandwich shop has 60 stores and 70 percent of the stores are I California. How many stores are in California and Nevada

Aliun [14]

Answer:

The number of stores in California 42

The number of stores in Nevada 18

Step-by-step explanation:

Given as :

The total sandwich shop in California and Nevada = 60

The percentage of shop in California = 70%

So, The percentage of shop in Nevada = 100% - 70% = 30%

Let The number of stores in California = c

And The number of stores in Nevada = n

Now, According to question

The number of stores in California = 70% of the total number of shops

I.e c = $\frac{70}{100}$ × total number of shops

Or, c = $\frac{70}{100}$ × 60

∴ c = $\frac{70\times 60}{100}$

or, c = $\frac{4200}{100}$

or, c = 42

So, The number of stores in California = c =42

Again

The number of stores in Nevada = 30% of the total number of shops

I.e n = $\frac{30}{100}$ × total number of shops

Or, n = $\frac{30}{100}$ × 60

∴ n = $\frac{30\times 60}{100}$

or, n = $\frac{1800}{100}$

or, n = 18

So, The number of stores in Nevada = n = 18

Hence The number of stores in California 42

And The number of stores in Nevada 18 Answer

8 0

3 years ago