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.
Solution Comments
Show commentsProblem Recent Solvers4
Suggested Problems
-
Find state names that start with the letter N
1179 Solvers
-
Count from 0 to N^M in base N.
234 Solvers
-
66 Solvers
-
145 Solvers
-
Determine whether a number is a fibodiv number
15 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!