Problem 52567. Easy Sequences 7: Easy as Composite Pi
Solution Stats
Problem Comments
-
3 Comments
I mean...doing this above 1e10 won't be easy anyway, no matter prime or composite.
Lincoln Poon,
Yes, they're really the same problem, as (designating the composite counting function as κ(n)), κ(n) + 𝜋(n) + 1 = n. There are techniques to do the count without creating an array for x>√n, and even for x>∛n.
If anyone does find a way to solve this precisely without some hack, please, publish a scientific paper, and do not post your code here. This problem is not made from an easy sequence at all.
Problem Recent Solvers4
Suggested Problems
-
Project Euler: Problem 9, Pythagorean numbers
810 Solvers
-
442 Solvers
-
Find the maximum number of decimal places in a set of numbers
1919 Solvers
-
64 Solvers
-
Given a square and a circle, please decide whether the square covers more area.
636 Solvers
More from this Author91
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!