# Difference between revisions of "Project Euler/7"

### From charlesreid1

m (Replacing charlesreid1.com:3000 with git.charlesreid1.com) |
|||

Line 1: | Line 1: | ||

Project Euler, question 7: https://projecteuler.net/problem=7 | Project Euler, question 7: https://projecteuler.net/problem=7 | ||

− | Solution: https://charlesreid1.com | + | Solution: https://git.charlesreid1.com/cs/euler/src/master/007 |

==The Question== | ==The Question== |

## Latest revision as of 03:50, 9 October 2019

Project Euler, question 7: https://projecteuler.net/problem=7

Solution: https://git.charlesreid1.com/cs/euler/src/master/007

## The Question

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 10,001st prime number?

https://projecteuler.net/problem=7

## Approach

Start with the prime number distribution function pi(x),

This gives us a ballpark estimate of how many numbers we will need to look at to find the 10,001st prime number: just solve

or,

Project Euler
Problem 1
Problem 11
Problem 51
Problem 100
Problem 500
- = in progress
· Template:ProjectEulerFlag · e |