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

• Created by Ramon Villamangca
• Appears in Easy Sequences Volume VI

×

Like (1)

Difficulty:

(4)

Rate

• Solve Later   
• Add To GroupÂ

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

66.67% Correct | 33.33% Incorrect

• 9 Solutions
• 4 Solvers

Last Solution submitted on Mar 19, 2023

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Who Deserves Your Praise? Discover the New Contribution Widget!

We are excited to announce another update to our Discussions area: the...

Problem Recent Solvers4

Suggested Problems

• Project Euler: Problem 9, Pythagorean numbers

  1301 Solvers

• QWERTY Shift Encoder

  232 Solvers

• Flag largest magnitude swings as they occur

  681 Solvers

• List the erauqs

  23 Solvers

• Find the smallest integer m such that n divides m!

  15 Solvers

More from this Author116

• Easy Sequences 69: Radix Economy of Factorials

  5 Solvers

• Easy Sequences 75: Easy as Pisano Pi

  9 Solvers

• Easy Sequences 65: Fractional Part of Square Roots

  4 Solvers

• Easy Sequences 78: Trailing Zeros of Factorial Numbers at any Base

  3 Solvers

• Easy Sequences 3: Prime 44-number Squares

  27 Solvers