C++ Program to Check Whether a Number is Prime or Not

To understand this example, you should have knowledge of following C++ programming topics:
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 Prime Number

Examples C++ Objects and Class, C++ Constructors Tutorials, Coding C++ Objects & Function, Program C++ Operator Overloading
 
 
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.

Tag :  Examples C++ Objects and Class, C++ Constructors Tutorials, Coding C++ Objects & Function, Program C++ Operator Overloading

Silahkan komentar pada kolom dibawah ini jika ada yang ingin ditanyakan tentang C++ Program to Check Whether a Number is Prime or Not.

0 Response to "C++ Program to Check Whether a Number is Prime or Not"