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

Redeem

GMATPrep - function h(n)...

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Junior | Next Rank: 30 Posts
Posts: 20
Joined: Wed Feb 06, 2008 7:59 am

GMATPrep - function h(n)...

by steinbock » Mon Jun 02, 2008 7:32 am
Got this wrong on my prep test. Can someone help?

For every positive even integer n, the function h(n) is defined to be the product of all even integers from 2 to n, inclusive. If p is the smallest prime factor of h(100) + 1, then p is

A) Between 2 and 10
B) Between 10 and 20
C) Between 20 and 30
D) Between 30 and 40
E) Greater than 40

OA is E
Top
Source: — Problem Solving |
Master | Next Rank: 500 Posts
Posts: 106
Joined: Sun Feb 17, 2008 10:09 pm
Thanked: 3 times

by ksh » Mon Jun 02, 2008 8:02 am
Hi steins,
here no. of even integers would be (100-2)/2 +1=50
if p is the smallest prime factor
h(100)+1=2*4*6*......100+1
so, p will be 47 which is more than 40.
answer E
Top

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 2623
Joined: Mon Jun 02, 2008 3:17 am
Location: Montreal
Thanked: 1090 times
Followed by:355 members
GMAT Score:780

Re: GMATPrep - function h(n)...

by Ian Stewart » Mon Jun 02, 2008 3:56 pm
steinbock wrote:Got this wrong on my prep test. Can someone help?

For every positive even integer n, the function h(n) is defined to be the product of all even integers from 2 to n, inclusive. If p is the smallest prime factor of h(100) + 1, then p is

A) Between 2 and 10
B) Between 10 and 20
C) Between 20 and 30
D) Between 30 and 40
E) Greater than 40

OA is E
The explanation in the previous post is incorrect.

Notice that h(100) = 2*4*6*...*98*100
so h(100) = 2^50 * 50!

The point here is that h(100) is divisible by everything up to 50-- it's equal to 2^50 * 50!, and 50! is divisible by everything less than or equal to 50.

So, you can divide h(100) by any prime less than 50. That guarantees that h(100) + 1 will *not* be divisible by any prime less than 50. Try dividing it by, say, 37: h(100) is divisible by 37, so you'll get a remainder of 1 when you divide h(100) + 1 by 37, since h(100)+1 is one greater than a multiple of 37. Because of this, there's no way you can divide h(100)+1 by any prime less than 50- every time the remainder is certain to be 1.

So, what's the smallest prime divisor of h(100) + 1? That would take a very long time to work out, believe me. But we can be sure it's greater than 50.
Top
Junior | Next Rank: 30 Posts
Posts: 20
Joined: Wed Feb 06, 2008 7:59 am

by steinbock » Tue Jun 03, 2008 9:43 am
Ksh and Ian, thanks for answering. That was quite a tough one. For me atleast...
Top
Post new topic Post Reply
• Page 1 of 1