0
Still curious? Ask our experts.
Chat with our AI personalities
Rene
Blake
ViviAdd your answer:
Earn +20 pts
How do you draw a flow chart to check whether a given number is prime or not?
There are flowcharts available for computers, that depend upon brute number crunching. In other words, they are dividing a given number by every lesser number and seeing if there are any that divide evenly into it. For humans, this is a bit harder. However, here are four steps to let you know if a number can be divided by the numbers 1 through 9 (but not seven). 1. Is it an even number? If yes, then stop, it's not prime. 2. Is it a number ending in zero or five? If yes, then stop, it's not a prime. 3. Do the digits in the number add up to three or nine? If yes, then stop, it's not a prime. Now, any "yes" answer ends it. But if all the above were answered "no", that doesn't actually end it. Maybe the number can be divided by 7. Or 11. Or even larger numbers.
Write a c program to check whether a no is prime or not?
#include<stdio.h> #include<conio.h> int i=1, count=0,n; clrscr(); printf("Enter Any Number"); scanf("%d", &n); while(i<n) if(n%i==0) { count++; i++; } if(count==2) printf("Given Number is Prime"); else printf("Given Number is not Prime"); getch(); }
How can you Write a suitable pseudo code to check whether a number is prime or not?
Begin Read num for(i=2; i<num; i++) if(num%2==0) then print "the number is not a prime no."; else if print "the number is prime"; end if Stop
Python function that lists prime numbers?
If you just want a hint: One way to check whether a number is prime is by dividing it by any number between 2 and the square root of your number. If the number divides by any of these, it is not prime. If you want the code: import math for num in range(1,101): if all(num%i!=0 for i in range(2,int(math.sqrt(num))+1)): print num
How do you print non-prime numbers in java?
Loop through some numbers - for example, 2 through 100 - and check each one whether it is a prime number (write a second loop to test whether it is divisible by any number between 2 and the number minus 1). If, in this second loop, you find a factor that is greater than 1 and less than the number, it is not a prime, and you can print it out.
