For an integer n, the prime big omega function,
, is defined as the total number of prime factors of n. So, if
, since
, therefore
.
Given an integer n, write a function that evaluates the following summation:
For example for
:
In this case therefore, the function should return
.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers6
Suggested Problems
-
Project Euler: Problem 7, Nth prime
1778 Solvers
-
Determine if input is a perfect number
267 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
190 Solvers
-
Easy Sequences 37: Natural Factorable Polynomials
10 Solvers
-
14 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!