Program to Check Prime Number #include <stdio.h> int main() { int n, i, flag = 0; printf(“Enter a positive integer: “); scanf(“%d”, &n); for (i = 2; i <= n / 2; ++i) { // condition for non-prime if (n % i == 0) { flag = 1; break; } } if (n == 1) … Read more
An algorithm to check prime number A number that is divisible only by itself and 1, is prime number Example of prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23…. etc Algorithm Step 1: Start Step 2: Declare variables n,i,flag. Step 3: Initialize variables flag←1 i←2 Step 4: Read n from user. Step … Read more
What is prime number? Definition of prime number A number is considered as prime number when it satisfies the below conditions.It should be whole number It should be greater than 1 It should have only 2 factors. They are, 1 and the number itself. For Example: 2, 3, 5, 7, 11, 13, 17, 19, 23, … Read more