Well done, what is left?

Find the number of positive integers n n in the range of 12 n 40 12\leq n \leq 40 such that ( n 1 ) ! (n-1)! is not divisible by n n .


The answer is 7.

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.

3 solutions

Manasa Veena
Oct 4, 2014

yesss!!! no of primes between 12-40 will do it..it is 7...have fun!!!!!

Piyush Maheshwari
Sep 30, 2014

We know, The product will not be divisible by n when n is prime no.Thus there are 7 prime no. between12& 40.

Mahmoud Sayed
Jun 13, 2015

Just count the number of prime numbers in the given range! { 13, 17, 23, 29, 31, 37, 39}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...