For an integer n, the prime big omega function, 
, is defined as the total number of prime factors of n. If 
, since 
, therefore 
. The omega-3 function (
), is defined as raising 3 to the power of the prime big omega of n, i.e. 
. In the example above, 
.
, is defined as the total number of prime factors of n. If , since , therefore . The omega-3 function (), is defined as raising 3 to the power of the prime big omega of n, i.e. . In the example above, .Given an integer n, write a function that returns the sum of omega-3's of all integers from 1 to n. For example for 
the function output should be 
, since:
the function output should be , since:
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers4
Suggested Problems
-
Maximum running product for a string of numbers
2254 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
256 Solvers
-
Find out sum and carry of Binary adder
1707 Solvers
-
Pattern Recognition 1 - Known Unit Length
74 Solvers
-
Easy Sequences 11: Factorial Digits without Trailing Zeros
20 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!
Ramon, you might want to make a small correction to the last formula in the description, though it makes no difference to the problem. The "product" symbol was probably meant to be a "summation" symbol.
Thanks, William.