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
-
Test if a Number is a Palindrome without using any String Operations
237 Solvers
-
Maintain shape of logical-index mask
70 Solvers
-
Spherical radius given four points
241 Solvers
-
110 Solvers
-
Highly divisible triangular number (inspired by Project Euler 12)
119 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!