Menu Close

Let-n-be-the-smallest-positive-integer-that-is-a-multiple-of-75-and-has-exactly-75-positive-integral-divisors-including-1-and-itself-Find-n-75-




Question Number 11075 by Joel576 last updated on 10/Mar/17
Let n be the smallest positive integer that is  a multiple of 75 and has exactly 75 positive  integral divisors, including 1 and itself.  Find (n/(75))
Letnbethesmallestpositiveintegerthatisamultipleof75andhasexactly75positiveintegraldivisors,including1anditself.Findn75
Commented by FilupS last updated on 11/Mar/17
n=75k  n has 75 divisors  n=1×75×k  75=3×5^2   ∴n=1×3×5×5×k  ∴k has 75−4 divisors excluding 1 and k  let k=2^(71)   n=75×2^(71)   n=3×5^2 ×2^(71)   ∴(n/(75))=k=2^(71)
n=75knhas75divisorsn=1×75×k75=3×52n=1×3×5×5×kkhas754divisorsexcluding1andkletk=271n=75×271n=3×52×271n75=k=271
Commented by mrW1 last updated on 14/Mar/17
The answer to this question depents  very much on how to understand the  condition “it has exactly 75 divisors”.    Let′s look at an easier case that it has  exactly 5 divisors. According to your  consideration above the answer should  be  n=1×3×5×5×2^1 =150  But this number has not exactly only  5 divisors, but much more. All following  numbers are divisors of it:  1/3/5/2  15/6  25/10  75/30/50  150  −−−−−  that means the number n=150 has  in fact not exactly 5 divisors, but  exactly 12 different divisors.    An orther problem is if identical divisors  are allowed or not. Since 1 is definitely  allowed, according to your consideration  the answer should be  n=1×3×5×5×1^(71) =75
Theanswertothisquestiondepentsverymuchonhowtounderstandtheconditionithasexactly75divisors.Letslookataneasiercasethatithasexactly5divisors.Accordingtoyourconsiderationabovetheanswershouldben=1×3×5×5×21=150Butthisnumberhasnotexactlyonly5divisors,butmuchmore.Allfollowingnumbersaredivisorsofit:1/3/5/215/625/1075/30/50150thatmeansthenumbern=150hasinfactnotexactly5divisors,butexactly12differentdivisors.Anortherproblemisifidenticaldivisorsareallowedornot.Since1isdefinitelyallowed,accordingtoyourconsiderationtheanswershouldben=1×3×5×5×171=75
Commented by FilupS last updated on 11/Mar/17
ahh. I was thinking of factors!
ahh.Iwasthinkingoffactors!
Commented by mrW1 last updated on 11/Mar/17
I made following consideration:  n=p_1 ×p_2 ×p_3 ....×p_m =Π_(k=1) ^m p_k   p_k =the k−th prime number.  n has following kinds of divisors:  − each of the m prime numbers: C_1 ^m =((m!)/(1!(m−1)!))=m  − product of every 2 of the m prime numbers: C_2 ^m  =((m!)/(2!(m−2)!))  − product of every 3 of the m prime numbers: C_3 ^m  =((m!)/(3!(m−3)!))  ......  − product of all of the m prime numbers: C_m ^m  =((m!)/(m!(m−m)!))=1    that means the total number of divisors is  Σ_(k=1) ^m C_k ^m =Σ_(k=1) ^m ((m!)/(k!(m−k)!))=2^m −1
Imadefollowingconsideration:n=p1×p2×p3.×pm=mk=1pkpk=thekthprimenumber.nhasfollowingkindsofdivisors:eachofthemprimenumbers:C1m=m!1!(m1)!=mproductofevery2ofthemprimenumbers:C2m=m!2!(m2)!productofevery3ofthemprimenumbers:C3m=m!3!(m3)!productofallofthemprimenumbers:Cmm=m!m!(mm)!=1thatmeansthetotalnumberofdivisorsismk=1Ckm=mk=1m!k!(mk)!=2m1
Commented by FilupS last updated on 12/Mar/17
You wrote:  “n=1×3×5×5×1^(71) =75”     If we assume he meant 1 only once  (due to the fact that x=x(1)^∞ ),  would the answer be:  n=1×3×5×5×2^(71) =75×2^(71)    ????
Youwrote:n=1×3×5×5×171=75Ifweassumehemeant1onlyonce(duetothefactthatx=x(1)),wouldtheanswerbe:n=1×3×5×5×271=75×271????
Commented by mrW1 last updated on 12/Mar/17
The difficulty lies on how to make  the number to have exactly 75 divisors:  − to get more divisors we should take  more different prime numbers   − to keep the number small we should  use more 2′s.    The general formula is  n=2^n_1  ×3^n_2  ×5^n_3  ×7^n_4  ×11^n_5  ...  with n_1 ,n_4 ,n_5 ,...≥0, n_2 ≥1,n_3 ≥2    The question is to determine  n_1 ,n_2 ,n_3 ,...  to keep n as small as possible and  to have exactly 75 divisors.    For example:  n=2^(11) ×3×5^2 =153600 has 72 divisors  n=2^(12) ×3×5^2 =307200 has 78 divisors    n=2^3 ×3^2 ×5^2 ×7=12600 has 72 divisors  n=2^4 ×3^2 ×5^2 ×7=25200 has 90 divisors    n=2^2 ×3×5^2 ×7×11=23100 has 72 divisors  n=2^3 ×3×5^2 ×7×11=46200 has 96 divisors    We see it′s not the right way to use  only factors 2. E.g. 2^(11) ×3×5^2  is much  bigger than 2^3 ×3^2 ×5^2 ×7, but both  have 72 divisors.
Thedifficultyliesonhowtomakethenumbertohaveexactly75divisors:togetmoredivisorsweshouldtakemoredifferentprimenumberstokeepthenumbersmallweshouldusemore2s.Thegeneralformulaisn=2n1×3n2×5n3×7n4×11n5withn1,n4,n5,0,n21,n32Thequestionistodeterminen1,n2,n3,tokeepnassmallaspossibleandtohaveexactly75divisors.Forexample:n=211×3×52=153600has72divisorsn=212×3×52=307200has78divisorsn=23×32×52×7=12600has72divisorsn=24×32×52×7=25200has90divisorsn=22×3×52×7×11=23100has72divisorsn=23×3×52×7×11=46200has96divisorsWeseeitsnottherightwaytouseonlyfactors2.E.g.211×3×52ismuchbiggerthan23×32×52×7,butbothhave72divisors.
Answered by mrW1 last updated on 16/Mar/17
After some attempts (see comments above)  I think I got the solution to this question.    Generally every positive integer can  be expressed as the product of a serial  of prime numbers:  n=p_1 ^n_1  ×p_2 ^n_2  ×p_3 ^n_3  ×p_4 ^n_4  ×p_5 ^n_5  ×...=Π_(k=1) ^m p_k ^n_k    where p_k  is the k−th prime number  and m is the number of prime numbers  to be needed, n_k ≥0.  The number of divisors which n has is  D=(n_1 +1)(n_2 +1)(n_3 +1)(n_4 +1)...=Π_(k=1) ^m (n_k +1)    Since in our case n is a multiple of 75  and 75=3×5×5, we have   n=2^n_1  ×3^n_2  ×5^n_3  ×7^n_4  ×11^n_5  ...  with n_1 ,n_4 ,n_5 ,...≥0, n_2 ≥1, n_3 ≥2    The task is now to determine n_1 , n_2 , n_3 ,...  so that D=75 and n is as small as possible.    Let′s consider at first the number of  divisors which should be exactly 75, i.e.  D=75=(n_1 +1)(n_2 +1)(n_3 +1)(n_4 +1)...    This can only  be one of following 4 cases:  Case (1):  D=75=3×5×5 =(2+1)(4+1)(4+1)  ⇒ we need 3 prime numbers, each 2, 4, 4 times  Case (2):  D=75=5×15=(4+1)(14+1)   ⇒ we need 2 prime numbers, each 4, 14 times  Case (3):  D=75=3×25=(2+1)(24+1)   ⇒ we need 2 prime numbers, each 2, 24 times  Case (4):  D=75=(74+1)  ⇒ we need 1 prime number 74 times    Case (4) is not suitable, since we need at least  2 prime numbers: 3×5^2 .    To keep n small we should use as many  smaller prime numbers as possible.    Case (1):   3 prime numbers (each 2, 4, 4 times)  ⇒ n=2^4 ×3^4 ×5^2 =32 400  Case (2):   2 prime numbers (each 4, 14 times)  ⇒ n=3^(14) ×5^4 =2 989 355 625  Case (3):   2 prime numbers (each 2, 24 times)  ⇒ n=3^(24) ×5^2 =7 060 738 412 025    Case (1) gives the smallest n which is  n=32400    = END =
Aftersomeattempts(seecommentsabove)IthinkIgotthesolutiontothisquestion.Generallyeverypositiveintegercanbeexpressedastheproductofaserialofprimenumbers:n=p1n1×p2n2×p3n3×p4n4×p5n5×=mk=1pknkwherepkisthekthprimenumberandmisthenumberofprimenumberstobeneeded,nk0.ThenumberofdivisorswhichnhasisD=(n1+1)(n2+1)(n3+1)(n4+1)=mk=1(nk+1)Sinceinourcasenisamultipleof75and75=3×5×5,wehaven=2n1×3n2×5n3×7n4×11n5withn1,n4,n5,0,n21,n32Thetaskisnowtodeterminen1,n2,n3,sothatD=75andnisassmallaspossible.Letsconsideratfirstthenumberofdivisorswhichshouldbeexactly75,i.e.D=75=(n1+1)(n2+1)(n3+1)(n4+1)Thiscanonlybeoneoffollowing4cases:Case(1):D=75=3×5×5=(2+1)(4+1)(4+1)weneed3primenumbers,each2,4,4timesCase(2):D=75=5×15=(4+1)(14+1)weneed2primenumbers,each4,14timesCase(3):D=75=3×25=(2+1)(24+1)weneed2primenumbers,each2,24timesCase(4):D=75=(74+1)weneed1primenumber74timesCase(4)isnotsuitable,sinceweneedatleast2primenumbers:3×52.Tokeepnsmallweshoulduseasmanysmallerprimenumbersaspossible.Case(1):3primenumbers(each2,4,4times)n=24×34×52=32400Case(2):2primenumbers(each4,14times)n=314×54=2989355625Case(3):2primenumbers(each2,24times)n=324×52=7060738412025Case(1)givesthesmallestnwhichisn=32400=END=
Commented by Joel576 last updated on 13/Mar/17
Hi, mrW1  Thank you very much for your great solution  Even my teacher, he haven′t found any solutions yet.  Glad you wanted to spend your time to find the solution.
Hi,mrW1ThankyouverymuchforyourgreatsolutionEvenmyteacher,hehaventfoundanysolutionsyet.Gladyouwantedtospendyourtimetofindthesolution.
Commented by FilupS last updated on 13/Mar/17
I think mrW1 is the smartest person on  here in the widest range of maths. Do you  goto collage/university? I am completely  self study. Math is my hobby.
IthinkmrW1isthesmartestpersononhereinthewidestrangeofmaths.Doyougotocollage/university?Iamcompletelyselfstudy.Mathismyhobby.
Commented by FilupS last updated on 13/Mar/17
My strongest topic is in sequences and in  number theory. I want to learn linear  algebra
Mystrongesttopicisinsequencesandinnumbertheory.Iwanttolearnlinearalgebra

Leave a Reply

Your email address will not be published. Required fields are marked *