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
Live EA class + 6 months of EA OnDemand
  • Expert-led weekly online sessions
  • EA Masterclass access between classes
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.

130-point 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.

smallest possible value

Expert replies
by uptowngirl92 » Mon Sep 28, 2009 6:49 pm
n is a positive integer, and k is the product of all integers from 1 to n inclusive. If k is a multiple of 1440, then the smallest possible value of n is
Join the discussion
Source: — Problem Solving |

by sunnyjohn » Mon Sep 28, 2009 6:59 pm
k = n! = 1440x

n! = 720*2*x
n! = 6! *2*x

we have to make it a factorial, smallest possible:

next possible factorial is 7 :- x ==> 3.5 (hmm i m assuming that x is positive integer)

next possible factorial is 8 :- x ==> 28
put x = 28
n! = 6!*2*28 ==> 6!*7*8
n!= 8!

n = 8 :---> least possible value of n is 8.
Join the discussion

by okigbo » Wed Oct 21, 2009 11:52 am
Is there another explaination of how to solve this problem?
Join the discussion