Community

Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.
Login Register Memberlist Search AoPS Blogs Contests Galleries Forum Index
The time now is Thu Nov 26, 2009 12:44 pm
All times are UTC - 8
View posts since last visit
View unanswered posts
A problem of divisors
Moderators: isabella2296
Post new topic   Reply to topic View previous topicView next topic
5 Posts • Page 1 of 1
Author Message
small_unicorn
Poincare Conjecture
Poincare Conjecture


Offline
Joined: 06 Jun 2008
Posts: 122
Location: Lexington , KY
Russian FederationUnited States

To rate posts you must be logged in
#1
A problem of divisors

Find the smallest number with 28 divisors.
_________________
Juggle
2008-2009 MOEMS ED = 18; Purple Comet Alone = 8

PostPosted: Sat Nov 07, 2009 3:12 pm  Back to top 
  ProfilePMWWW
PowerOfPi
Navier-Stokes Equations
Navier-Stokes Equations


Offline
Joined: 30 Apr 2009
Posts: 1940
Location: Planet Pi
United States

To rate posts you must be logged in
#2
Solution
The number of divisors of a number is the product of one more than the exponents in its prime factorization, where the same primes are combined with exponents.

For example, the prime factorization of 24 is 2^3 \cdot 3^1. Thus, it has (3 + 1)(1 + 1) = 4 \cdot 2 = 8 factors.

Now, since 28 = 2 \cdot 2 \cdot 7, there are three cases. The exponents of the primes can be: 6 and 1 and 1, 13 and 1, 6 and 3, or just 27.

To minimize the number, we raise the smallest prime to the biggest exponent, the next smallest to the next biggest, and so on.

So for each case, the minimum is:

2^6 \cdot 3^1 \cdot 5^1 = \mathbf{960}

2^{13} \cdot 3^1 = \mathbf{24576}

2^6 \cdot 3^3 = \mathbf{1728}

2^{27} = \mathbf{134217728}

Clearly, the smallest of these is \boxed{960}.

_________________
Sign up for MOCK AMC!
Last edited by PowerOfPi on Sun Nov 08, 2009 6:24 am; edited 1 time in total 
PostPosted: Sat Nov 07, 2009 3:33 pm  Back to top 
  ProfilePMBlogAlbum
prezcoin
Hodge Conjecture
Hodge Conjecture


Offline
Joined: 29 Dec 2008
Posts: 61
Location: Well, SOMEBODY'S a stalker and SOMEBODY'S not happy...
Taiwan, Province of China

To rate posts you must be logged in
#3
I don't get the
2^6 \cdot 3^1 \cdot 5^1 = \mathbf{960}

2^13 \cdot 3^1 = \mathbf{24576}

2^6 \cdot 3^3 = \mathbf{1728}

2^27 = \mathbf{134217....

Were you trying to say:
2^6 \cdot 3^1 \cdot 5^1 = \mathbf{960}

2^{13} \cdot 3^1 = \mathbf{24576}

2^6 \cdot 3^3 = \mathbf{1728}

Just wondering.

2^{27} = \mathbf{134217728}

Clearly, the smallest of these is \boxed{960}.
_________________
Play Ball Wallbash Red Star Wars

\LaTeX is cool.

PostPosted: Sat Nov 07, 2009 5:16 pm  Back to top 
  ProfilePMWWW
pinkmuskrat
Yang-Mills Theory
Yang-Mills Theory


Offline
Joined: 28 Dec 2008
Posts: 609
Location: a sucky state....
Taiwan, Province of ChinaMonaco

To rate posts you must be logged in
#4
@PowerofPi: make sure you type 2^{13}, not 2^13 when dealing with multi digit exponents in \LaTeX Smile

@prezcoin: next time just use the "quote" button for that type of reply
_________________
Star Wars !MATH=AOPS!
Mandelbrot Round 1 UNMPNM Round 1 Mandelbrot Round 2
....YaY #1 aLcUmUs...YaY 1337 gAmEs In FtW...

PostPosted: Sat Nov 07, 2009 7:04 pm  Back to top 
  ProfilePMWWW
PowerOfPi
Navier-Stokes Equations
Navier-Stokes Equations


Offline
Joined: 30 Apr 2009
Posts: 1940
Location: Planet Pi
United States

To rate posts you must be logged in
#5
Sorry, fixed.
_________________
Sign up for MOCK AMC!

PostPosted: Sun Nov 08, 2009 6:24 am  Back to top 
  ProfilePMBlogAlbum
Display posts from previous:   Sort by:   
5 Posts • Page 1 of 1
Post new topic   Reply to topic View previous topicView next topic
Jump to:  

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum
You cannot post calendar events in this forum


© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us