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:

(3)

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 ×

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

• Test if a Number is a Palindrome without using any String Operations

  238 Solvers

• Project Euler: Problem 10, Sum of Primes

  1897 Solvers

• Spiral In

  106 Solvers

• Cryptomath: Addition

  35 Solvers

• Word Distance - Sum

  171 Solvers

More from this Author116

• Easy Sequences 87: Perfect Power Modular Residue of a Nested Sum-product Function

  2 Solvers

• Easy Sequences 117: Fractional Part of Cube Roots

  4 Solvers

• Easy Sequences 25: Product of Series

  16 Solvers

• Easy Sequences 82: Digits of Powers of 2

  3 Solvers

• Easy Sequences 83: Digits of Powers of 3

  2 Solvers