It is currently 18 Nov 2017, 05:22

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

# counting factors

Author Message
Senior Manager
Joined: 09 Oct 2007
Posts: 463

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

### Show Tags

30 May 2008, 11:46
1
This post was
BOOKMARKED
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

Hi, I remember there was a formula to count factors, but I can't find the notebook where I wrote it it.

If I recall correctly, you had to find all the prime factors, then turn them into base-exponents format, then drop the base, then add 1 to each exponents and then multiply them. Is this correct?

IE: Factors of 200?

200 =
(2)(2)(2)(5)(5), therefore: (2^3)(5^2),
(3+1)(2+1) = (4)(3) = 12

200 has 12 factors total.

Can someone confirm?

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

Manager
Joined: 28 May 2008
Posts: 93

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

### Show Tags

30 May 2008, 20:48
asdert wrote:
Hi, I remember there was a formula to count factors, but I can't find the notebook where I wrote it it.

If I recall correctly, you had to find all the prime factors, then turn them into base-exponents format, then drop the base, then add 1 to each exponents and then multiply them. Is this correct?

IE: Factors of 200?

200 =
(2)(2)(2)(5)(5), therefore: (2^3)(5^2),
(3+1)(2+1) = (4)(3) = 12

200 has 12 factors total.

Can someone confirm?

Yes that is correct !
Here s the formula
The number of divisors of a given number N(including 1 and the number itself)
where N= (a^m)(b^n)(c^m), where a,b,c are prime numbers ,are
(1+m)(1+n)(1+p)

for eg 70=(2^1)(5^1)(7^1)
Therefore, No of divisors= (1+1)(1+1)(1+1)=8
those would be 1,2,5,7,10,14,35,70

Hope thats clear !

Cheers !

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

Re: counting factors   [#permalink] 30 May 2008, 20:48
Display posts from previous: Sort by

# counting factors

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