int main() { double x; int fnum = 3, snum = 5; double sum = 0; int j, num_is_prime = 1; printf("Enter X \n"); scanf("%lf", &x); sum = (1/(double)fnum) + (1/(double)snum); do{ if(prime_check(fnum) == 1 && prime_check(snum) == 1){ sum = (1/(double)fnum) + (1/(double)snum); fnum += 2; snum = fnum + 2; printf("%lf ", sum); } } while(sum >= x); }
int main() { primes.push_back(2); int max = 0; cout<<"Enter number:\n"; cin>>max; for(int index = 3; index < max; ++index) { if(prime_check(index)) { primes.push_back(index); cout<<index<<" is a prime\n"; } } }