[claretm]

Hi All,

I have written a program to find all the prime numbers less than 1000000.
Can somebody help me to modify this code,so that I can get the biggest difference between two consecutive prime numbers?

#include <iostream>
#include <cmath>
using namespace std;

int main ()
{
	const int N = 1000000;
	const int SQR_ROOT_N = (int) (sqrt ((double) N));
	bool prime[N + 1];
	
	prime[0] = false;  // 0 is not prime
	prime[1] = false;  // 1 is not prime
	
	for (int i = 2; i <= N; i++)
		 prime[i] = true;  // flag all numbers as prime initially
		 
	for (int i = 2; i <= SQR_ROOT_N; i++)
	{
		if (prime[i]) // no need for inner loop if i is not prime
		{
			for (int j = 2 * i; j <= N; j+=i)
				 prime[j] = false;  // j is a multiple of i, thus not prime.
		}
	}
	
	// display prime numbers
	cout << "Here are the prime numbers\n\n";
	for (int i = 2; i <= N; i++)
	{
		if (prime[i])
			cout << i << endl;
	}
	
	return 0;
}

MOD EDIT: Please
Thanks, gabehabe

[headways_millennia]

Hi,

#include <iostream>
#include <cmath>
using namespace std;

int main ()
{
const int N = 1000000;
const int SQR_ROOT_N = (int) (sqrt ((double) N));
bool prime[N + 1];



prime[0] = false; // 0 is not prime
prime[1] = false; // 1 is not prime

for (int i = 2; i <= N; i++)
prime[i] = true; // flag all numbers as prime initially

for (int i = 2; i <= SQR_ROOT_N; i++)
{
if (prime[i]) // no need for inner loop if i is not prime
{
for (int j = 2 * i; j <= N; j+=i)
prime[j] = false; // j is a multiple of i, thus not prime.
}
}

// display prime numbers
cout << "Here are the prime numbers\n\n";

int cnt = 0;			 // count gap size
int lgDiff[3] = {0}; // gap size, lower prime bound, upper prime bound

for (int i = 2; i <= N; i++)
{
	cnt++;
	if (prime[i]){
		cout << i << endl;
		if(cnt > lgDiff[0]){
			lgDiff[0] = cnt; // gap between this prime and last prime is larger than previous gap
			lgDiff[2] = i;   // get upper bound
		}
		cnt = 0;
		
	}
	
}

lgDiff[1] = (lgDiff[2] - lgDiff[0]); // grab lower bound prime

cout << '\n';
cout << lgDiff[0] << '\n';
cout << lgDiff[1] << '\n';
cout << lgDiff[2] << '\n';

int a;
cin >> a;

return 0;
}

I got:

492227 - 492113

... close eh?

[David W]

Quote

...I got: 492227 - 492113 ... close eh?

Nice code ... do you write it? Very cool approach

Shalom,
David

[headways_millennia]

David W, on 10 Feb, 2009 - 06:58 PM, said:

Quote

...I got: 492227 - 492113 ... close eh?

Nice code ... do you write it? Very cool approach

Shalom,
David

Yes, I wrote it. Thank you David.