Problem 53009. Easy Sequences 48: Prime Big Omega of Factorial Sequence
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 commentsProblem Recent Solvers4
Suggested Problems
-
Number of 1s in the Binary Representation of a Number
442 Solvers
-
Solve the set of simultaneous linear equations
414 Solvers
-
8 Solvers
-
Easy Sequences 31: N-N's Sequence
12 Solvers
-
Easy Sequences 41: Boxes with Integer Edges
5 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!