A C++ program

An integer greater than 1 is a prime number if it does not have a divisor that is greater than 1 and less than itself. For examples, 2,3,5,7,11,13,17 are all the primer numbers, and 10 is not a primer number (because 10 have a divisor 2 and a divisor 5).

Write a program function bool isPrime( int x) to determine whether an input number x is a prime number or not. The function isPrime takes an integer as an argument and returns true if the argument is a prime number, and false otherwise. Demonstrate your function is correct.