Project Euler | Problem 7 | Find 10001st Prime number in Java?

Problem Description :

By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.What is the 10001st prime number?

Project Euler Problem 7

Concept :

For generating prime numbers we are using Sieve of Eratosthenes algorithm. This is very simple and efficient algorithm for generating primes.

Algorithm :

If you want to generate all prime number below N. Please follow below steps.

• Create boolean array of  length N and assign 'TRUE' to all elements of an array. 
• Find the sqrt of N because loop will run from 2 to sqrt(N).
• In loop, check whether element present at current index is 'TRUE'. If yes, then assign 'FALSE' to all elements whose index is multiple of current index.

Sieve of Eratosthenes algorithm

Java Program :

Output :

Output - Project Euler Problem 7

References :

https://projecteuler.net/problem=7

https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes

http://docs.oracle.com/javase/7/docs/api/java/lang/Math.html

Thank you friends, I hope you have clearly understood the solution of this problem. If you have any doubt, suggestion or query please feel free to comment below. You can also discuss this solution in our forum.

Tags : Project Euler Problem 7 solution in Java, Prime numbers, 10001st Prime, Mathematics problems, if else statement, for loop, Eratosthenes Algorithm, Arrays.

About Author:

I am simple guy with lot of ambitions. My main motive is to share whatever knowledge I have related to programming. With me you can easily learn how to solve any programming problem in Java.You can connect with me on social networking sites also.

Let's Get Connected: Linkedin | Facebook | Google Plus