Last visit was: 12 Jun 2026, 00:00 It is currently 12 Jun 2026, 00:00
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
mithun2vrs
Joined: 21 Feb 2012
Last visit: 21 Aug 2013
Posts: 9
Own Kudos:
11
 [3]
Given Kudos: 3
Posts: 9
Kudos: 11
 [3]
1
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
User avatar
devinawilliam83
Joined: 25 Aug 2011
Last visit: 01 Mar 2013
Posts: 113
Own Kudos:
1,674
 [2]
Given Kudos: 11
Location: India
GMAT 1: 730 Q49 V40
WE:Operations (Insurance)
GMAT 1: 730 Q49 V40
Posts: 113
Kudos: 1,674
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
devinawilliam83
Joined: 25 Aug 2011
Last visit: 01 Mar 2013
Posts: 113
Own Kudos:
1,674
 [2]
Given Kudos: 11
Location: India
GMAT 1: 730 Q49 V40
WE:Operations (Insurance)
GMAT 1: 730 Q49 V40
Posts: 113
Kudos: 1,674
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
avatar
priyavenugopal
Joined: 25 Oct 2010
Last visit: 27 Mar 2012
Posts: 1
Own Kudos:
2
 [2]
Given Kudos: 15
Posts: 1
Kudos: 2
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thanks for welcoming, Bunuel..awaiting ur OAs n explanations for some of those tricky qns in the list.

@dyaffe55 - Yeah, thts rgt, i overlooked the given data for qn #5. Thanks for the explanation, it makes more sense.

There are 2 more wrong answers frm me other than this in the qn list, to my knwledge till thn..sry if thr is any more..
9. the answer is B (and not D, i mistyped the answer choice in my prev post)
10. guess its B (and not E..came across a similar qn post frm Bunuel..guess i should be more alert on the 'atleast' keyword usage in the qn stems, hereafter.)
User avatar
kuttingchai
Joined: 28 Jul 2011
Last visit: 17 Oct 2016
Posts: 125
Own Kudos:
457
 [2]
Given Kudos: 16
Posts: 125
Kudos: 457
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Bunuel
2. If n is a positive integer and p is a prime number, is p a factor of n!?

(1) p is a factor of (n+2)!-n! --> if \(n=2\) then \((n+2)!-n!=22\) and for \(p=2\) then answer will be YES but for \(p=11\) the answer will be NO. Not sufficient.

(2) p is a factor of (n+2)!/n! --> \(\frac{(n+2)!}{n!}=(n+1)(n+2)\) --> if \(n=2\) then \((n+1)(n+2)=12\) and for \(p=2\) then answer will be YES but for \(p=3\) the answer will be NO. Not sufficient.

(1)+(2) \((n+2)!-n!=n!((n+1)(n+2)-1)\). Now, \((n+1)(n+2)-1\) and \((n+1)(n+2)\) are consecutive integers. Two consecutive integers are co-prime, which means that they don't share ANY common factor but 1. For example 20 and 21 are consecutive integers, thus only common factor they share is 1. So, as from (2) \(p\) is a factor of \((n+1)(n+2)\) then it can not be a factor of \((n+1)(n+2)-1\), thus in order \(p\) to be a factor of \(n!*((n+1)(n+2)-1)\), from (1), then it should be a factor of the first multiple of this expression: \(n!\). Sufficient.

Answer: C.


I didnot understand why 1 is not sufficient, can you elaborate on that ?

what i did is - I took n! common * coprime number

So if we have n! everytime the factors for n! and n!* coprime should always be same.. What am i missing?

Will Vote for A

Given
n = +ve Int
P = Prime

(A)

p is a factor of (n+2)!-n!

Let n = 4

= 6! - 4!
= 4![(6*5) - 1] = 4! (29)

therefore n! = 4! will have sufficient factors as 4! (29)

data sufficient

Let n = 17

= (19)! - 17!
= 17! [(19 * 18) - 1]

data sufficient

Let n = 11

= (13!) - 11!
= 11! [(13*12) - 1]

data sufficient


(B)

p is a factor of (n+2)!/n!

Let n = 2

= (4!) / 2! = 12 = 2*2*3 = data sufficient

Let n = 4

= (6!) / 4! = 6 * 5 = 2*3*5 = data not sufficient
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 12 Jun 2026
Posts: 111,218
Own Kudos:
820,162
 [2]
