All categories

3 years ago

STATISTICS

Mathematics

2 answers:

Illusion [34]3 years ago

8 0

Answer:

Median time spent by mice in searching it's food = 32

Arranging the time taken by the 13 mice in increasing order -

27,27,28,28,29,31,32,33,33,33,34,35,63

The total number of observations is 13(odd).

For odd number of observations the median is equal to the middle term of the observations.

Median time spent by the mice searching for food = 7th term = 32

Step-by-step explanation:

Lelechka [254]3 years ago

3 0

Median time spent by mice in searching it's food = 32

Arranging the time taken by the 13 mice in increasing order -

27,27,28,28,29,31,32,33,33,33,34,35,63

The total number of observations is 13(odd).

For odd number of observations the median is equal to the middle term of the observations.

Median time spent by the mice searching for food = 7th term = 32

You might be interested in

F(x)=x^2+5x what are the real zeroes of this function?

Marina CMI [18]

Answer:

0, -5

Step-by-step explanation:

5 0

3 years ago

WILL MARK BRAINLIEST!!!!!!!!!!!!!!!!!! Why would someone choose to use a graphing calculator to solve a system of linear equatio

ohaa [14]

Answer:

A graphing calculator is more accurate than graphing by hand. If the slope and/or y-intercept is a fraction or decimal, it is more difficult to accurately graph by hand.

Step-by-step explanation:

6 0

3 years ago

Read 2 more answers

8. A banker's loan officer rates applications for credit. The rates are normally distributed with a mean of 200 and a standard d

masha68 [24]

Answer:

802

Step-by-step explanation:

3 0

3 years ago

January, Scott earned $8,999. In February, he earned $2,387 more than in January. In March, Scott earned the same amount as in F

netineya [11]

Answer:I believe it's 31,771

Step-by-step explanation: you first need to add 8,999 + 2,387 to get 11,386 then add 11,386 + 11,386 to get 22,772 and then add 8,999 to get 31,771.

6 0

3 years ago

A combination lock has 25 numbers on it. How many different 3-digit lock combinations are possible if no digit can be repeated?

IgorC [24]

Answer:

The number of ways is 13,800 ways

Step-by-step explanation:

In this question, we are tasked with calculating the number of ways to form 3-digits codes from 25 different numbers given that no repetition is allowed.

Now, for the first digit, we have all the 25 numbers completely wanting to take a spot. Now, in how many ways can we choose a single out of 25, that would be 25 ways

Now, we have 24 numbers left, and we are trying to pick one, the number of ways this can be done is 24 ways also

for the last digit, we have 23 numbers and we are selecting just one, the number of ways this can be done is 23 ways too

Thus, the cumulative number of ways would be 25 * 24 * 23 = 13,800 ways

7 0

3 years ago