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? some methods of finding

This is Problem 7 from the Euler project. Famous for the fact that it is almost incalculable through regular math methods.  It may be solvable using the Sieve of Eratosthenes and a computer program that has a little bit of time.  I'd argue that, for this reason, this question actually ought be placed under computer science, and might be beyond the capabilities of the website.  It is sure interesting though, maybe I'll try and solve it one day.

Answer: the correct answer is 10step-by-step explanation: let the number be n, then the expression becomes,then“twelve more than the quotient of a number and two, decreased by four” iswhen n=4,we substitute 4 whetever we see n to get,we simplify to obtain,we further simplify to get,therefore the correct answer is c.