Given Kudos: 106,763
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 111,218
Kudos: 820,162
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
mithun2vrs
I think I will still disagree, it is a classic case of choosing numbers after replacement or without replacement. You interpret as earlier option and I later. Your thots pls

I think you misinterpret the question. We are not talking about the replacement at all, we are talking about the probability of selecting some group in certain order. Just try to calculate the probability of choosing 5 numbers out of 12 distinct numbers in ascending order and compare it to the probability of choosing 5 numbers out of 24 distinct numbers in ascending order.
User avatar
alphabeta1234
Joined: 12 Feb 2012
Last visit: 03 Jun 2016
Posts: 105
Own Kudos:
324
 [2]
Given Kudos: 28
Posts: 105
Kudos: 324
 [2]
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
Bunuel
8. If p is a positive integer, what is the remainder when p^2 is divided by 12?

(1) p is greater than 3. Clearly insufficient: different values of \(p\) will give different values of the remainder.
(2) p is a prime. Also insufficient: if \(p=2\) then the remainder is 4 but if \(p=3\) then the remainder is 9.

(1)+(2) You can proceed with number plugging and try several prime numbers greater than 3 to see that the remainder will always be 1 (for example try \(p=5\), \(p=7\), \(p=11\)).

If you want to double-check this with algebra you should apply the following property of the prime number: any prime number greater than 3 can be expressed either as \(p=6n+1\) or \(p=6n-1\).

If \(p=6n+1\) then \(p^2=36n^2+12n+1\) which gives remainder 1 when divided by 12;

If \(p=6n-1\) then \(p^2=36n^2-12n+1\) which also gives remainder 1 when divided by 12.

Answer: C.


Hey Bunuel,

I am intrigued by your second method. But if n=6 we get \(p=6n+1=25\), a multiple of 5. Can this be a problem?

Moreover, for your method to show that the remaind was equal to 1. Is this what you did ?

\(p^2=36n^2+12n+1=12(3n^2+n)+1=12k+1\) ?

Thank you!
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 12 Jun 2026
Posts: 111,218
Own Kudos:
820,162
 [2]
Given Kudos: 106,763
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 111,218
Kudos: 820,162
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
some2none
Bunuel
7. Set A consists of k distinct numbers. If n numbers are selected from the set one-by-one, where n<=k, what is the probability that numbers will be selected in ascending order?

(1) Set A consists of 12 even consecutive integers;
(2) n=5.

We should understand following two things:
1. The probability of selecting any n numbers from the set is the same. Why should any subset of n numbers have higher or lower probability of being selected than some other subset of n numbers? Probability doesn't favor any particular subset.

2. Now, consider that the subset selected is \(\{x_1, \ x_2, \ ..., \ x_n\}\), where \(x_1<x_2<...<x_n\). We can select this subset of numbers in \(n!\) # of ways and out of these n! ways only one, namely \(\{x_1, \ x_2, \ ..., \ x_n\}\) will be in ascending order. So 1 out of n!. \(P=\frac{1}{n!}\).

Hence, according to the above the only thing we need to know to answer the question is the size of the subset (n) we are selecting from set A.

Answer: B.

Some amount of ambiguity exists, at least to me, in the question. The ambiguity disappears if the question asks
what is the probability that SELECTED numbers will be in ascending order? rather than
what is the probability that numbers will be selected in ascending order?

Let's say k = 7
and n = 3 (selected numbers)

The ways in which n (=3) can be selected from k (=7) = 7C3
And probability of selecting n(=3) in ascediting order is 1/7C3.

Again, the answer would be the same 1/n!=1/3!=1/6:
1, 2, 3;
1, 2, 4;
1, 2, 5;
1, 2, 6;
1, 2, 7;
1, 3, 4;
1, 3, 5;
1, 3, 6;
1, 3, 7;
1, 4, 5;
1, 4, 6;
1, 4, 7;
1, 5, 6;
1, 5, 7;
1, 6, 7;
2, 3, 4;
2, 3, 5;
2, 3, 6;
2, 3, 7;
2, 4, 5;
2, 4, 6;
2, 4, 7;
2, 5, 6;
2, 5, 7;
2, 6, 7;
3, 4, 5;
3, 4, 6;
3, 4, 7;
3, 5, 6;
3, 5, 7;
3, 6, 7;
4, 5, 6;
4, 5, 7;
4, 6, 7;
5, 6, 7.

