algoritm to find if a no is prime or composit
Answers
Answered by
0
Explanation:
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.
Answered by
0
Explanation:
❤️❤️✨✨Happy New Year ❤️❤️✨✨
May this new year bring you much joy and fun. May you find peace, love, and success. Sending my heartiest new year wish for you! May the New Year bring you happiness, peace, and prosperity
Similar questions