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.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

For all positive integers f, f◎ equals the distinct pairs of [#permalink]
15 Nov 2010, 12:34

1

This post received KUDOS

2

This post was BOOKMARKED

00:00

A

B

C

D

E

Difficulty:

45% (medium)

Question Stats:

67% (02:46) correct
33% (01:34) wrong based on 69 sessions

For all positive integers f, f◎ equals the distinct pairs of positive integer factors. For example, 16◎ =3, since there are three positive integer factor pairs in 16: 1 x 16, 2 x 8, and 4 x 4.

What is the greatest possible value for f◎ if f is less than 100?

Re: problem solving [#permalink]
15 Nov 2010, 13:17

2

This post received KUDOS

Great question - and my strategy for something like this is to first look at what they're asking:

The greatest number...

Which means that I want to maximize the number of factors, meaning that I also want to minimize the value of each factor (so that I can use it more often):

For example, if I use 99 (9 * 11), that 11 takes up too much space...I can't use it very often. Whereas if I use smaller factors (2 and 3), I can use them more often. 2 can become 4 and then 8 before it takes up as much space as does 11.

So if my goal is to find a number less than 100 that has as many small factors as possible, I'm looking at 96, because:

99 = 3*3*11 (and 11 is too big a prime factor) 98 = 2*7*7 (and 7 is too big a prime factor) 97 = not divisible by 2 or 3, so you're not using your smallest available factors 96 = 2*2*2*2*2*3 (or 32*3) ---> this is perfect because you're getting maximum value out of your factors. The only other that would work is 64 (drop the 3 and add another 2)

So for 96, break out the factors into pairs:

1, 96 2, 48 4, 24 8, 12 (these are easy to do - just double one number and halve the other for a fresh pair) 16, 6 32, 3

And that's as far as you can go. My fear is that we may not have enough unique factors (there's a lot of repetitiveness with the 2s), so I'll check that by trying the next smallest prime factor, 5. The biggest I can go with that is 90, or 2*3*3*5, and that gets us:

1, 90 2, 45 3, 30 5, 18 6, 15 9, 10

We're still at 6 factors, and it's going to get harder and harder to incorporate larger prime factors and have room for multiple factors in between (we've seen that 7 and 11 limit us a lot), so the answer must be 6. _________________

Re: problem solving [#permalink]
04 Jan 2013, 23:59

tejhpamarthi wrote:

For all positive integers f, f◎ equals the distinct pairs of positive integer factors. For example, 16◎ =3, since there are three positive integer factor pairs in 16: 1 x 16, 2 x 8, and 4 x 4.

What is the greatest possible value for f◎ if f is less than 100? a)6 b)7 c)8 d)9 e)10

As stated earlier we need to maximize the number of factors. This can be done by using the smallest possible base and the highest possible power. 1: 2^6 = 64 => (1,2,4,8;8,16,32,64) = > this gives us 4 pairs. Though this need not give us the answer it gives us the highest power => 6. So any subsequent answer would have the sum of powers not more than 6. 2: 2^5 * 3 = 96 = > (1,2,3,4,6,8;12,16,24,32,48,96) = > this gives us 6 pairs Other combinations such as 2^4*3^2, 2^5*5, etc would be more than 100. Answer: A-6

Re: For all positive integers f, f◎ equals the distinct pairs of [#permalink]
05 Feb 2014, 11:55

tejhpamarthi wrote:

For all positive integers f, f◎ equals the distinct pairs of positive integer factors. For example, 16◎ =3, since there are three positive integer factor pairs in 16: 1 x 16, 2 x 8, and 4 x 4.

What is the greatest possible value for f◎ if f is less than 100?

A. 6 B. 7 C. 8 D. 9 E. 10

Brian, can this be thought in the following way?

When one does prime factorization you get one factor pair for every prime number (counting repetitions). So we are basically asked how many primes can we have in this factorization so that x<100.

Well I start with 100, and 2 being the smallest prime I can get and not until 2^6 do I get a number that is smaller than 100. So that's why I chose A

Is this method correct or is it rather flawed?

Thanks Cheers J

gmatclubot

Re: For all positive integers f, f◎ equals the distinct pairs of
[#permalink]
05 Feb 2014, 11:55