35 ways (naturally) to select 3 numbers out of 7 in ascending order. Total # of ways to select 3 numbers out of 7 when order matters is \(P^3_7=210\). Hence the probability is 35/210=1/6.

Hope it's clear.
avatar
shivamayam
Joined: 09 Apr 2012
Last visit: 19 Nov 2012
Posts: 1
Own Kudos:
2
 [2]
Given Kudos: 2
Posts: 1
Kudos: 2
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Bunuel
11. Alice has $15, which is enough to buy 11 muffins and 7 brownies, is $45 enough to buy 27 muffins and 27 brownies?

700+ question.

Given: \(11m+7b\leq{15}\), where \(m\) and \(b\) are prices of one muffin and one brownie respectively.
Question: is \(27m+27b\leq{45}\)? --> \(9m+9b\leq{15}\). Question basically asks whether we can substitute 2 muffins with 2 brownies.

Now if \(m>b\) we can easily substitute 2 muffins with 2 brownies (since \(2m\) will be more than \(2b\)). But if \(m<b\) we won't know this for sure.

But consider the case when we are told that we can substitute 3 muffins with 3 brownies. In both cases (\(m>b\) or \(m<b\)) it would mean that we can substitute 2 (so less than 3) muffins with 2 brownies, but again we won't be sure whether we can substitute 4 (so more than 3) muffins with 4 brownies.

(1) $15 is enough to buy 7 muffins and 11 brownies --> \(7m+11b\leq{15}\): we can substitute 4 muffins with 4 brownies, so according to above we can surely substitute 2 muffins with 2 brownies. Sufficient.
(1) $15 is enough to buy 10 muffins and 8 brownies --> \(10m+8b\leq{15}\): we can substitute 1 muffin with 1 brownie, so according to above this is does not ensure that we can substitute 2 muffins with 2 brownies. Not sufficient.

Answer: A.

hi bunuel - i am unable to find the gap in my logic. Can you pls help?

