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

• Test if a Number is a Palindrome without using any String Operations

  241 Solvers

• 2 b | ~ 2 b

  400 Solvers

• Scoring for oriented dominoes

  875 Solvers

• How to add?

  148 Solvers

• Values in Array

  197 Solvers

More from this Author298

• Play Outside In with primes

  9 Solvers

• Count the ones in a divisibility matrix

  3 Solvers

• List the notes of a major scale

  4 Solvers

• Decode a message encrypted with the square root of 2

  3 Solvers

• Determine whether one vector is a subset of another

  13 Solvers