
It is currently Sat Jul 21, 2018 9:11 pm

View unanswered posts  View active topics

Page 1 of 1

[ 2 posts ] 

Author 
Message 
questioner

Post subject: GMAT Statistics Posted: Wed Aug 04, 2010 10:09 am 

Joined: Sun May 30, 2010 3:15 am Posts: 424

J is a collection of four odd integers whose range is 4. The standard deviation of J must be one of how many numbers? A. 3 B. 4 C. 5 D. 6 E. 7
(B) For the sake of simplicity, let the smallest number in J be 1. Since the range is 4, the largest number in J is 5. You may recall that the standard deviation of a set of numbers is the square root of its variance. How many different variances are possible?
{ 1, 1, 1, 5 } and { 1, 5, 5, 5 } will have the same variance. Why? Remember that the variance is the average squared difference between each element and the mean of the set of numbers. The first set above has a mean of 2, whereas the mean of the second set is 4. In the first set, three elements are 1 unit from the mean and the other element is 3 units from the mean. This is true of the second set, too. These two sets, then, have a variance of 12/4.
Similarly, { 1, 1, 3, 5 } (mean 2.5) and { 1, 3, 5, 5 } (mean 3.5) will have the same variance: in each set, two elements are 1.5 units from the mean, one element is 0.5 unit from the mean, and the remaining element is 2.5 units from the mean. These two sets have a variance of 11/4.
Finally, {1, 3, 3, 5} and {1, 1, 5, 5} have variances of 8/4 and 16/4 respectively.
So, 4 different variances and thus four different standard deviations are possible. Answer: B 
How do you calculate the number of different sets possible?


Top 


Gennadiy

Post subject: Re: math (test 5, question 35): sets. Posted: Wed Aug 04, 2010 1:18 pm 

Joined: Sun May 30, 2010 2:23 am Posts: 498

The general form of such set is {n, m, k, n + 4}, where n  odd integer, m, k  odd integers such that n ≤ m ≤ k ≤ n + 4.
For the sake of simplicity we assume that n = 1. We can do that because standard deviation remains the same if we add or deduct any fixed number to/from all the set members.
So set has following form: {1, m, k, 5 }, m, k  odd integers such that 1 ≤ m ≤ k ≤ 5.
So to calculate all the possible sets we plug in m and k that satisfy above mentioned criteria:
{1, 1, 1, 5} {1, 1, 3, 5} {1, 1, 5, 5} {1, 3, 3, 5} {1, 3, 5, 5} {1, 5, 5, 5}


Top 



Page 1 of 1

[ 2 posts ] 

Who is online 
Users browsing this forum: No registered users and 4 guests 

You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot post attachments in this forum

