BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Divisibility problem

Expert replies
Source: — Data Sufficiency |

by anshumishra » Mon Jan 03, 2011 7:20 pm
tonebeeze wrote: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

OA is A
Statement 1:
Sufficient
Please note that the largest divisor is the number itself (and smallest is 1), so we know the number.

Statement 2:
Insufficient
you can check with different values of n, that thsi will give different results.

Hence, A
Thanks
Anshu

(Every mistake is a lesson learned )
Join the discussion

by Anurag@Gurome » Mon Jan 03, 2011 7:22 pm
tonebeeze wrote: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
Statement 1: The difference between the largest and the smallest divisor of N is 21
Largest divisor of any positive integer is the integer itself and smallest divisor of any positive integer is 1. Thus, (Integer - 1) = 21 => The integer is 22. We can easily determine the number of divisors of 22.

Sufficient.

Statement 2: N+1 has 2 divisors
This implies (N + 1) is a prime. But there is infinite number of positive integers N such that (N + 1) is prime.

Not Sufficient.

The correct answer is A.
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/
Join the discussion

by aleph777 » Tue Jan 04, 2011 8:08 am
Another point I think worth mentioning is that "divisors" is synonymous with "factors." So you're simply looking for the number of factors of N.
Join the discussion