Problem 55345. Easy Sequences 68: Factorial Rectangles

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

×

Like (1)

Difficulty:

(6)

Rate

• Solve Later   
• Add To GroupÂ

I'll celebrate my comeback to Cody with this one easy problem...

----------------

The rectangle below is special:

Its area is which equal to . We call such rectangle a factorial rectangle, which is an integer-sided rectangle with an area equal to a factorial number.

In this problem, we want to know how many are these factorial rectangles.

For a given integer n, we define the function as the number of factorial rectangles with area The factorial rectangles with area are as follows: , with rotations not allowed. Hence,

Write a function that will calculate , defined as follows:

For , we are given:

Solve

Solution Stats

63.64% Correct | 36.36% Incorrect

• 11 Solutions
• 6 Solvers

Last Solution submitted on Sep 12, 2023

Last 200 Solutions

Solution Comments

Problem Recent Solvers6

Suggested Problems

• Parasitic numbers

  299 Solvers

• Project Euler: Problem 9, Pythagorean numbers

  1310 Solvers

• Circular Primes (based on Project Euler, problem 35)

  572 Solvers

• MATLAB Basic: rounding

  5772 Solvers

• Find the sides of an isosceles triangle when given its area and height from its base to apex

  2014 Solvers

More from this Author116

• Easy Sequences 12: 50th Prime

  15 Solvers

• Easy Sequences 30: Nearly Pythagorean Triangles

  19 Solvers

• Easy Sequences 113: Almost Golden Integer Rectangles 2

  1 Solvers

• Easy Sequences 14: Consecutive Composites

  5 Solvers

• Easy Sequences 114: Counting Unique Numbers

  2 Solvers