How to solve

Task $9\mathrm{.}4$ Lab$/$Project $7$

Due Tuesday by $11$:$59$pm Points $25$ Submitting a file upload

Available Nov $21$ at $12$am $-$ Dec $4$ at $11$:$59$pm

A Pythagorean triple is a set of three integers, $a,b,$ and $c,$ such that $a^2+b^2=c^2.$ Write an assembly program to print all the Pythagorean triples where $c500.$ Use a function to test whether a set of numbers is a Pythagorean triple.

Write an assembly program to read two $8$ byte integers with scanf and compute their greatest common divisor using Euclid's algorithm, which is based on the recursive definition:

$gcd(a,b)=\{\begin{array}{ccc}a& if& b=0\\ gcd(b,& \text{a}\text{m}\text{o}\text{d}\text{b})\text{e}\text{l}\text{s}\text{e}& \end{array}$

Use this is for my computer architecture class we use x$86$ windows