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

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

least possible value

Expert replies
by lenagmat » Wed Oct 26, 2011 4:03 am
If the product of the integers from 1 to n is divisible by 490, what is the least possible value of n?
(A) 7
(B) 14
(C) 21
(d) 28
(E) 35

Here is the answer, that I found. But I completly do not understand why it is not 7 (7<14) ?

490 = 7 x 7 x 5 x 2 = 14 x 7 x 5

Let the number be 'N'

N/490 = integer

Therefore, if the denominator is to be completely cancelled out from the numerator, N must contain 14, 7 and 5.

=> the smallest value of n must be 14.
Join the discussion
Source: — Problem Solving |

by neelgandham » Wed Oct 26, 2011 4:12 am
lenagmat wrote: Here is the answer, that I found. But I completly do not understand why it is not 7 (7<14) ?
1)Let us say the answer = 7, so 1*2*3*4*5*6*7 is divisible by 490. Let us check if it really is.

490=7*7*5*2, so 1*2*3*4*5*6*7/(7*7*5*2) = (1*3*4*6/7), (dividing numerator and denominator by (7*5*2))
1*3*4*6 is not divisible by 7 => 1*2*3*4*5*6*7 is not divisible by 490(7*7*5*2).

2)Let us say the answer = 14, so 1*2*3*4*5*6*7*8*9*10*11*12*13*14 is divisible by 490. Let us check if it really is.

490=7*7*5*2, so 1*2*3*4*5*6*7*8*9*10*11*12*13*14/(7*7*5*2) = (1*3*4*6*8*9*10*11*12*13*2), (dividing numerator and denominator by (7*5*2*7)). => 1*2*3*4*5*6*7*8*9*10*11*12*13*14 is divisible by 490
Anil Gandham
Welcome to BEATtheGMAT | Photography | Getting Started | BTG Community rules | MBA Watch
Check out GMAT Prep Now's online course at https://www.gmatprepnow.com/
Join the discussion

by kmittal82 » Wed Oct 26, 2011 4:15 am
The key here is:
"If the product of the integers from 1 to n", which is basically n!

If we use 7!, we can cancel out 7,5,2 from the denominator, which still leaves us with an extra 7 in the denominator, hence thats not the answer

Using 14, we cancel out all the terms of the denominator, hence (B)
Join the discussion