i am not able To write the flowchart for the question Given a Number N check if it Prime or Not? can u please help me out
To Given a Number N check if it Prime or Not?
hello @json_2000
a number N is prime number , if it is divisible by only 2 numbers i.e 1 and itself .
so iterate from 1 to N and count number of divisor.
if count ==2 then it is prime
otherwise not
refer this->
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.