Given the square root of a square number, seed, and a range, n, find the square number, Z as well as the other side, y, the square root of a square number i.e. return the hypotenuse squared as well as the length of the other side. Note that n is the number of squares to search through starting with one.
HINT: Z = seed^2 + y^2 where Z = z^2, find Z first and then y.
Note that Z, seed^2 and y^2 are all perfect squares.
>> [z s] = findPerfectZ(3,6)
z = 25
s = 4
>>
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers60
Suggested Problems
-
Renaming a field in a structure array
1579 Solvers
-
1913 Solvers
-
Project Euler: Problem 7, Nth prime
1756 Solvers
-
Sum of first n terms of a harmonic progression
504 Solvers
-
Reverse the elements of an array
1120 Solvers
More from this Author16
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
There's a problem with the solution suite. For seed=12 and n=16, the proposed answer of 5, 12, 13 as a Pythagorean triple is indeed a good one. However, 9, 12, 15 is equally valid but not included as an answer. To avoid this, I would suggest changing the problem so that it requires finding the answer with the minimum Z^2 to avoid ambiguity.