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
Start free 5-day trial
Read 559 reviewsTarget Test Prep

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

Number properties

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
User avatar
Junior | Next Rank: 30 Posts
Posts: 14
Joined: Sat Jul 11, 2009 10:05 pm
by Nigogo » Mon Oct 12, 2009 8:06 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?
5
6
15
16
18
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
Master | Next Rank: 500 Posts
Posts: 399
Joined: Wed Apr 15, 2009 3:48 am
Location: india
Thanked: 39 times

by xcusemeplz2009 » Mon Oct 12, 2009 8:36 pm
IMO D

2^9+3*2^7
Last edited by xcusemeplz2009 on Tue Oct 13, 2009 1:08 am, edited 1 time in total.
It does not matter how many times you get knocked down , but how many times you get up
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Junior | Next Rank: 30 Posts
Posts: 14
Joined: Sat Jul 11, 2009 10:05 pm

by Nigogo » Mon Oct 12, 2009 9:49 pm
so you mean the unswer is D 16? Can you plz explain how did u get it? :shock:
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Master | Next Rank: 500 Posts
Posts: 399
Joined: Wed Apr 15, 2009 3:48 am
Location: india
Thanked: 39 times

by xcusemeplz2009 » Tue Oct 13, 2009 1:08 am
sorry i made a mistake tough ans is same but the no. is diff.

we need to find two number to satisfy the eqn. X+3Y>1000

and we need to find the maximum length (number of prime factors not necessarily distinct)

since maximum therefor better to take minimum positive prime no. which is 2

now ifx=2^9=512
then 3y has to be <1000-512=482
for y we can have max no. as 2^7( for more higher power of 2 the no. will exceed 1000)
so x=2^9(tot length 9)
and Y=2^7
(tot length 7)

adding ans 16
It does not matter how many times you get knocked down , but how many times you get up
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Junior | Next Rank: 30 Posts
Posts: 14
Joined: Sat Jul 11, 2009 10:05 pm

by Nigogo » Wed Oct 14, 2009 9:05 pm
Thank you :!: :)
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1