Prime visits in array challenges

#1

every number has two divisors.1 and the number itself. how does the sample output come up?

#2

Hi Harseerat,
See if the no. is not a prime no. than it has more than 2 divisors for eg:- let say the no. is 4 then there are three divisors 1, 2 & the no. itself. In this question you are given range and you have to find the no. of prime no.'s in the given range. In range 1 to 10 there are 4 prime no.'s 2, 3,5 & 7 and in range 11 to 20 there are also 4 prime no.'s 11, 13, 17, & 19.

#3

Hey Harseerat,
as you are not responding to this thread, I am marking your doubt as Resolved for now. Re-open it if required.

Please mark your doubts as resolved in your course’s “ Ask Doubt ” section, when your doubt is resolved.