Project Euler | Problem 9 | Special Pythagorean Triplet

Problem Description :

A Pythagorean triplet is a set of three natural numbers, a < b < c, for which, a^2 + b^2 = c^2
For example, 32 + 42 = 9 + 16 = 25 = 52. There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product abc.

Concept :

We have following two equations.

1) a^2+b^2=c^2
2) a+b+c=1000

on solving these equations mathematically.


Java Program :

Output :

Output of Project Euler Problem 9 in Java
Output - Project Euler Problem 9 Solution in Java

References :

Thank you friends, I hope you have clearly understood the solution of this problem. If you have any doubt, suggestion or query please feel free to comment below. You can also discuss this solution in our forum.

Tags : Project Euler Problem 9 solution in Java, Mathematics problems, Special Pythagorean Triplet, for loop, if else statement.

About Author:

I am simple guy with lot of ambitions. My main motive is to share whatever knowledge I have related to programming. With me you can easily learn how to solve any programming problem in Java.You can connect with me on social networking sites also.

Let's Get Connected: Linkedin | Facebook |

Project Euler | Problem 9 | Special Pythagorean Triplet Project Euler | Problem 9 | Special Pythagorean Triplet Reviewed by Rohit Agarwal on 3/10/2017 Rating: 5

No comments:

Please provide your valuable comments. If you have any suggestion please share with me I will work on it and if you have any question or doubt please ask, don't hesitate. I am your friend, i will clarify all your doubts.

Powered by Blogger.