Computer Science, asked by alameennazar881, 4 months ago

prepare algorithm and flow chart to input a number and check whether it is prime or not

Answers

Answered by Anonymous

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:

Previous Question

Next Question

Similar questions

Math, 2 months ago

if 3p-2q=4 and 7p-3q=1, then what is 4p-5q equal to? Options: A= -33 B= 3 C = 5 D = 17...

Chemistry, 2 months ago

How to name organic compounds using the IUPAC rules (make a simple list of rules)...

Math, 2 months ago

Radius 14 cm , A = ?

Math, 4 months ago

Evaluate :(1/2)-² + (1/3)-²+ (1/4)-²...

English, 4 months ago

diary entry on how you learn mandala art and roman calligraphy during stay in sikkim...

English, 10 months ago

write five sentences on how a letter reaches the addresses the post office.....

Social Sciences, 10 months ago

On what bases is the criterion used by the UNDP for measuring development different from the one used by the World Bank?

Psychology, 10 months ago

What things will u say to a ghost , of it comes in the front of you? If it is Annabelle?

prepare algorithm and flow chart to input a number and check whether it is prime or not​

Answers

prepare algorithm and flow chart to input a number and check whether it is prime or not