Yes, you are correct. You can first break 130 into its factors, and then recombine to see how many fit.
130 = 2*65 = 2*5*13
2, 5, 13, 10, 65, 26, 130, 1.
Count your way up, and when you hit the max, you know you are done.
Number properties PS
This topic has expert replies
Source: Beat The GMAT — Problem Solving |
-
grockit_jake
- GMAT Instructor
- Posts: 80
- Joined: Wed Aug 12, 2009 8:49 pm
- Location: San Francisco, CA
- Thanked: 16 times
-
punitkaur
- Master | Next Rank: 500 Posts
- Posts: 168
- Joined: Mon Apr 13, 2009 6:48 pm
- Thanked: 6 times
thanks for confirming. but the way i did it was a little different.
130
prime factors - 2,5,13.
no of divisors is multiplication of (powers of each +1)
2x2x2 = 8.
If we got a larger number then this method is easier I believe?
130
prime factors - 2,5,13.
no of divisors is multiplication of (powers of each +1)
2x2x2 = 8.
If we got a larger number then this method is easier I believe?
-
tohellandback
- Legendary Member
- Posts: 752
- Joined: Sun May 17, 2009 11:04 pm
- Location: Tokyo
- Thanked: 81 times
- GMAT Score:680
I think your method is better than one stated above..punitkaur wrote:thanks for confirming. but the way i did it was a little different.
130
prime factors - 2,5,13.
no of divisors is multiplication of (powers of each +1)
2x2x2 = 8.
If we got a larger number then this method is easier I believe?
the other method can be time-taking if there are large numbers.
The powers of two are bloody impolite!!
