Problem 53029. Easy Sequences 49: Prime Little Omega Function

For an integer n, the prime little omega function, , is defined as the total number of distinct 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 .
NOTE: This is an easier version of the previous problem, 'Prime Big Omega of Factorial Sequence'. So, for an added challenge, you may enjoy prime factoring each number, as the MATLAB functions 'factor', 'primes' and 'isprime' will be disabled.

Solution Stats

62.5% Correct | 37.5% Incorrect
Last Solution submitted on Mar 19, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers4

Suggested Problems

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!