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
-
2011 Solvers
-
Count from 0 to N^M in base N.
240 Solvers
-
1720 Solvers
-
Flag largest magnitude swings as they occur
690 Solvers
-
Remove from a 2-D matrix all the rows that contain at least one element less than or equal to 4
139 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!