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
-
Find the numeric mean of the prime numbers in a matrix.
9168 Solvers
-
2424 Solvers
-
Project Euler: Problem 5, Smallest multiple
1677 Solvers
-
Numbers with prime factors 2, 3 and 5.
683 Solvers
-
Fill a rectangle with 1x1 and 2x2 tiles
21 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!