Can someone help solve this problem?

This topic has expert replies
Junior | Next Rank: 30 Posts
Posts: 26
Joined: Thu Jul 24, 2008 7:33 am

Can someone help solve this problem?

by Ilikemeat321 » Wed Aug 06, 2008 12:24 pm
For every positive even integer n, the function h(n) is defined to be the product of all the even integers from 2 to n, inclusive. If p is the smallest prime factor of h(100)+1, then p is

Between 2 and 10
Between 10 and 20
Between 20 and 30
Between 30 and 40
Greater than 40
Source: — Problem Solving |

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

by Ian Stewart » Wed Aug 06, 2008 12:58 pm
One of the most commonly asked questions on the forum- if you search for "h(n)" you should find several solutions. I've answered the question here, for example:

www.beatthegmat.com/gmat-prep-q-t14339.html

but if you need more detail, you could search for other solutions.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com

ianstewartgmat.com

Junior | Next Rank: 30 Posts
Posts: 26
Joined: Thu Jul 24, 2008 7:33 am

by Ilikemeat321 » Wed Aug 06, 2008 1:49 pm
ah ok thanks! I should use the search function more often, got bunch questions probably all been answered before.

Senior | Next Rank: 100 Posts
Posts: 35
Joined: Mon Jun 09, 2008 3:05 am
Thanked: 2 times

by Senator 153 » Fri Aug 08, 2008 1:05 pm
Just out of curiosity... are we thinking that h(100) + 1 is prime? What about "100! + 1"...?

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

by Ian Stewart » Fri Aug 08, 2008 4:07 pm
Senator 153 wrote:Just out of curiosity... are we thinking that h(100) + 1 is prime? What about "100! + 1"...?
That's a very good question, but it's very difficult to answer. We certainly know that h(100) + 1 is not divisible by any prime less than 50, but it might be divisible by 53, or by 59, or by 97, etc... there's no simple way to prove whether it is or it's not divisible by primes larger than 50. All we could do is calculate the value of h(100) + 1, and attempt long division.

The same is true of 100! + 1; it can't be divisible by primes less than 100, but it might be divisible by 101, or 103, or a lot of other primes. Without doing a superhuman amount of work (superhuman because 100! + 1 is an absolutely enormous number), it is essentially impossible to decide whether 100! + 1 is prime- you'd need a computer. It probably isn't- primes are pretty rare among numbers that large- but there's no way to be sure without getting a computer to work on the problem.

You might think of smaller numbers if you're not convinced- is 5! + 1 prime? We know 5! +1 is not divisible by any prime 5 or less, but that doesn't guarantee 5! + 1 is prime. Indeed, 5! + 1 = 121 = 11^2.; it is not prime. Similarly for 100! + 1; it might be divisible by some prime larger than 100.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com

ianstewartgmat.com