Problem 52724. Easy Sequences 20: Counting Prime-sided Rectangles

• Created by Ramon Villamangca
• Appears in Special Functions

×

Like (2)

Difficulty:

(14)

Rate

• Solve Later   
• Add To GroupÂ

A prime-sided rectangle is a rectangle having sides represented by prime numbers. The figure below shows all the possible prime-sided rectangles whose areas are less than or equal to 25:

Given an area limit 'n', count the total number of prime-sided rectangles that can be formed , with areas less than or equal to 'n'.

In the figure above, we can see that there are only 9 prime-sided recatangles having areas are less than or equal to 25. Therefore, for n = 25 the output should be 9. For n = 100, there are 34 such rectangles.

NOTE: Rotations are not important and are counted only once.

Solve

Solution Stats

75.0% Correct | 25.0% Incorrect

• 12 Solutions
• 6 Solvers

Last Solution submitted on Mar 17, 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 Solvers6

Suggested Problems

• Find all elements less than 0 or greater than 10 and replace them with NaN

  15628 Solvers

• The Goldbach Conjecture

  5780 Solvers

• Create an n-by-n null matrix and fill with ones certain positions

  633 Solvers

• Height of a right-angled triangle

  1867 Solvers

• Easy Sequences 1: Find the index of an element

  46 Solvers

More from this Author116

• Easy Sequences 68: Factorial Rectangles

  6 Solvers

• Easy Sequences 90: Triple Summation of a Combinatorial Function

  2 Solvers

• Easy Sequences 88: Double Summation of a Combinatorial Function

  2 Solvers

• Easy Sequences 79: Trailing Zeros of Fibonorial Numbers at any Base

  3 Solvers

• Easy Sequences 12: 50th Prime

  15 Solvers