Problem 46594. Create a sequence of primes p such that p > n π(p)

• Created by ChrisR
• Appears in Prime Numbers I

×

Like (1)

Difficulty:

(12)

Rate

• Solve Later   
• Add To GroupÂ

Write a function to find the nth term of a sequence of prime numbers p such that , where is the prime counting function. The first three numbers in this sequence are 2, 11, and 37. For example, the second number is 11 because five primes are less than or equal to 11 (i.e., ) and 11 > .

A related problem is Cody Problem 46117 Test approximations of the prime counting function.

Solve

Solution Stats

60.0% Correct | 40.0% Incorrect

• 25 Solutions
• 12 Solvers

Last Solution submitted on Sep 09, 2024

Last 200 Solutions

Solution Comments

Problem Recent Solvers12

Suggested Problems

• Check if sorted

  4432 Solvers

• Find the largest value in the 3D matrix

  1567 Solvers

• Sort numbers by outside digits

  151 Solvers

• Longest run of consecutive numbers

  5960 Solvers

• Compute LOG(1+X) in natural log

  253 Solvers

More from this Author298

• Count the square-full divisors of a number

  7 Solvers

• Evaluate the incomplete elliptic integrals

  13 Solvers

• Compute a sum

  7 Solvers

• Determine whether a number is a Higgs prime

  5 Solvers

• List the ways to write 1/n as the sum of two unit fractions

  7 Solvers