what is the lenght and width if the perimeter is 38 cm and the area is 88 sq cm. ? please show solution

Awarding road contracts. A state Department of Transportation (DOT) recently claimed that each of five bidders received equal co

Sveta_85 [38]

Answer:

a) Hence, the probability of this event occurring if, in fact, the DOT's claim is true

= 3/10 = 0.3

Step-by-step explanation:

a) The concept applied here is combinatorics ; nCr = n!/(n - r)!r!

we are told that out of 5bidders, Three of the bidders were large construction conglomerates

and two were small specialty contractors.

selecting two recipients with tree of the bidders were large construction conglomerates 3C2

= 3!/(3-2)!2!

= 3

Similarly, selecting the two small casualty contractor from the total of 5bidders = 5C2

= 5!/(5-2)!2!

= 10

Hence, the probability of this event occurring if, in fact, the DOT's claim is true

= 3/10 = 0.3

b) if DOTs claim is not true ( probability of failure) = 1 - 0.3

= 0.7 , this value implies that the probability 0.3 is largely compatible and a compliment of the 0.7 and as such it is consistent with the DOTs claim that the selection was random.

7 0

3 years ago

Mrs. Noyes fills up a 5 gallon can of gas from the McIntosh’s local convenience store. They are selling gas at $2.099 a gallon.

Tom [10]

<span>Mrs. Noyes fills up a 5 gallon can of gas from the McIntosh’s local convenience store. They are selling gas at $2.099 a gallon. How much is she going to pay at the pumpp</span>

5 0

2 years ago

There are eight different jobs in a printer queue. Each job has a distinct tag which is a string of three upper case letters. Th

Vikentia [17]

Answer:

a. 40320 ways

b. 10080 ways

c. 25200 ways

d. 10080 ways

e. 10080 ways

Step-by-step explanation:

There are 8 different jobs in a printer queue.

a. They can be arranged in the queue in 8! ways.

No. of ways to arrange the 8 jobs = 8!

= 8*7*6*5*4*3*2*1

No. of ways to arrange the 8 jobs = 40320 ways

b. USU comes immediately before CDP. This means that these two jobs must be one after the other. They can be arranged in 2! ways. Consider both of them as one unit. The remaining 6 together with both these jobs can be arranged in 7! ways. So,

No. of ways to arrange the 8 jobs if USU comes immediately before CDP

= 2! * 7!

= 2*1 * 7*6*5*4*3*2*1

= 10080 ways

c. First consider a gap of 1 space between the two jobs USU and CDP. One case can be that USU comes at the first place and CDP at the third place. The remaining 6 jobs can be arranged in 6! ways. Another case can be when USU comes at the second place and CDP at the fourth. This will go on until CDP is at the last place. So, we will have 5 such cases.

The no. of ways USU and CDP can be arranged with a gap of one space is:

6! * 6 = 4320

Then, with a gap of two spaces, USU can come at the first place and CDP at the fourth. This will go on until CDP is at the last place and USU at the sixth. So there will be 5 cases. No. of ways the rest of the jobs can be arranged is 6! and the total no. of ways in which USU and CDP can be arranged with a space of two is: 5 * 6! = 3600

Then, with a gap of three spaces, USU will come at the first place and CDP at the fifth. We will have four such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 4 * 6!

Then, with a gap of four spaces, USU will come at the first place and CDP at the sixth. We will have three such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 3 * 6!

Then, with a gap of five spaces, USU will come at the first place and CDP at the seventh. We will have two such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 2 * 6!

Finally, with a gap of 6 spaces, USU at first place and CDP at the last, we can arrange the rest of the jobs in 6! ways.

So, total no. of different ways to arrange the jobs such that USU comes before CDP = 10080 + 6*6! + 5*6! + 4*6! + 3*6! + 2*6! + 1*6!

= 10080 + 4320 + 3600 + 2880 + 2160 + 1440 + 720

= 25200 ways

d. If QKJ comes last then, the remaining 7 jobs can be arranged in 7! ways. Similarly, if LPW comes last, the remaining 7 jobs can be arranged in 7! ways. so, total no. of different ways in which the eight jobs can be arranged is 7! + 7! = 10080 ways

e. If QKJ comes last then, the remaining 7 jobs can be arranged in 7! ways in the queue. Similarly, if QKJ comes second-to-last then also the jobs can be arranged in the queue in 7! ways. So, total no. of ways to arrange the jobs in the queue is 7! + 7! = 10080 ways

5 0

3 years ago

A tortoise can walk 1/2 a mile in 1/4 of an hour. The hare can run 1 1/2 miles in 1/1 hour

Art [367]

To get the miles of the tortoise just add each of the hours by 2 and to get the miles of the hare just add the hours by 3

Tortoise-Add Hours By 2
Hare-Add Hours By 3

7 0

2 years ago

What is one over six plus three over six?

IrinaK [193]

Answer:4 over 6

Step-by-step explanation:since both denominators are 6, the denominator stays the same. so all you have to do is add 1 and 3. You can also round to 2 over 3.

8 0

2 years ago