Problem 52978. Easy Sequences 44: Finding the Smallest Number whose Cube is divisible by a Factorial

Created by Ramon Villamangca

Solve Later

Given a integer n, our goal is to find the smallest integer k, such that  divides .
For example, for , , because , (since ), and  is the smallest number that has this property. Please present the value of k in modulo  (a prime number).

Solve

Solution Stats

10 Solutions
5 Solvers

Last Solution submitted on Dec 12, 2025

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers5

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 52978. Easy Sequences 44: Finding the Smallest Number whose Cube is divisible by a Factorial

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author116

Problem Tags

Community Treasure Hunt

Problem 52978. Easy Sequences 44: Finding the Smallest Number whose Cube is divisible by a Factorial

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author116

Problem Tags

Community Treasure Hunt

Players