Computer Science, asked by appuniranjan28, 4 months ago

Draw the flow chart ro find prime or not​

Answers

Answered by 107917130988
0

Answer:

The flowchart shown above describes a function that is given a number i and returns whether it is prime or not. The name of the function is "IsThisNumberPrime." First it checks to make sure the input number is an integer. Then it checks to make sure the input number is not negative, 0 , or 1.

Explanation:

Answered by Anonymous
3

Answer:

To prove whether a number is a prime number, first try dividing it by 2, and see if you get a whole number. If you do, it can't be a prime number. If you don't get a whole number, next try dividing it by prime numbers: 3, 5, 7, 11 (9 is divisible by 3) and so on, always dividing by a prime number

Similar questions