Given: 11m+7b=15 -- (1) (let's disregard the inequality for the moment)

St1: 7m+11b=15 --(2)
(1)less(2): 4m-4b=0 --> m=b --> substituting m for b in (1), we get 11m+7m=15 --> m=5/6.
We could substitute 5/6 for m and b in the question to verify whether the equation holds good. So St1 is suff.

St2: 10m+8b=15 --(3)
(1)less(3) gives me m= 5/6. Similar to the above, we could substitute 5/6 for m and b in the question to verify it's validity. So St2 is also suff.

So shouldn't the answer be D?
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 12 Jun 2026
Posts: 111,218
Own Kudos:
820,162
 [2]
Given Kudos: 106,763
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 111,218
Kudos: 820,162
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
shivamayam
Bunuel
11. Alice has $15, which is enough to buy 11 muffins and 7 brownies, is $45 enough to buy 27 muffins and 27 brownies?

700+ question.

Given: \(11m+7b\leq{15}\), where \(m\) and \(b\) are prices of one muffin and one brownie respectively.
Question: is \(27m+27b\leq{45}\)? --> \(9m+9b\leq{15}\). Question basically asks whether we can substitute 2 muffins with 2 brownies.

Now if \(m>b\) we can easily substitute 2 muffins with 2 brownies (since \(2m\) will be more than \(2b\)). But if \(m<b\) we won't know this for sure.

But consider the case when we are told that we can substitute 3 muffins with 3 brownies. In both cases (\(m>b\) or \(m<b\)) it would mean that we can substitute 2 (so less than 3) muffins with 2 brownies, but again we won't be sure whether we can substitute 4 (so more than 3) muffins with 4 brownies.

(1) $15 is enough to buy 7 muffins and 11 brownies --> \(7m+11b\leq{15}\): we can substitute 4 muffins with 4 brownies, so according to above we can surely substitute 2 muffins with 2 brownies. Sufficient.
(1) $15 is enough to buy 10 muffins and 8 brownies --> \(10m+8b\leq{15}\): we can substitute 1 muffin with 1 brownie, so according to above this is does not ensure that we can substitute 2 muffins with 2 brownies. Not sufficient.

Answer: A.

hi bunuel - i am unable to find the gap in my logic. Can you pls help?

Given: 11m+7b=15 -- (1) (let's disregard the inequality for the moment)

St1: 7m+11b=15 --(2)
(1)less(2): 4m-4b=0 --> m=b --> substituting m for b in (1), we get 11m+7m=15 --> m=5/6.
We could substitute 5/6 for m and b in the question to verify whether the equation holds good. So St1 is suff.

St2: 10m+8b=15 --(3)
(1)less(3) gives me m= 5/6. Similar to the above, we could substitute 5/6 for m and b in the question to verify it's validity. So St2 is also suff.

So shouldn't the answer be D?

You cannot just substitute \(\leq\) sign with \(=\) sign and solve. Those are two very different signs.

To see that (2) is not sufficient, consider two cases:
A. Muffins and brownies are free - answer YES;
B. Muffins are free and each brownie costs $1.8 - answer NO.

Hope it's clear.
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 11 Jun 2026
Posts: 16,493
Own Kudos:
79,903
 [2]
Given Kudos: 485
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,493
Kudos: 79,903
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Vinayprajapati
Bunuel
7. Set A consists of k distinct numbers. If n numbers are selected from the set one-by-one, where n<=k, what is the probability that numbers will be selected in ascending order?

(1) Set A consists of 12 even consecutive integers;
(2) n=5.

We should understand following two things:
1. The probability of selecting any n numbers from the set is the same. Why should any subset of n numbers have higher or lower probability of being selected than some other subset of n numbers? Probability doesn't favor any particular subset.

2. Now, consider that the subset selected is \(\{x_1, \ x_2, \ ..., \ x_n\}\), where \(x_1<x_2<...<x_n\). We can select this subset of numbers in \(n!\) # of ways and out of these n! ways only one, namely \(\{x_1, \ x_2, \ ..., \ x_n\}\) will be in ascending order. So 1 out of n!. \(P=\frac{1}{n!}\).

Hence, according to the above the only thing we need to know to answer the question is the size of the subset (n) we are selecting from set A.

Answer: B.


One doubt dear
Lets assume k=1 2 3 4 5 6 7 8 9 10
Now if first select the number 4 then the total number i.e. k is definitely going to affect the total probability
Please clear.

Great Question Bunuel!

As for your doubt Vinay, let me try to explain it. The question does not care about the number of ways of selecting n numbers from k numbers. It is only asking for the probability of selecting numbers in increasing order.
Probability of selecting numbers in increasing order + Probability of selecting numbers in some other order = 1

Say out of the 10 numbers, you select 3 numbers. 1, 5, and 7

You can select them in increasing order = 1, 5, 7 - total 1 way
You can select them in some other order = 1, 7, 5/ 5, 1, 7/5, 7, 1/7, 5, 1/7, 1, 5 - total 5 ways

Probability of selecting numbers in increasing order = 1/6
Probability of selecting numbers in some other order = 5/6

Notice that it doesn't matter how many numbers there are in the original list. All we care about is arranging the n selected numbers. One arrangement will be in increasing order and the others will be non-increasing.

A good tricky question!
avatar
dyaffe55
Joined: 10 Mar 2012
Last visit: 07 Sep 2015
Posts: 35
Own Kudos:
23
 [1]
Given Kudos: 12
GMAT 1: 730 Q47 V44
GMAT 1: 730 Q47 V44
Posts: 35
Kudos: 23
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
5. If at least one astronaut do NOT listen to Bach at Solaris space station, then how many of 35 astronauts at Solaris space station listen to Bach?
(1) Of the astronauts who do NOT listen to Bach 56% are male.
(2) Of the astronauts who listen to Bach 70% are female.

Answer: A
1)I set up a table of M/F and Listeners/Non-Listeners. Since 56% are male and there are 35 astronauts, reduce 56/100 where the demoninator is <= 35. The only solution is 14/25. Thus, 25 astronauts do NOT listen to Bach and 10 astronauts listen to Bach. Sufficient.

2)With the same table I already have set up, I can determine that either 10, 20, or 30 listen to Bach; therefore, not sufficient.

C would be a trap answer. Based on (1) our options of 20 and 30 from (2) are eliminated, for a total of 7 female listeners, 3 male listeners, 11 female non-listeners and 14 male non-listeners. However, this information is unneccessary since (1) is enough.


