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

• Created by ChrisR
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Special Functions

• 10 Problems
• 7 Finishers

Prime Numbers I

• 19 Problems
• 7 Finishers

Like (1)

Difficulty:

(13)

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

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers12

Suggested Problems

• Make the vector [1 2 3 4 5 6 7 8 9 10]

  50382 Solvers

• Trimming Spaces

  2453 Solvers

• Check if sorted

  4420 Solvers

• Converting Decimal to Binary

  72 Solvers

• Generate a vector like 1,2,2,3,3,3,4,4,4,4

  12114 Solvers

More from this Author293

• Sum the elements in rows of the Levine triangle

  12 Solvers

• Determine whether a hydrograph is a unit hydrograph

  5 Solvers

• Design a capture zone

  3 Solvers

• Compute a sum involving the totient over divisors of a number

  6 Solvers

• Evaluate the prime zeta function

  15 Solvers