(* Robert C. Griggs, Jr.
   Account Number PR03445
   Homework #4
   October 15, 1990 *)

   (* Problem 1 *)

   (* The greatest common divisor of two integers is the largest number to
      divide them both without leaving a remainder.  Write a function that
      determines the greatest common divisor of two integer arguments. *)

function largenum (num1,num2:integer):integer;
     var holdlarge,modnum,count,result1,result2:integer;
     begin  {largenum}
          count:=0;
          holdlarge:=0;
          if (num1 < num2) then
               modnum:=num1
          else modnum:=num2;
          while (count <> modnum) do
               begin
                    count:=count+1;
                    result1:=num1 mod count;
                    result2:=num2 mod count;
                    if ((result1=0) and (result2=0)) then
                         holdlarge:=count;
               end;
          largenum:=holdlarge;
     end;  {largenum}