Hard parallelization with #pragma omp to find the Nth prime number?

If all you need is 2000000 primes, you can maintain one ~4.1MB sized bitarray and flip bits on it for each found prime. No sort is needed. Halve your bitarray size by implementing odds-only representation scheme.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.