Last visit was: 23 Apr 2026, 16:27 It is currently 23 Apr 2026, 16:27
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
AlexTsipkis
Joined: 09 Aug 2006
Last visit: 16 Oct 2007
Posts: 11
Own Kudos:
Posts: 11
Kudos: 3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
yuefei
Joined: 02 Aug 2007
Last visit: 02 Oct 2009
Posts: 45
Own Kudos:
Posts: 45
Kudos: 271
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
AlexTsipkis
Joined: 09 Aug 2006
Last visit: 16 Oct 2007
Posts: 11
Own Kudos:
Posts: 11
Kudos: 3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
AlexTsipkis
Joined: 09 Aug 2006
Last visit: 16 Oct 2007
Posts: 11
Own Kudos:
Posts: 11
Kudos: 3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Nope. Wrong. The answer which i have is different from the one which you people are giving.

Olga, why do you think that the first digit should not be zero. The digits can be like 015, 021 etc etc.
User avatar
AlexTsipkis
Joined: 09 Aug 2006
Last visit: 16 Oct 2007
Posts: 11
Own Kudos:
3
 [2]
Posts: 11
Kudos: 3
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Well, i explain the answer of part a.

The problem says that we have to choose 3 odd - digit numbers from 0,1,2,3,4,5 if each digit can only be used once.

The last digit can be chosen in 3 ways(1,3,5) so we have 3 choices for the last digit.

First digit can be chosen in 4 ways assuming that 0 can't be chosen as the first digit and the last digit has already been chosen.

Second digit can also be chosen in 4 ways assuming that the last and first digits have been already chosen.

By the product rule 4.4.3 = 48 ways to choose 3-digit odd numbers without repitition.

Simple .
User avatar
AlexTsipkis
Joined: 09 Aug 2006
Last visit: 16 Oct 2007
Posts: 11
Own Kudos:
Posts: 11
Kudos: 3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
b) If you read the question properly, it says that if we pick a number randomly from the numbers we have already got from part a, what is the probability that it is less then 200?

So it can't contain all the numbers between 100 to 200 , as we can't count 107, 109 etc , as in part a, we form odd numbers from 0,1,2,3,4,5.

Therefore considering this, we have only 1 choice for the 1st digit.

As the numbers shouldn't repeat , so we have only 2 choices left for the last digit, b/c we already have 1 in the first digit.

Once the 1st and last digit are chosen , we have 4 choices for the 2nd digit.

So by product rule we have 1.2.4 = 8 numbers that are less then 200 and contain only the digits (0,1,2,3,4,5).

So , P = 8 /48 = 1/6.

And that is also the official answer.
User avatar
AlexTsipkis
Joined: 09 Aug 2006
Last visit: 16 Oct 2007
Posts: 11
Own Kudos:
Posts: 11
Kudos: 3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
First digit can't be chosen in 5 ways. It should be in 4 ways because we only have 4 choices left after the 0 is omitted AND after the last digit has been chosen. So we should omit "0" and the "last digit , whatever it is" from our choices.

Same is the case with the second digit.
User avatar
Djames
Joined: 27 Sep 2007
Last visit: 18 Oct 2007
Posts: 10
Own Kudos:
Posts: 10
Kudos: 2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Quote:
First digit can't be chosen in 5 ways. It should be in 4 ways because we only have 4 choices left after the 0 is omitted AND after the last digit has been chosen. So we should omit "0" and the "last digit , whatever it is" from our choices.

Same is the case with the second digit.


you are wrong here.
Look: when you exclude 0 from the first digit, one digit numbers are also excluded cause 1 = 01 = 001 (u have excluded 2 digit numbers and in this situation one digit numbers appear to be 2 digit numbers indeed with 0 leading), so first digit you can choose in 5 ways and the next one to the end you can choose in 6 ways.
User avatar
ramubhaiya
Joined: 16 Oct 2007
Last visit: 18 Nov 2007
Posts: 10
Posts: 10
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Well AlexTsipkis:

I get a slightly diff answer I dont know what is wrong in my approach.

