Question

write algorithm pseudocode and flowchart
to check whether the given number is
Prime or not​

Answer 1

The simplest primality test is trial division: given an input number, n, check whether it is evenly divisible by any prime number between 2 and √n (i.e. that the division leaves no remainder). If so, then n is composite. Otherwise, it is prime.