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
GMATBootcamp Starts Sep 21
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE BOOTCAMP

Live Online Bootcamp Class with Top GMAT Expert Chris Peckover

Sep 21 to Oct 9, 2026

Schedule
Mon to Fri · 7:00 to 10:00 PM ET
Included
Live classes + 6 months of TTP OnDemand
  • Boost your GMAT score in less than one month in a live online class
  • 6 months access to TTP OnDemand video courses included
View bootcamp & 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.

n

Expert replies
by crackgmat007 » Sun Oct 11, 2009 12:38 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

8
12
16
18
24
Join the discussion
Source: — Problem Solving |

by NikolayZ » Mon Oct 12, 2009 12:25 am
Hello !

I think it is A.

Since K=n!, and k is a multiple of 1440. Then we need to find the smallest value of n! that is divisible by 1440.
6!=720
7!=720*7=5040 ( not divisible by 1440)
8!=5040*8=40320
8!/1440=28. Hence, 8.
Join the discussion

by bullzeye » Mon Oct 12, 2009 4:23 am
I agree with Nikolay Z.

Other solution, with just basic math is this:
you know that the number you're looking for is a multiple of 1440. So the smallest number you are actually looking for is 1440. So let's break down 1440 (which is really easy even tough it's a big number). We know 1440 is divisible by 10 and 144 is a 12 squared. Which leave us with 12x12x10 = 3x4x3x4x2x5. So let's think that through - 10 is a multiple of 5 so we know that n>=5. We need to find the integers less than 5 that are multiples of 1440. we Have 2, 3 and 4, so we are left with 3 and 4(3x4x3x4x2x5). So the smallest multiple of 3 (remember n>=5) is 6. 8 is the smallest for 4 (that leaves us with an integer).

So the answer is 8.
Excuse me if my idea is not presented clear enough.
Join the discussion

by mehravikas » Mon Oct 12, 2009 7:16 pm
Assuming that k = 1440, smallest value of 'n' can only be 8
Join the discussion