I start from the last digit and move 3,2,1
last digit should be odd hence (1,3,5) = 3 ways
2nd digit no restriction but 1 already gone = 5 ways
1st digit cannot be zero + 2 already gone = 3 ways
3*5*3 = 45 ways!

Thx

AlexTsipkis
Well, i explain the answer of part a.

The problem says that we have to choose 3 odd - digit numbers from 0,1,2,3,4,5 if each digit can only be used once.

The last digit can be chosen in 3 ways(1,3,5) so we have 3 choices for the last digit.

First digit can be chosen in 4 ways assuming that 0 can't be chosen as the first digit and the last digit has already been chosen.

Second digit can also be chosen in 4 ways assuming that the last and first digits have been already chosen.

By the product rule 4.4.3 = 48 ways to choose 3-digit odd numbers without repitition.

Simple .
User avatar
Djames
Joined: 27 Sep 2007
Last visit: 18 Oct 2007
Posts: 10
Own Kudos:
Posts: 10
Kudos: 2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Quote:

Quote:
First digit can't be chosen in 5 ways. It should be in 4 ways because we only have 4 choices left after the 0 is omitted AND after the last digit has been chosen. So we should omit "0" and the "last digit , whatever it is" from our choices.

Same is the case with the second digit.


you are wrong here.
Look: when you exclude 0 from the first digit, one digit numbers are also excluded cause 1 = 01 = 001 (u have excluded 2 digit numbers and in this situation one digit numbers appear to be 2 digit numbers indeed with 0 leading), so first digit you can choose in 5 ways and the next one to the end you can choose in 6 ways.


i didn't see that that each digit should be used only once
so it semms to me that ramubhaiya's approach is right.
User avatar
Ravshonbek
Joined: 09 Jul 2007
Last visit: 15 Jul 2008
Posts: 565
Own Kudos:
Location: London
Posts: 565
Kudos: 575
Kudos
Add Kudos
Bookmarks
Bookmark this Post
a)How many odd three - digit numbers can be formed from the digits (0,1,2,3,4,5) if each digit is to be used only once?

6 digits to choose from

xx(1or3or5)

last digit: 3/6
second digit: 1/5 (any digit other than the last one thus one out of five)
first digit: 1/3 (0 out, second and the last digits chosen already, so 1 out of 3 left)

thus
(1/3)*(1/5)*(3/6)=3/90=1/30
now how many three digit numbers are there: 999-100+1=900

so 900*1/30=30
User avatar
Ravshonbek
Joined: 09 Jul 2007
Last visit: 15 Jul 2008
Posts: 565
Own Kudos:
Location: London
Posts: 565
Kudos: 575
Kudos
Add Kudos
Bookmarks
Bookmark this Post
b) If we randomly pick one from these numbers , what is the probability that it is less than 200?[/quote]

200-100=100, so 100 numbers less than 200
999-100+1=900 total

100/900=1/9
User avatar
JingChan
Joined: 07 Sep 2007
Last visit: 29 May 2008
Posts: 64
Own Kudos:
Posts: 64
Kudos: 46
Kudos
Add Kudos
Bookmarks
Bookmark this Post
ramubhaiya
Well AlexTsipkis:

I get a slightly diff answer I dont know what is wrong in my approach.

I start from the last digit and move 3,2,1
last digit should be odd hence (1,3,5) = 3 ways
2nd digit no restriction but 1 already gone = 5 ways
1st digit cannot be zero + 2 already gone = 3 ways
3*5*3 = 45 ways!

Thx

AlexTsipkis
Well, i explain the answer of part a.

The problem says that we have to choose 3 odd - digit numbers from 0,1,2,3,4,5 if each digit can only be used once.

The last digit can be chosen in 3 ways(1,3,5) so we have 3 choices for the last digit.

First digit can be chosen in 4 ways assuming that 0 can't be chosen as the first digit and the last digit has already been chosen.

Second digit can also be chosen in 4 ways assuming that the last and first digits have been already chosen.

By the product rule 4.4.3 = 48 ways to choose 3-digit odd numbers without repitition.

Simple .


You have to choose the 100s digit before the 10s digit. If you choose the 10s digit, you no longer have symmetry in your outcomes. (Choosing '0' for the 10s digit allows 4 choices where choosing any other number allows 3 choices.)

