Projecteuler.net – Problem 7 – C solution

http://projecteuler.net/problem=7

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?

Done in the same manner as my Python solution. It’s a simple trial division method that will fail on some numbers. The obvious is number 1. I will build up the function as¬†necessary¬†for later problems.

– Josh

 

This entry was posted in C, Project Euler. Bookmark the permalink.

Leave a Reply