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 Solvers5
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
53032 Solvers
-
174 Solvers
-
Recurring Cycle Length (Inspired by Project Euler Problem 26)
163 Solvers
-
2264 Solvers
-
20 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!