C++ Prime Number

Exercise 1

Check if a number is prime number

Example:

Enter a number: 5
5 is a prime number
	

Base code:

#include <iostream>
using namespace std;
int main() {
	int num;
	cout << "Enter a number: ";
	cin >> num;

	// check if num is prime number

}

Exercise 2

Use function to check if a number is prime number

Base code:

#include <iostream>
using namespace std;
int main() {
	int num;
	cout << "Enter a number: ";
	cin >> num;

	if (isPrime(num)) {
		cout << num << " is a prime number" << endl;
	} else {
		cout << num << " is not a prime number" << endl;
	}

}

bool isPrime(int num) {

	// check if num is prime number

}

Exercise 3

List all prime numbers from 1 to n

Example:

Enter a number: 16
Prime numbers from 1 to 16 are: 2 3 5 7 11 13
	

Base code:

#include <iostream>
using namespace std;
int main() {
	int num, i;
	cout << "Enter a number: ";
	cin >> num;

	cout << "Prime numbers from 1 to " << num << " are: ";
	for (i = 1; i <= num; i++) {
		// check and display prime number

	}

}

bool isPrime(int num) {

	// check if num is prime number

}