A pack of numbers ...

How many numbers less than 100 have exactly 6 positive integer divisors ?

Details and Assumptions

1 and the number itself are also included in the divisors ....


The answer is 16.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Aditya Raut
Jun 2, 2014

For having 6 divisors , number has to be of the form

p 5 p^5 or p 1 p 2 2 p_1 p_2^2 because then the number of divisors is (1+1)(2+1)=(5+1)=6 .... for this , p i p_i are prime numbers.

There is only one number of the first form and it is 2 5 2^5

There are 15 numbers of the second form , as the prime which is squared can't be greater than 7 . Thus if p 2 = 2 p_2=2 then there are possibilities for p 1 p_1 as {3,5,7,11,13,17,19,23} hence 8 different numbers .

If p 2 = 3 p_2=3 then there are possibilities for p 1 p_1 as {2,5,7,11} hence 4 numbers.

If p 2 = 5 p_2=5 then p 1 p_1 can be {2,3} hence 2 numbers and for p 2 = 7 p_2=7 , p 1 = 2 p_1=2 .

Hence there are 1 + 8 + 4 + 2 + 1 = 16 1+8+4+2+1 = \boxed{16} such numbers

i just missed 2 ^ 5

akash deep - 7 years ago

Log in to reply

I am counting only 14 https://www.math.upenn.edu/~deturck/m170/wk2/divisors.html

Vijay Simha - 2 years, 4 months ago

class dfghjkl { public static void main(String args[]) { int a,b,c,d=0; for(a=1;a<=100;a++) { c=0; for(b=1;b<=a;b++) { if(a%b==0) c++; } if(c==6) d++; } System.out.println(d); } }

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...