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

• Created by Ramon Villamangca

×

Like (1)

Difficulty:

(3)

Rate

• Solve Later   
• Add To GroupÂ

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

66.67% Correct | 33.33% Incorrect

• 6 Solutions
• 4 Solvers

Last Solution submitted on Mar 19, 2023

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers4

Suggested Problems

• Function Iterator

  2169 Solvers

• Mersenne Primes

  840 Solvers

• Volume of a Parallelepiped

  450 Solvers

• Removing rows from a matrix is easy - but what about inserting rows?

  231 Solvers

• The Answer to Life, the Universe, and Everything

  544 Solvers

More from this Author116

• Easy Sequences 116: Summation involving nthroot, floor, and ceiling functions

  2 Solvers

• Easy Sequences 29: Odd proper divisors of odd proper divisors

  5 Solvers

• Easy Sequences 92: Number of Roots of a System of Linear Diophantine Equations

  1 Solvers

• Easy Sequences 68: Factorial Rectangles

  6 Solvers

• Easy Sequences 6: Coefficient sums of derivatives

  15 Solvers