Prime number function

[dusty]

I've looked through the archived questions and have found no help. Can someone please tell me why my function fails to return any prime numbers?

#include <iostream>
using namespace std;
bool prime (int);

void main ()
{
	int n, value;
	while (true)
	{
		cout << "Enter n (n >= 2): "; cin >> n;
		cout << endl << "Prime numbers less than or equal to " << n << ":" << endl;
		
		for (value = 2; value <= n; value++)
		{
			if (prime (value))
				cout << value << " ";
		}
	cout << endl << endl;
	}
}

bool prime (int value)
{
	int i;
	for (int i = 2; sqrt (double (value)); i++)
	{
		if (value % i == 0)
		{
			return false;
		}
	}
	return true;
}

[Chervil]

At a glance, this line looks wrong:

for (int i = 2; sqrt (double (value)); i++)

I would try this:

for (int i = 2; i <= sqrt (double (value)); i++)

[dusty]

Yep, that's it. Thanks!