Code: Select all
declare function gcd(p As Integer, q As Integer) As Integer
Dim As Integer p, q
' recursive Euclidean algorithm
function gcd(p As Integer, q As Integer) As Integer
if q = 0 then
return p
end if
return gcd(q, p mod q)
end function
Code: Select all
declare function gcd(p As Integer, q As Integer) As Integer
Dim As Integer p, q
' recursive Euclidean algorithm
function gcd(p As Integer, q As Integer) As Integer
if q = 0 then
return p
end if
return gcd(q, p mod q)
end function
Code: Select all
declare function gcd(p As Integer, q As Integer) As Integer
declare function lcm(p As Integer, q As Integer) As Integer
Dim As Integer p, q
' recursive Euclidean algorithm
function gcd(p As Integer, q As Integer) As Integer
if q = 0 then
return p
end if
return gcd(q, p mod q)
end function
' using gcd we can find lcm
function lcm(p As Integer, q As Integer) As Integer
return (p*q) / gcd(p, q) ' use gcd from previous function
end function
input "Enter first integer number: ";p
input "Enter second integer number: ";q
print "GCD of the numbers is: ";gcd(p,q)
print "LCM of the numbers is: ";lcm(p,q)
Sleep