Here are some notes about the question at the top.

and this is the question:

Here

We have discussed the problem of finding two (2) non-zero positive numbers as follows: Algorithm: - The larger number is reduced by the smaller number - Repeat the above instruction until they are equal. Code: We decide to used while loop and express the algorithm to be the following code: while ( n!=ra) { if (n>ro) n=n-m;/ is larger else mem-n;//m is larger } // while Mathematics: some mathematicians express the algorithm as a function f from a domain NxN to co- domain N with the following definition: * f(n,m) = f( n-m,m) when n> m, * f(n,m) = f(n, m-n), when m>n, * f(n,m) = n, when n ==m Recursive function: static int findGCDR (int m, int n) { if (n>) return findGCDR(m,n-m); else if (n