Edit: I wanted to add that I came to these conclusions because it's stated "at least one astronaut do NOT listen to Bach." I think that oversight is why many people picked E?
User avatar
mithun2vrs
Joined: 21 Feb 2012
Last visit: 21 Aug 2013
Posts: 9
Own Kudos:
11
 [1]
Given Kudos: 3
Posts: 9
Kudos: 11
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Bunuel
7. Set A consists of k distinct numbers. If n numbers are selected from the set one-by-one, where n<=k, what is the probability that numbers will be selected in ascending order?

(1) Set A consists of 12 even consecutive integers;
(2) n=5.

We should understand following two things:
1. The probability of selecting any n numbers from the set is the same. Why should any subset of n numbers have higher or lower probability of being selected than some other subset of n numbers? Probability doesn't favor any particular subset.

2. Now, consider that the subset selected is \(\{x_1, \ x_2, \ ..., \ x_n\}\), where \(x_1<x_2<...<x_n\). We can select this subset of numbers in \(n!\) # of ways and out of these n! ways only one, namely \(\{x_1, \ x_2, \ ..., \ x_n\}\) will be in ascending order. So 1 out of n!. \(P=\frac{1}{n!}\).

Hence, according to the above the only thing we need to know to answer the question is the size of the subset (n) we are selecting from set A.

Answer: B.

I am not sure if I understand correctly.

