Problem 53009. Easy Sequences 48: Prime Big Omega of Factorial Sequence

Ramon Villamangca

6 solvers

1 likes

Solve

Solve Later

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 .

Solve

Solution Stats

8 Solutions

6 Solvers

Last Solution submitted on May 24, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers6

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!