It is currently 18 Nov 2017, 09:02

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# 2 questions from ETS practice tests

Author Message
Intern
Joined: 10 Jun 2006
Posts: 8

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

2 questions from ETS practice tests [#permalink]

### Show Tags

18 Jul 2006, 09:55
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

Hi everyone. I have two questions for you:

1. For any positive integer n, the "length" is defined as the number of prime factors whose product is n. E.g. The length of 75 is 3 because 3 x 5 x5.

How many two-digit positive integers have length 6?

1) None
2) One
3) Two
4) Three
5) Four

(I thought it was one--96 was the only one I counted, but I suppose 64 is also an answer. What's the trick? What are you supposed to do/see quickly to get this in 2 minutes or less? Is there a more efficient way of approaching this besides picking random numbers and factoring them?)

2nd question:

Is the positive integer j divisible by a greater number of different prime numbers than the positive integer k?

(1) j is divisible by 30

(2) k = 1,000

(I chose E thinking that they were looking for the number of prime factors that j has....but is the catch the word "different"? No matter what j is, because it is divisible by 30, at least 2, 3 and 5 will be factors. The only unique prime factors 1000 has are 2 and 5.

Could someone please confirm that choice "E" would in fact be the answer if the word "different" was removed from the stem.

Thanks!!!

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

Intern
Joined: 11 Jul 2006
Posts: 37

Kudos [?]: 1 [0], given: 0

Location: Boston
Re: 2 questions from ETS practice tests [#permalink]

### Show Tags

18 Jul 2006, 10:36
First One
According to me the way tackle this is take the six prime factors rather than factoring all 2 digit numbers.

2 being the smallest prime no, the smallest 2 digit no of length 6 is
2*2*2*2*2*2 = 2^6 = 64

The next biggest no will be
2^5 * 3 = 32* 3 = 96

Any other combination of 6 prime nos will result in a no having more than 2 digits .

For the second one I think the answer should be C
The question is to find if there is a no J more having â€˜differentâ€™ prime factors than K

(1) â€“ This tells that j has 2, 3, 5 as factors, i.e min 3 diff prime factors. This does not talk about whether j has more diff prime factors, and neither does it say anything about K
(2) - k = 1000, has only (2 â€˜diffâ€™ prime factors, 2 and 5). Again this alone is not suff.

If we combine the two the min â€˜diffâ€™ prime factors that j has is 3 which is > than that of k (1000). So both together are sufficient.

Kudos [?]: 1 [0], given: 0

CEO
Joined: 20 Nov 2005
Posts: 2892

Kudos [?]: 334 [0], given: 0

Schools: Completed at SAID BUSINESS SCHOOL, OXFORD - Class of 2008

### Show Tags

18 Jul 2006, 11:35
Q1: C

First take smallest 6 numbers
2,2,2,2,2,2 = 64 then
2,2,2,2,2,3 = 96 then
If we increase any number then surely the product will be greater than 99.

Q2:
St1: Clearly INSUFF
St2: Clearly INSUFF
Combined:
j is for sure a multiple of 2,3 and 5 prime numbers
but k = 1000 is a multiple of only 2 and 5 prime number: SUFF

In case "different" removed then surely E. j could be 30,000, which include all factors of 1000 and could be 30, which have very few factors than 1000.
_________________

SAID BUSINESS SCHOOL, OXFORD - MBA CLASS OF 2008

Kudos [?]: 334 [0], given: 0

SVP
Joined: 30 Mar 2006
Posts: 1728

Kudos [?]: 102 [0], given: 0

### Show Tags

19 Jul 2006, 01:28
1) C

I dont know whether what I did was the fastest but it sure took me less than 2 mins

take the least prime number.
We know the length is 6 hence

2*2*2*2*2*2 = 64
Now replace the last 2 with other prime numbers
2*2*2*2*2*3 = 96

Now if we replace 3 by 5 we get a three digit number.
Hence the numbers are 64 and 96

2) C

From
Cond1) We can guess what numbers can satisfy J but dont know K hence Insuff
Cond2) we know K but not J hence not suff.

Together.
K has two different prome numbers 2 and 5
And J is divisible by 30 hence it can be divisble by atleast 2, 3 and 5
Hence C

Kudos [?]: 102 [0], given: 0

19 Jul 2006, 01:28
Display posts from previous: Sort by

# 2 questions from ETS practice tests

Moderator: chetan2u

 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®.