For an integer n, the prime big omega function, 
, is defined as the total number of prime factors of n. So, if 
, since 
, therefore 
.
, 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
-
Find the two most distant points
2953 Solvers
-
Numbers with prime factors 2, 3 and 5.
683 Solvers
-
Remove from a 2-D matrix all the rows that contain at least one element less than or equal to 4
139 Solvers
-
12 Solvers
-
Create block matrix of integers (j+k-1) - Part I
120 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!
