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 longest sequence of 1's in a binary sequence.
6843 Solvers
-
143 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
782 Solvers
-
Circular Primes (based on Project Euler, problem 35)
658 Solvers
-
182 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!