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 Solvers4
Suggested Problems
-
2009 Solvers
-
The Goldbach Conjecture, Part 2
2413 Solvers
-
Find the peak 3n+1 sequence value
2565 Solvers
-
Easy Sequences 3: Prime 44-number Squares
32 Solvers
-
76 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!