[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
Please, help: GMAT Club Tests 24 Q. # 36 : 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:

But I want to clarify one point which was not clarified by the discussion run on the link referred above ( at least it is not clear to me)

The problem is:

How many divisors does positive integer N have? 1) The difference between the largest and the smallest divisor of N is 21 2) N+1 has 2 divisors

Here is a point which is not clear to me: whether negative integers can, from the official GMAT tests' point, be considered divisors of a positive integer? Regarding of the problem given here, whether -20 can be taken as a divisor of N? If "yes", then the condition (1) must also not be sufficient. Insofar as I know the problem does not specify that a divisor of N must be a positive integer. Taking this into account one may on the basis of the problem assume that except zero any integer, regardless -ve or +ve one, can be a divisor of N provided the result must be a whole number.

Thanks for your help and + 1 kudos for any clarification.

But I want to clarify one point which was not clarified by the discussion run on the link referred above ( at least it is not clear to me)

The problem is:

How many divisors does positive integer N have? 1) The difference between the largest and the smallest divisor of N is 21 2) N+1 has 2 divisors

Here is a point which is not clear to me: whether negative integers can, from the official GMAT tests' point, be considered divisors of a positive integer? Regarding of the problem given here, whether -20 can be taken as a divisor of N? If "yes", then the condition (1) must also not be sufficient. Insofar as I know the problem does not specify that a divisor of N must be a positive integer. Taking this into account one may on the basis of the problem assume that except zero any integer, regardless -ve or +ve one, can be a divisor of N provided the result must be a whole number.

Thanks for your help and + 1 kudos for any clarification.

ALL GMAT divisibility questions are limited to positive integers only. For example, every GMAT divisibility question will tell you in advance that any unknowns represent positive integers. _________________

But I want to clarify one point which was not clarified by the discussion run on the link referred above ( at least it is not clear to me)

The problem is:

How many divisors does positive integer N have? 1) The difference between the largest and the smallest divisor of N is 21 2) N+1 has 2 divisors

Here is a point which is not clear to me: whether negative integers can, from the official GMAT tests' point, be considered divisors of a positive integer? Regarding of the problem given here, whether -20 can be taken as a divisor of N? If "yes", then the condition (1) must also not be sufficient. Insofar as I know the problem does not specify that a divisor of N must be a positive integer. Taking this into account one may on the basis of the problem assume that except zero any integer, regardless -ve or +ve one, can be a divisor of N provided the result must be a whole number.

Thanks for your help and + 1 kudos for any clarification.

ALL GMAT divisibility questions are limited to positive integers only. For example, every GMAT divisibility question will tell you in advance that any unknowns represent positive integers.

Many thanks to you, Bunuel. I highly appreciate your help.