# Euler Problem 9 : Special Pythagorean Triple

[This article was first published on

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

**The Devil is in the Data**, and kindly contributed to R-bloggers]. (You can report issue about the content on this page here)Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

## Euler Problem 9 Definition

A Pythagorean triple is a set of three natural numbers, , for which, . For example:

.

There exists exactly one Pythagorean triplet for which .

Find the product of *a*, *b* and *c*.

## Brute Force Solution

This solution uses brute force and checks all combinations of *a*, *b* and *c*. To limit the solution space I used the fact that *a* < *b* < *c*, which implies that *a* < *s*/3, and *a* < *b* < *s*/2, where *s* is the sum of the three sides.

a <- 0 b <- 0 c <- 0 s <- 1000 found <- FALSE for (a in 1:floor((s/3))) { for (b in a:(s/2)) { c <- s - a - b if (a^2 + b^2 == c^2) { found <- TRUE break } } if (found) break } answer <- a * b * c

The post Euler Problem 9 : Special Pythagorean Triple appeared first on The Devil is in the Data.

To

**leave a comment**for the author, please follow the link and comment on their blog:**The Devil is in the Data**.R-bloggers.com offers

**daily e-mail updates**about R news and tutorials about learning R and many other topics. Click here if you're looking to post or find an R/data-science job.

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.