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
-
Project Euler: Problem 4, Palindromic numbers
1042 Solvers
-
135 Solvers
-
Pattern Recognition 3 - Variable Unit and Array Length (including cell arrays)
44 Solvers
-
53 Solvers
-
Height of a right-angled triangle
1816 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!