#include<iostream>
#include<cmath>
#include<string>
bool xisprime(unsigned long number);
void checkconjecture(unsigned long myintegers);
int main() {
unsigned long minintegers;
unsigned long maxintegers;
std::cout <<"Please enter your high bound and low bound.";
std::cin >>maxintegers>>minintegers;
unsigned long l = minintegers;
while (l <= maxintegers) {
checkconjecture(l);
l++;
}
std::cin.ignore(100, '');
std::cout <<"Press Enter Or Return To Continue.";
std::cin.get();
return 0;
}
bool xisprime(unsigned long number) {
bool Res;
int i = 2;
long double js;
js = pow(number, 0.5);
while ((number % i != 0)&&(i <= js )) {
i++;
}
if (i <= js) {
Res = false;
} else if ((number % --i) == 0) {
Res = false;
} else {
Res = true;
}
return Res;
}
void checkconjecture(unsigned long myintegers) {
unsigned long FirstPrime;
if (myintegers == 2) {
std::cout <<"While number is 2,the conjecture is true.";
std::cout <<"And the first prime is 3.";
} else {
int j = 1;