-
poonam1279
- Master | Next Rank: 500 Posts
- Posts: 145
- Joined: Thu Nov 13, 2008 7:18 am
- Location: United Kingdom
- Thanked: 5 times
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
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
Product & prime factors
Source: Beat The GMAT — Problem Solving |
the answer is more than 40, but it is a hard question. you can find the solution is a recently posted topic, with 3-4 various approach to solve. search for than.
it hs been dicussed 1000 times. I ll search and ll let u know the link. But its a tuf ques. no doubt abt it
And it is the 3rd question in the test!! NICE!
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
Ian Stewart wrote: You are not free to pick a value of n here; the question asks specifically about h(100) + 1. That is, n = 100.
What is h(100)?
h(100) = 2*4*6*...*96*98*100 = (2*1)*(2*2)*(2*3)*...*(2*48)*(2*49)*(2*50) = (2^50)*50!
So we need to know about the smallest prime factor of (2^50)*50! + 1.
Notice that 50! is divisible by every prime less than 50. That ensures that (2^50)*50! is divisible by every prime less than 50, which ensures that (2^50)*50! + 1 will be divisible by no prime less than 50: the remainder will be 1 each time. The smallest prime factor of h(100) + 1 must therefore be larger than 50 (and therefore certainly larger than 40). E.
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
















