Problem 53745. Easy Sequences 60: Almost Cube Root

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

×

Like (1)

Difficulty:

(4)

Rate

• Solve Later   
• Add To GroupÂ

The almost cube root of an integer x, is the largest possible integer r, such that and . For example , then , since and since the next larger divisor of which is 6, does not qualify because . Obviously, if x is a perfect cube, then .

Given an integer n, please find sum of the "almost cube roots" of all integers from 1 to For , the program ouput should be :

where: is the almost cube root of i.

Solve

Solution Stats

71.43% Correct | 28.57% Incorrect

• 7 Solutions
• 4 Solvers

Last Solution submitted on Aug 05, 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

• It dseon't mettar waht oedrr the lrettes in a wrod are.

  1918 Solvers

• How to find the position of an element in a vector without using the find function

  2749 Solvers

• Bit Reversal

  1478 Solvers

• arithmetic progression

  135 Solvers

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

  15 Solvers

More from this Author116

• Easy Sequences 65: Fractional Part of Square Roots

  4 Solvers

• Easy Sequences 7: Easy as Composite Pi

  4 Solvers

• Easy Sequences 37: Natural Factorable Polynomials

  7 Solvers

• Easy Sequences 10: Sum of Cumsums of Fibonacci Sequence

  39 Solvers

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

  3 Solvers