The number belongs to a class of numbers called Repunit Numbers, in which all digits are 1.
For this problem, we'll define a superset of the repunit numbers which we shall call repnums, which are composed of repeated numbers. That is, if we denote repnums by , then x is the number to be repeated and n is the number of repetitions. Hence, , , and so on.
We can see from the figure below that can be a hypotenuse of a right triangle with integer sides (Pythagorean Triangle).
In fact, this is the only Pythagorean triangle that can be formed with hypotenuse equal to . There is also only one Pythagorean triangle with hypotenuse equal to , that is the triangle with sides , while there are seven Pythagorean triangles with hypotenures of , with legs as follows:
Create the function, , that counts the number of Pythagorean triangles that can be formed with hypotenuse equal to .
Solve

Solution Stats

5 Solutions

4 Solvers

Last Solution submitted on Aug 04, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers4

William Chris Cleveland George Berken David Hill

Suggested Problems

More from this Author116

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!