Prime calculator, multicore (auto max)

Multicore prime calc.cpp

// CAUTION: This code puts your CPU at 100% load.

#include <string>
#include <iostream>
#include <thread>
#include <math.h>

void task()
{
	int  N = 999999999;	
	for (int i = 2; N > 0; ++i)
	{
		bool  isPrime = true;
		for (int j = 2; j < i; ++j) {
			if (i  % j == 0) { isPrime = false; break; }}
		if (isPrime) { --N;	}
	}
}

int main() {
	int concurentThreadsSupported = std::thread::hardware_concurrency();
	std::cout << concurentThreadsSupported;
	std::thread* t = new std::thread[concurentThreadsSupported]();

	for (int i = 0; i < concurentThreadsSupported; ++i) { t[i] = std::thread(task); }
	for (int i = 0; i < concurentThreadsSupported; ++i) { t[i].join(); }

	std::cin.get();
	return 0;
}