[phpBB Debug] PHP Notice: in file /includes/viewtopic_mods/timer.php on line 168: array_key_exists() expects parameter 2 to be array, null given [phpBB Debug] PHP Notice: in file /includes/viewtopic_mods/timer.php on line 169: array_key_exists() expects parameter 2 to be array, null given [phpBB Debug] PHP Notice: in file /includes/viewtopic_mods/timer.php on line 170: array_key_exists() expects parameter 2 to be array, null given
m02#24 : Retired Discussions [Locked]

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 thought of this as a combination problem with a duplicate choice 4! / 2 !

4! because I have to put the numbers in order A*B*C*D

2! because I have a duplicate choice (3)

Can anyone tell me if this will work for other situations? or did I just confuse myself and everyone else?

Alternatively, I write these questions out starting with the largest and smallest factor (I am using the .... to show that I write them a good distance apart on my scratch paper.) 1 .............................................................................................................. 90 next 1, 2,...........................................................................45, 90 1, 2, 3 30, 45, 90 1, 2, 3, 5, 18, 30, 45, 90 If find that doing things this way prevents me from having duplicates and quickly gets me to a situation where I know I have covered all the possibilities. This method is really only good for number less than 100. For example if you had 87452, it might take too much time to do this.

To know the number of number of factors for a number , we need to split the number in the following way

Number = a^x * b^y * c^z .......so on

The number of factors would be (x+1)*(y+1)*(z+1)...so on

Applying the above to the current example

90 = 2^1 * 3^2 * 5^1

The number of factors = (1+1) * (2+1) * (1+1) = 2*3*2 = 12

Please send kudos if you like this

This is definitely a more methodical approach to the question. But it requires double the work. Since you anyways have to prime factor number N, I found it easier to factorize the non-prime factor further until it is represented as prime. For example, 90 = 45 x 2. Then 45 = 15 x 3. 15 = 5 x 3 and so on. At the end it is a simple math of counting the factors! _________________

-DK --------------------------------------------------------- If you like what you read then give a Kudos! Diagnostic Test: 620 The past is a guidepost, not a hitching post. ---------------------------------------------------------

To know the number of number of factors for a number , we need to split the number in the following way

Number = a^x * b^y * c^z .......so on

The number of factors would be (x+1)*(y+1)*(z+1)...so on

Applying the above to the current example

90 = 2^1 * 3^2 * 5^1

The number of factors = (1+1) * (2+1) * (1+1) = 2*3*2 = 12

Please send kudos if you like this

This is very useful if you have to determine the number of factors of very large numbers (kudos!). Finding each factor by trial-and-error would cost way to much time. Try 2496: prime factorization is much easier (2^5)*3*13 -> (5+1)*(1+1)*(1+1)=24

I got the correct answer, (E): 12 however I do have one question, do negative integers not qualify as "distinct" factors? Meaning the answer would be 12 positive distinct factors + 12 negative distinct factors = 24 distinct factors in total?