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
-
Sum all integers from 1 to 2^n
16472 Solvers
-
419 Solvers
-
73 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
1936 Solvers
-
Count letters occurence in text, specific to words with a given length.
172 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!