Finding the 10,001st prime number

[DisobeyedCoot]

I am not sure what is wrong with this code, I keep getting the answer as 1.

#include<iostream>
using namespace std;

int main()
{
	int counter, number, divider;
	number = 1;
	counter = 0;
	divider = 1;

	while(divider < 150000)
	{
		if(divider > 150000)
		{
			divider = 1;
			number++;
		}
		if(number % divider != 0)
		{
			counter++;
		}
		if(counter == 10001)
		{
			cout << "The 10001st prime number is: " << number << "\n";
		}
		divider++;
	}
	system("pause");
	return 0;
}

[Volatile Pulse]

This if never happens, it's impossible to:

while(divider < 150000)
	{
		if(divider > 150000)
		{
			divider = 1;
			number++;
		}

Here:

		if(number % divider != 0)
		{
			counter++;
		}

You're dividing 1 by 1, and 1 is not a prime number, I'm not quite sure what you're doing.

Your program is simple, but I believe it's TOO simple to do what you want it to do.