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
-
Project Euler: Problem 4, Palindromic numbers
971 Solvers
-
Cumulative minimum of an array
33 Solvers
-
Sums of cubes and squares of sums
239 Solvers
-
23 Solvers
-
Easy Sequences 3: Prime 44-number Squares
23 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!