If you wanted to do it your way:
3 ways to choose 1s digit
5 ways to choose 10s digit
(1/5)*4 + (4/5)*3 ways to choose 100s digit

3 * 5 * ((1/5)*4 + (4/5)*3) = 48 ways
User avatar
Djames
Joined: 27 Sep 2007
Last visit: 18 Oct 2007
Posts: 10
Own Kudos:
Posts: 10
Kudos: 2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Quote:
(1/5)*4 + (4/5)*3 ways to choose 100s digit



plz, could you explain this expression ((1/5)*4 + (4/5)*3), how did you recive that, i mean theory?
User avatar
AlexTsipkis
Joined: 09 Aug 2006
Last visit: 16 Oct 2007
Posts: 11
Own Kudos:
Posts: 11
Kudos: 3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Djames,

Your approach and understanding of the problem is totally Wrong.

I have explained my approach and my approach and understanding gives me the right answer which is the OA.
User avatar
Djames
Joined: 27 Sep 2007
Last visit: 18 Oct 2007
Posts: 10
Own Kudos:
Posts: 10
Kudos: 2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
AlexTsipkis
i agree with you, i was wrong and i've got your explanation.
Now i'm interested in JingChan approach, cause i want to understand what he did.
User avatar
JingChan
Joined: 07 Sep 2007
Last visit: 29 May 2008
Posts: 64
Own Kudos:
Posts: 64
Kudos: 46
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Djames
AlexTsipkis
i agree with you, i was wrong and i've got your explanation.
Now i'm interested in JingChan approach, cause i want to understand what he did.


Don't get me wrong, I used Alex's approach when I did the problem.


For the 10s choice:
1 choice (0) allows you to get 4 choices for the 100s
::> 4

4 choices allows you to get 3 choices for the 100s
::> 3+3+3+3

So you take the 3 for the 1s digit multiplied by the number of outcomes from the remaining digits.
::> 3 * (4+3+3+3+3) = 48

This would be the same as:
::> 3 * 5 * avg(choices for 100s place)
User avatar
GK_Gmat
Joined: 09 Aug 2006
Last visit: 28 Feb 2009
Posts: 348
Own Kudos:
Posts: 348
Kudos: 1,078
Kudos
Add Kudos
Bookmarks
Bookmark this Post
JingChan
ramubhaiya
Well AlexTsipkis:

I get a slightly diff answer I dont know what is wrong in my approach.

I start from the last digit and move 3,2,1
last digit should be odd hence (1,3,5) = 3 ways
2nd digit no restriction but 1 already gone = 5 ways
1st digit cannot be zero + 2 already gone = 3 ways
3*5*3 = 45 ways!

Thx

AlexTsipkis
Well, i explain the answer of part a.

The problem says that we have to choose 3 odd - digit numbers from 0,1,2,3,4,5 if each digit can only be used once.

The last digit can be chosen in 3 ways(1,3,5) so we have 3 choices for the last digit.

First digit can be chosen in 4 ways assuming that 0 can't be chosen as the first digit and the last digit has already been chosen.

Second digit can also be chosen in 4 ways assuming that the last and first digits have been already chosen.

By the product rule 4.4.3 = 48 ways to choose 3-digit odd numbers without repitition.

Simple .

You have to choose the 100s digit before the 10s digit. If you choose the 10s digit, you no longer have symmetry in your outcomes. (Choosing '0' for the 10s digit allows 4 choices where choosing any other number allows 3 choices.)

If you wanted to do it your way:
3 ways to choose 1s digit
5 ways to choose 10s digit
(1/5)*4 + (4/5)*3 ways to choose 100s digit

3 * 5 * ((1/5)*4 + (4/5)*3) = 48 ways


Jingchan, Can you pls. explain what you mean by 'symmetry in your outcomes'? Is this always the case? For example what if this was a 4 digit odd integer that we were choosing?

Also can you pls. explain how you get (1/5)*4 + (4/5)*3 ways to choose 100s digit?? thanks.
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,964
Own Kudos:
Posts: 38,964
Kudos: 1,117
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.

Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!