algoritm to find if a no is prime or composit
Answers
Answered by
2
Answer:
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.
Explanation:
hope it helps
make it brainlist
follow me
thank you
Similar questions