Problem 52911. Easy Sequences 41: Boxes with Integer Edges

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

×

Like (1)

Difficulty:

(5)

Rate

• Solve Later   
• Add To GroupÂ

For this problem, we are asked to write a function that will count the number of boxes with integer edges, that has the same given volume v.

For example for , the possible boxes are shown in the figure below:

Therefore, in this case, the function should return 3.

Solve

Solution Stats

27.78% Correct | 72.22% Incorrect

• 18 Solutions
• 5 Solvers

Last Solution submitted on Aug 14, 2024

Last 200 Solutions

Solution Comments

Problem Recent Solvers5

Suggested Problems

• Read a column of numbers and interpolate missing data

  2329 Solvers

• Matrix indexing with two vectors of indices

  739 Solvers

• Calculate Euler's phi function

  91 Solvers

• Inscribed Pentagon? 2

  83 Solvers

• Count unique orderings of vertices of a polygon

  18 Solvers

More from this Author116

• Easy Sequences 67: Project Euler Problem 1 - Not Again!!!

  2 Solvers

• Easy Sequences 80: Sum of the n-th Row of Fibonacci Square Triangle

  2 Solvers

• Easy Sequences 91: Generalized McCarthy-91 Recursive Function

  2 Solvers

• Easy Sequences 94: GCD Sums

  2 Solvers

• Easy Sequences 8: Triangles with integer sides and prime perimeters

  9 Solvers