- C++
- ORACLE/PLSQL
- ERP GUIDE
- PHP
- MARIADB
- MYSQL
- JAVA
- POSTGRESQL
- GTK#
- C#
- JAVASCRIPT
- SAAS
- SASS
- C
- ANDROID
- HTACCESS
- JQUERY
- THE LIFE IMPROVEMENT
- R PROG.
- MATH
- SQL
- PYTHON
- ASCII
- WPF
- EXCEL
- BACKBONEJS
- ANGULARJS
- HTML5
- CSS3 ANIMATION
- TELECOM
- PHP TUTORIAL

Tutorial by:Manisha Dubey Date: 2016-06-18 04:23:17

A positive integer which is only divisible by 1 and itself is known as prime number. For example: 13 is a prime number because it is only divisible by 1 and 13 but, 15 is not prime number because it is divisible by 1, 3, 5 and 15.

```
/* C++ program to check whether a number is prime or not. */
#include <iostream>
using namespace std;
int main()
{
int n, i, flag=0;
cout << "Enter a positive integer: ";
cin >> n;
for(i=2;i<=n/2;++i)
{
if(n%i==0)
{
flag=1;
break;
}
}
if (flag==0)
cout << "This is a prime number";
else
cout << "This is not a prime number";
return 0;
}
```

**Output**

Enter a positive integer: 29 This is a prime number.

Enter a positive integer: 12 This is not a prime number.

This program takes a positive integer from user and stores it in variable `n`. Then, `for`

loop is executed which checks whether the number entered by user is perfectly divisible by `i` or not starting with initial value of `i` equals to 2 and increasing the value of `i` in each iteration. If the number entered by user is perfectly divisible by `i` then, `flag` is set to 1 and that number will not be a prime number but, if the number is not perfectly divisible by `i` until test condition `i<=n/2`

is true means, it is only divisible by 1 and that number itself and that number is a prime number.