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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 350,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

I am gonna go off on a limb and chose A
because all multiples of 3 are not odd 3,6,9,12
and 3*1 works; 2*3 will also work....terefore negating statement two
(A)

Statement 2 is in sufficient cause it would mean that the clean numbers are 3, 5,7...
statement 1 shows that it is 3,5, 6,7..
does that show why there is at least 1 non odd number?

The question is:
what is the probab of selecting a " clean" number from a set of integers containing all multiples of 3 between 1 and 99, inclusive?

So in my opinion all you need is a definition of what a clean number is. From both statements you can get a definite number of integers that fulfill the criterion mentioned...so therfore I think the answer is D.

And statement 2 should be sufficient because all you have to do is pick the odd number which are multiples of 3 and divide them by all the odd numbers between 1 and 99...don't see why that isn't sufficient _________________

The question is: what is the probab of selecting a " clean" number from a set of integers containing all multiples of 3 between 1 and 99, inclusive?

So in my opinion all you need is a definition of what a clean number is. From both statements you can get a definite number of integers that fulfill the criterion mentioned...so therfore I think the answer is D.

And statement 2 should be sufficient because all you have to do is pick the odd number which are multiples of 3 and divide them by all the odd numbers between 1 and 99...don't see why that isn't sufficient

definitely, i agree with u my man...the basic object is to find 'probability' not 'validity'

This question is similar to another one posted here somewhere. Statement 1 gives a complete (in itself) definition of a clean number whereas Statement 2 only describes what could be one of many attributes of a clean no.

The set is clearly defined. Whatever the restrictions the statements 1 and 2 impose, we can still find a single probability. So it is D

Note: If the set were infinite, we can't find a probability.

EDIT: On rethink - A is probably it.
Statement 2 does not clearly define a Clean number.
A clean number must be odd does not imply all odd numbers are clean numbers.

Re: DS-probab-multiples [#permalink]
19 Feb 2005, 21:52

swath20 wrote:

what is the probab of selecting a " clean" number from a set of integers containing all multiples of 3 between 1 and 99, inclusive?

(1) A " clean" no is an integer divisible only by 2 factors, one of which is greater than 2 (2) A " clean" no must be odd

using each statement seperately, both are suff to ans independently. but if you, take stat 1 into consideration 2 seems incomplete. we know that a clean number is only 3 and each st must give a specific answer. therefore, OA should be A. however, we cannot totaly disagree with the other part of the discussions.

Re: DS-probab-multiples [#permalink]
23 Feb 2005, 09:04

swath20 wrote:

what is the probab of selecting a " clean" number from a set of integers containing all multiples of 3 between 1 and 99, inclusive?

(1) A " clean" no is an integer divisible only by 2 factors, one of which is greater than 2

(2) A " clean" no must be odd

We are asked to find the probability. We are not asked to find one "clean" number. In other words, as some of the others already mentioned here, as long as the definition is clearly defined, then we will be able to identify all "clean" numbers and thus the probability of pick them from a clearly defined set.

On this note, (1) is clearly define, but (2) is not. (2) would be sufficient if it is formulated like this:
(2) A "clean" number means an odd number.

When it says a clean number must be odd, we do not know if there's other requirements for a clean number. Perhaps it must be odd and greater than 50? Or whatever. As long as we don't know the exact definition of a clean number, we cannot pin down the set of clean numbers, and thus cannot find the probability that we were asked to find.