+ 1

# Problem 7 of Project Euler

Find the 10001st Prime number. https://code.sololearn.com/c5hd21q9qM7o/?ref=app https://code.sololearn.com/cMjfqYHByuPn/?ref=app

4 ответов

+ 1

well, of course....
knowing the basics about prime numbers i am trying to understand where do you locate the challenge?
algorithms are known, would it be computational efficiency in home/office environment? in such a case I'd go into ANSI C, do time testing with different compilers, and use most powerful GPU available. at this stage I have no data about primes' computation time by clusters - maybe challenge is not solvable on PC's.
so I'd like to know where do you locate the challenge?

+ 1

for my friends followers (Patrick seems not interested anymore 😀):
I by far overestimated the 'hardware' weight of the challenge - even though the grand lines of my reasoning seem correct.
knowing algorithms, calculation even by parsed languages is relatively swift for small numbers.
in Python it took 207s. to find the number.
in compiled C it took 3.06s.
ow, I'd have forgotten to put the searched for 10001 prime number 😉
it's 104743

0

and the question is?

0

find the 10001st prime