It is currently 22 Sep 2017, 08:26

Close

GMAT Club Daily Prep

Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Close

Request Expert Reply

Confirm Cancel

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

Man Cat 3 #29-Lengthy Problem

  post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
Manager
Manager
avatar
Joined: 04 Dec 2008
Posts: 103

Kudos [?]: 223 [0], given: 2

Man Cat 3 #29-Lengthy Problem [#permalink]

Show Tags

New post 16 May 2009, 07:43
1
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

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

Any shortcut to this? Thanks!

Kudos [?]: 223 [0], given: 2

SVP
SVP
User avatar
Joined: 29 Aug 2007
Posts: 2473

Kudos [?]: 832 [0], given: 19

Re: Man Cat 3 #29-Lengthy Problem [#permalink]

Show Tags

New post 17 May 2009, 14:23
joyseychow wrote:
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

Any shortcut to this? Thanks!


Was discussed here: zumit-ps-70325.html#p518550

Hope that helps you.
_________________

Verbal: http://gmatclub.com/forum/new-to-the-verbal-forum-please-read-this-first-77546.html
Math: http://gmatclub.com/forum/new-to-the-math-forum-please-read-this-first-77764.html
Gmat: http://gmatclub.com/forum/everything-you-need-to-prepare-for-the-gmat-revised-77983.html


GT

Kudos [?]: 832 [0], given: 19

Re: Man Cat 3 #29-Lengthy Problem   [#permalink] 17 May 2009, 14:23
Display posts from previous: Sort by

Man Cat 3 #29-Lengthy Problem

  post reply Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.