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
-
22041 Solvers
-
Similar Triangles - find the height of the tree
479 Solvers
-
127 Solvers
-
Self-similarity 2 - Every third term
67 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
432 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!