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

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

MGMAT - Need Help

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Senior | Next Rank: 100 Posts
Posts: 71
Joined: Wed Aug 22, 2007 12:29 pmFollowed by: 1 member
Location: USA
Thanked: 12 times
by wizardofwashington » Mon Sep 24, 2007 4:02 pm
If g(n) represented the product of every even integer from 2 to n, then g(80) + 1 is divisible by the lowest prime number p. P is:

A. Between 1 and 10
B. Between 11 and 20
C. Between 21 and 30
D. Between 31 and 40
E. Greater than 40

Can you help with this. Not sure what the OA is.
A falling tree resounds... but a forest grows in silence...
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
Master | Next Rank: 500 Posts
Posts: 321
Joined: Tue Aug 28, 2007 5:42 am
Thanked: 1 times

by kajcha » Mon Sep 24, 2007 6:43 pm
g(80) = 2*4*6*8............*80

= 2*(2*2)*(2*3)*(2*4)........*(2*40)

= (2^40)*(1*2*3*4.....*40)

= (2^40)(40!)

Means g(80) is divisible by all integers till 40. The prime no less than 40 is 37 that divides g(80). So, 37 will not divide g(80)+1

So, next prime no that would divide g(80)+1 should be greater than 40.

Ans should be E. IMO
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Senior | Next Rank: 100 Posts
Posts: 45
Joined: Wed Jun 20, 2007 12:40 pm
Location: Cleveland, OH

by niks_01.27 » Mon Sep 24, 2007 7:13 pm
The question says, "g(80) + 1 is divisible by the lowest prime number p".
And, 37 is the highest prime number that divides g(80). I think I'm not able to understand the solution.
regards
niks...
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Master | Next Rank: 500 Posts
Posts: 321
Joined: Tue Aug 28, 2007 5:42 am
Thanked: 1 times

by kajcha » Mon Sep 24, 2007 7:20 pm
Any number less than 40 is a factor of g(80) so it is not a factor of g(80)+1. Hence, the smallest factor of g(80)+1 will be greater than 40.

Hope this clears the doubt...
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Senior | Next Rank: 100 Posts
Posts: 45
Joined: Wed Jun 20, 2007 12:40 pm
Location: Cleveland, OH

by niks_01.27 » Mon Sep 24, 2007 7:55 pm
kajcha wrote:Any number less than 40 is a factor of g(80) so it is not a factor of g(80)+1. Hence, the smallest factor of g(80)+1 will be greater than 40.

Hope this clears the doubt...
g(2n) = 2^n (n!)

g( 6 ) = 48; lowest prime number that divides 49 is 7.
g( 8 ) = 384; lowest prime number that divides 385 is 5.

How can you generalize that the smallest (prime) factor of g(80)+1 will be greater than 40. May be I need go back and open the basic mathematics books again.
regards
niks...
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Junior | Next Rank: 30 Posts
Posts: 22
Joined: Fri Aug 31, 2007 8:14 am

by mtg123 » Tue Sep 25, 2007 4:30 am
g(2n) = 2^n (n!)

g( 6 ) = 48; lowest prime number that divides 49 is 7.
g( 8 ) = 384; lowest prime number that divides 385 is 5.


as we see here , g(2n) = g(8). So n = 4
the lowest prime number that divides 385 is 5 which is > 4
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Master | Next Rank: 500 Posts
Posts: 460
Joined: Sun Mar 25, 2007 7:42 am
Thanked: 27 times

by samirpandeyit62 » Tue Sep 25, 2007 6:11 am
g(80) = 2*3*.....79*80

so any prime nos, as a matter of fact any nos from 2..80 will divide g(80) evenly, hence it will give a remainder of 1 when dividing g(80) +1

so any prime factor of g(80) +1 should be greater that 80 hence greater than 40.
Regards
Samir
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Master | Next Rank: 500 Posts
Posts: 321
Joined: Tue Aug 28, 2007 5:42 am
Thanked: 1 times

by kajcha » Tue Sep 25, 2007 6:53 am
mtg/niks

g(6) = 2*3*4*5*6 = 720. How did you calculate it be 48???

similarly g(8) = 40320 :?:
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Senior | Next Rank: 100 Posts
Posts: 45
Joined: Wed Jun 20, 2007 12:40 pm
Location: Cleveland, OH

by niks_01.27 » Tue Sep 25, 2007 2:17 pm
g( 6 ) = g( 2x3 ) = 2^3 x (3!) = 8 x 6 = 48.

And I got the point. Thanks for taking time to explain.
regards
niks...
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1