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.

Complex PS problem

Expert replies
by Auzbee » Mon Dec 31, 2007 6:59 pm
For any integer k > 1, the term “length of an integer” refers to the number of positive prime factors, not necessarily distinct, whose product is equal to k. For example, if k = 24, the length of k is equal to 4, since 24 = 2 × 2 × 2 × 3. If x and y are positive integers such that x > 1, y > 1, and x + 3y < 1000, what is the maximum possible sum of the length of x and the length of y?

a. 5
b. 6
c. 15
d. 16
e. 18

OA is D. I am looking for a quick explanation to crack this. Not through the long method of solving it.
Join the discussion
Source: — Problem Solving |

by gmatguy16 » Sun Jan 06, 2008 1:52 pm
i am not sure whats the quickest method but its obvious that we need minimum prime factors to get maximum value..lets start with 2 ..
2^10 = 1024 >1000 ,so lets use 2 ^ 9 = 512..we still have 1000-512=488...
488/3 = 162..... so y can be 2 ^7 = 128..hence answer is 9+7 = 16
Join the discussion

by StarDust845 » Tue Jan 08, 2008 8:15 am
gmatguy16 wrote:i am not sure whats the quickest method but its obvious that we need minimum prime factors to get maximum value..lets start with 2 ..
2^10 = 1024 >1000 ,so lets use 2 ^ 9 = 512..we still have 1000-512=488...
488/3 = 162..... so y can be 2 ^7 = 128..hence answer is 9+7 = 16
I think it's a great way to solve this problem.

Calista.
Join the discussion