# Difference between revisions of "Avengers"

(→Pythagorean Triples) |
(→Assignment 1) |
||

Line 7: | Line 7: | ||

== Progress == | == Progress == | ||

=== Assignment 1 === | === Assignment 1 === | ||

− | ==== Bruno ==== | + | ==== Bruno - Pythagorean Triples ==== |

− | |||

[https://www.daniweb.com/programming/software-development/threads/345155/calculating-the-pythagorean-triples Pythagorean Triples by Violet_82] | [https://www.daniweb.com/programming/software-development/threads/345155/calculating-the-pythagorean-triples Pythagorean Triples by Violet_82] | ||

+ | |||

+ | "A Pythagorean triple is a triple of positive integers a, b, and c such that a right triangle exists with legs a,b and hypotenuse c. By the Pythagorean theorem, this is equivalent to finding positive integers a, b, and c satisfying: | ||

+ | |||

+ | a^2+b^2=c^2. | ||

+ | |||

+ | The smallest and best-known Pythagorean triple is (a,b,c)=(3,4,5). The right triangle having these side lengths is sometimes called the 3, 4, 5 triangle. [...] | ||

+ | |||

+ | In addition, one side of every Pythagorean triple is divisible by 3, another by 4, and another by 5. One side may have two of these divisors, as in (8, 15, 17), (7, 24, 25), and (20, 21, 29), or even all three, as in (11, 60, 61)." | ||

+ | |||

+ | Weisstein, Eric W. "Pythagorean Triple." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/PythagoreanTriple.html | ||

+ | |||

+ | This algorithm (supposedly) calculates all Pythagorean triple (not primitive Pythagorean triples) values from initial values of the opposed side of a triangle. The algorithm needs some logical improvement to display only values from the starting range, these improvements should not be hard to implement but it still serves the purpose to calculate all Pythagorean triples from the simplest up to the maximum hypotenuse number given by the user. The code has been slightly modified to receive command line parameters, facilitating its execution on UNIX enviroments. | ||

+ | |||

+ | [https://github.com/brucremo/DPS915 Code and Execution Instructions on GitHub] | ||

==== Jaideep ==== | ==== Jaideep ==== |

## Revision as of 12:45, 15 February 2019

GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary

## Contents

# Team Avengers

## Team Members

- Bruno Alexander Cremonese de Morais, Some responsibility
- Jaideep Sidhu, Some different responsibility

## Progress

### Assignment 1

#### Bruno - Pythagorean Triples

Pythagorean Triples by Violet_82

"A Pythagorean triple is a triple of positive integers a, b, and c such that a right triangle exists with legs a,b and hypotenuse c. By the Pythagorean theorem, this is equivalent to finding positive integers a, b, and c satisfying:

a^2+b^2=c^2.

The smallest and best-known Pythagorean triple is (a,b,c)=(3,4,5). The right triangle having these side lengths is sometimes called the 3, 4, 5 triangle. [...]

In addition, one side of every Pythagorean triple is divisible by 3, another by 4, and another by 5. One side may have two of these divisors, as in (8, 15, 17), (7, 24, 25), and (20, 21, 29), or even all three, as in (11, 60, 61)."

Weisstein, Eric W. "Pythagorean Triple." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/PythagoreanTriple.html

This algorithm (supposedly) calculates all Pythagorean triple (not primitive Pythagorean triples) values from initial values of the opposed side of a triangle. The algorithm needs some logical improvement to display only values from the starting range, these improvements should not be hard to implement but it still serves the purpose to calculate all Pythagorean triples from the simplest up to the maximum hypotenuse number given by the user. The code has been slightly modified to receive command line parameters, facilitating its execution on UNIX enviroments.

Code and Execution Instructions on GitHub

#### Jaideep

Subject: