For how many odd positive integers n<1000 does the number of positive divisors of n divide n?
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
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 ^^
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
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
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
it's become easy when i knew the max value of "the number of positive divisors" is 10 :D