Prime Number Algorithm

Question: determine the number of prime numbers between-and output all prime numbers.

 

ProgramAnalysis: Method for Determining prime numbers: Remove 2 to SQRT (This number) with a single number, if it can be integer

Division, it indicates that this number is not a prime number, and vice versa.

 

 

# Include <stdio. h>

# Include <math. h>

Void main ()

{

Int X;

Printf ("enter a positive integer to determine if it is a prime number:/N ");

Scanf ("% d", & X );

For (INT I = 2; I <SQRT (x); I ++)

If (X % I = 0)

Break;

If (I> SQRT (x ))

Printf ("% d is a prime number", X );

Else

Printf ("% d is not a prime number", X );

}