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
-
132 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1083 Solvers
-
Calculate the area of a triangle between three points
2709 Solvers
-
Determine if input is a Narcissistic number
188 Solvers
-
Lychrel Number Test (Inspired by Project Euler Problem 55)
94 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!