Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (anonymous):

For how many odd positive integers n<1000 does the number of positive divisors of n divide n?

OpenStudy (perl):

can we look at a simpler example, n < 10

OpenStudy (perl):

for n<10 we have 1,3,5,7,9 . 1 has 1 positive divisor and 1 divides 1. 3 has 2 positive divisor and that doesnt divide 3. 5 has 2 , 7 has 2 ( in general every prime number has 2 positive divisors) 9 has three positive divisors, and that divides 3 so for n<10 , we have 2 numbers

OpenStudy (perl):

this looks like a pretty complicated problem. maybe you could program a computer to do it , thats what i would do

OpenStudy (anonymous):

ok, thank! (:

OpenStudy (anonymous):

ok i've got the answer ^^

OpenStudy (perl):

how did you get it ?

OpenStudy (anonymous):

i use my brain :D

OpenStudy (perl):

no no, it takes too long that way

OpenStudy (perl):

you can exclude prime numbers,

OpenStudy (anonymous):

yes, i got the solution of that problem

OpenStudy (anonymous):

it's become easy when i knew the max value of "the number of positive divisors" is 10 :D

OpenStudy (perl):

wait what?

OpenStudy (perl):

sorry i didnt follow

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!