There are a total of k integers. So probability of selecting first integer 1/k, now probability of second integer out of k-1 integer is 1/(k-1) and so on... so selecting n integers would be 1/(k*(k-1)*(k-2)*...(k-(n-1)) so we need both k & n. Am I missing something here?
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 12 Jun 2026
Posts: 111,218
Own Kudos:
820,162
 [1]
Given Kudos: 106,763
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 111,218
Kudos: 820,162
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
kuttingchai
Bunuel
2. If n is a positive integer and p is a prime number, is p a factor of n!?

(1) p is a factor of (n+2)!-n! --> if \(n=2\) then \((n+2)!-n!=22\) and for \(p=2\) then answer will be YES but for \(p=11\) the answer will be NO. Not sufficient.

(2) p is a factor of (n+2)!/n! --> \(\frac{(n+2)!}{n!}=(n+1)(n+2)\) --> if \(n=2\) then \((n+1)(n+2)=12\) and for \(p=2\) then answer will be YES but for \(p=3\) the answer will be NO. Not sufficient.

(1)+(2) \((n+2)!-n!=n!((n+1)(n+2)-1)\). Now, \((n+1)(n+2)-1\) and \((n+1)(n+2)\) are consecutive integers. Two consecutive integers are co-prime, which means that they don't share ANY common factor but 1. For example 20 and 21 are consecutive integers, thus only common factor they share is 1. So, as from (2) \(p\) is a factor of \((n+1)(n+2)\) then it can not be a factor of \((n+1)(n+2)-1\), thus in order \(p\) to be a factor of \(n!*((n+1)(n+2)-1)\), from (1), then it should be a factor of the first multiple of this expression: \(n!\). Sufficient.

Answer: C.

I didnot understand why 1 is not sufficient, can you elaborate on that ?

There are two examples given which give two different answers to the question whether p is a factor of n!.

(1) p is a factor of (n+2)!-n!

If \(n=2\) and \(p=2\) (notice that in this case \((n+2)!-n!=22\) and \(p=2\) is a factor of 22), then since \(p=2\) is a factor of \(n!=2!\) the answer to the question is YES;

If \(n=2\) and \(p=11\) (notice that in this case \((n+2)!-n!=22\) and \(p=11\) is a factor of 22), then since \(p=11\) is NOT a factor of \(n!=2!\) the answer to the question is NO.

Two different answers, hence not sufficient.
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 12 Jun 2026
Posts: 111,218
Own Kudos:
820,162
 [1]
Given Kudos: 106,763
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 111,218
Kudos: 820,162
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
mithun2vrs
Bunuel
10. There is at least one viper and at least one cobra in a Pandora's box. How many cobras are there?

Quite tricky.

(1) There are total 99 snakes in Pandora's box. Clearly insufficient.

(2) From any two snakes from Pandora's box at least one is a viper. Since from ANY two snakes one is a viper then there can not be 2 (or more) cobras and since there is at least one cobra then there must be exactly one cobra in the box. Sufficient.

Answer: B.

How do we know that there are no other varieties of snakes other than cobra and viper. This is precisely why I chose E.

Answer to the question is B, not E.

If there is some other snake, then group of {other, cobra} will be possible and the statement (2) will be violated (basically the possibility of other variety of snake is ruled out by the same logic as the possibility of second cobra).

Hope it's clear.
User avatar
mithun2vrs
Joined: 21 Feb 2012
Last visit: 21 Aug 2013
Posts: 9
Own Kudos:
11
 [1]
Given Kudos: 3
Posts: 9
Kudos: 11
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
mithun2vrs
Bunuel
7. Set A consists of k distinct numbers. If n numbers are selected from the set one-by-one, where n<=k, what is the probability that numbers will be selected in ascending order?

(1) Set A consists of 12 even consecutive integers;
(2) n=5.

We should understand following two things:
1. The probability of selecting any n numbers from the set is the same. Why should any subset of n numbers have higher or lower probability of being selected than some other subset of n numbers? Probability doesn't favor any particular subset.

2. Now, consider that the subset selected is \(\{x_1, \ x_2, \ ..., \ x_n\}\), where \(x_1<x_2<...<x_n\). We can select this subset of numbers in \(n!\) # of ways and out of these n! ways only one, namely \(\{x_1, \ x_2, \ ..., \ x_n\}\) will be in ascending order. So 1 out of n!. \(P=\frac{1}{n!}\).

Hence, according to the above the only thing we need to know to answer the question is the size of the subset (n) we are selecting from set A.

Answer: B.

I am not sure if I understand correctly.

There are a total of k integers. So probability of selecting first integer 1/k, now probability of second integer out of k-1 integer is 1/(k-1) and so on... so selecting n integers would be 1/(k*(k-1)*(k-2)*...(k-(n-1)) so we need both k & n. Am I missing something here?

We are not interested in the probability of selecting first, second, etc numbers from the set. We are interested in the probability that numbers selected will be in ascending order.

Now, any group of n numbers is equally likely to be selected and these n numbers can be selected in n! ways, out of which only 1 will be in ascending order so the probability is 1/n!.

Hope it's clear.
I think I will still disagree, it is a classic case of choosing numbers after replacement or without replacement. You interpret as earlier option and I later. Your thots pls
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 12 Jun 2026
Posts: 111,218
Own Kudos:
820,162
 [1]
Given Kudos: 106,763
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 111,218
Kudos: 820,162
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
mithun2vrs
Bunuel
mithun2vrs
I think I will still disagree, it is a classic case of choosing numbers after replacement or without replacement. You interpret as earlier option and I later. Your thots pls

I think you misinterpret the question. We are not talking about the replacement at all, we are talking about the probability of selecting some group in certain order. Just try to calculate the probability of choosing 5 numbers out of 12 distinct numbers in ascending order and compare it to the probability of choosing 5 numbers out of 24 distinct numbers in ascending order.

Sorry to keep on with the problem,

Probability is defined as No of fav outcomes / No of Total possible outcomes

With your example,
in both cases No of favorable outcomes is 1 and in 1st case No of total possible outcomes is 12c5 and in the second case No of total possible outcomes is 24c5. Pls correct me where I am going wrong.

Again: you count the probability of selecting 5 numbers out of 12 or 24, whereas the question asks about the probability of selecting some group of numbers in a certain ORDER. You just interpret the question in a wrong way.
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 12 Jun 2026
Posts: 111,218
Own Kudos:
820,162
 [1]
Given Kudos: 106,763
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 111,218
Kudos: 820,162
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
alphabeta1234
Bunuel
8. If p is a positive integer, what is the remainder when p^2 is divided by 12?

(1) p is greater than 3. Clearly insufficient: different values of \(p\) will give different values of the remainder.
(2) p is a prime. Also insufficient: if \(p=2\) then the remainder is 4 but if \(p=3\) then the remainder is 9.

(1)+(2) You can proceed with number plugging and try several prime numbers greater than 3 to see that the remainder will always be 1 (for example try \(p=5\), \(p=7\), \(p=11\)).

If you want to double-check this with algebra you should apply the following property of the prime number: any prime number greater than 3 can be expressed either as \(p=6n+1\) or \(p=6n-1\).

If \(p=6n+1\) then \(p^2=36n^2+12n+1\) which gives remainder 1 when divided by 12;

If \(p=6n-1\) then \(p^2=36n^2-12n+1\) which also gives remainder 1 when divided by 12.

Answer: C.


Hey Bunuel,

I am intrigued by your second method. But if n=6 we get \(p=6n+1=25\), a multiple of 5. Can this be a problem?

Moreover, for your method to show that the remaind was equal to 1. Is this what you did ?

\(p^2=36n^2+12n+1=12(3n^2+n)+1=12k+1\) ?

Thank you!

Any prime number \(p>3\) when divided by 6 can only give remainder of 1 or 5 (remainder can not be 2 or 4 as in this case \(p\) would be even and remainder can not be 3 as in this case \(p\) would be divisible by 3).

So any prime number \(p>3\) could be expressed as \(p=6n+1\) or\(p=6n+5\) (\(p=6n-1\)), where \(n\) is an integer >1.

But:
Not all number which yield a remainder of 1 or 5 upon division by 6 are prime, so vise-versa of above property is not correct. For example 25 (for \(n=4\)) yields a remainder of 1 upon division by 6 and it's not a prime number.

alphabeta1234

Moreover, for your method to show that the remaind was equal to 1. Is this what you did ?

\(p^2=36n^2+12n+1=12(3n^2+n)+1=12k+1\) ?

Thank you!

Yes, first two terms in \(p^2=36n^2+12n+1\) are divisible by 12 so leave no remainder and 1 divided by 12 yields reminder of 1.

Hope it helps.
avatar
some2none
Joined: 21 Nov 2010
Last visit: 08 May 2012
Posts: 4
Own Kudos:
1
 [1]
Given Kudos: 2
GPA: 3.65
Posts: 4
Kudos: 1
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Bunuel
7. Set A consists of k distinct numbers. If n numbers are selected from the set one-by-one, where n<=k, what is the probability that numbers will be selected in ascending order?

(1) Set A consists of 12 even consecutive integers;
(2) n=5.

We should understand following two things:
1. The probability of selecting any n numbers from the set is the same. Why should any subset of n numbers have higher or lower probability of being selected than some other subset of n numbers? Probability doesn't favor any particular subset.

2. Now, consider that the subset selected is \(\{x_1, \ x_2, \ ..., \ x_n\}\), where \(x_1<x_2<...<x_n\). We can select this subset of numbers in \(n!\) # of ways and out of these n! ways only one, namely \(\{x_1, \ x_2, \ ..., \ x_n\}\) will be in ascending order. So 1 out of n!. \(P=\frac{1}{n!}\).

Hence, according to the above the only thing we need to know to answer the question is the size of the subset (n) we are selecting from set A.

Answer: B.

Some amount of ambiguity exists, at least to me, in the question. The ambiguity disappears if the question asks
what is the probability that SELECTED numbers (=n) will be in ascending order? rather than
what is the probability that numbers will be selected in ascending order?

The ambiguity is caused by the fact that question clearly says that n out of k ARE SELECTED one by one. So, any further reference of selection, unless clearly stated, naturally considers n out k possibilities.
avatar
lateapp
Joined: 05 May 2012
Last visit: 12 Apr 2013
Posts: 2
Own Kudos:
9
 [1]
Given Kudos: 12
Posts: 2
Kudos: 9
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
3. If x and y are integers, is y an even integer?

(1) 4y^2+3x^2=x^4+y^4 --> rearrange: \(3x^2-x^4=y^4-4y^2\) --> \(x^2(3-x^2)=y^2(y^2-4)\). Notice that LHS is even for any value of \(x\): if \(x\) is odd then \(3-x^2=odd-odd=even\) and if \(x\) is even then the product is naturally even. So, \(y^2(y^2-4y)\) is also even, but in order it to be even \(y\) must be even, since if \(y\) is odd then \(y^2(y^2-4y)=odd*(odd-even)=odd*odd=odd\). Sufficient.

(2) y=4-x^2 --> if \(x=odd\) then \(y=even-odd=odd\) but if \(x=even\) then \(y=even-even=even\). Not sufficient.

Answer: A.

Regarding statement (1), I understood how we got \(x^2(3-x^2)=y^2(y^2-4)\). Later, we are examining \(y^2(y^2-4y)\) - question: how did we get this extra 'y' here? Am getting a lot of DS questions wrong, would appreciate if you could explain. Thanks.
   1   2   3   4   
Moderators:
Math Expert
111218 posts
377 posts