All categories

2 years ago

9 9/10 + 6 7/10 add and reduce to lowest terms

Mathematics

1 answer:

stealth61 [152]2 years ago

7 0

The lowest term would be 16.6

You might be interested in

Judd worked 40 hours this week. He worked 7/10 of the hours outside and the rest inside. How many hours did he work outside?

Mnenie [13.5K]

If you would like to know how many hours did Judd work outside, you can calculate this using the following steps:

40 hours
outside: 7/10 of the hours = 7/10 * 40 hours = 7/10 * 40 = 28 hours

Judd worked 28 hours outside.

3 0

3 years ago

Use the drawing tool(s) to form the correct answer on the provided graph.

hjlf

Answer:

We don’t have drawing tools, I’m sorry

Step-by-step explanation:

Brainly doesn’t have a drawing tool, sorry

6 0

2 years ago

Help, brainiest, five stars, and thanks for correct answers.

Alisiya [41]

Answer: help this werd account just asked me on a date and i dont even know them thay swared and i did not understand do you know what to do i know this is not an aser but pleas help......

Step-by-step explanation: please.........

5 0

2 years ago

Which operation should be performed immediately after evaluating exponents using the order of operations

eduard

The answer is b. Multiplication from left to right.

Pemdas- exponent, multiplication, division.

3 0

2 years ago

Read 2 more answers

There are three nursing positions to be filled at Lilly Hospital. Position 1 is the day nursing supervisor; position 2 is the ni

Stels [109]

Answer:

There are 1716 ways the three positions can be filled by these applicants.

Step-by-step explanation:

Permutation is the number of arrangement of <em>k</em> items from <em>n</em> distinct items.

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

For example, permutation can be used to compute the number of ways to arrange 4 mathematics books together when arranging all the 7 books on a shelf.

In this case there are 3 available nursing positions to be filled.

A total of 13 candidates are qualified for all the three positions.

Then the number of ways the 3 positions can be filled by the 13 candidates can be determine using permutation.

Compute the possible number of selections as follows:

$^{13}P_{3}=\frac{13!}{(13-3)!}=\frac{13!}{10!}=\frac{13\times 12\times 11\times 10!}{10!}=1716$

Thus, there are 1716 ways the three positions can be filled by these applicants.

3 0

2 years ago