Answer:
In Python:
def gcd(m,n):
if n == 0:
return m
elif m == 0:
return n
else:
return gcd(n,m%n)
Explanation:
This defines the function
def gcd(m,n):
If n is 0, return m
<em> if n == 0:
</em>
<em> return m
</em>
If m is 0, return n
<em> elif m == 0:
</em>
<em> return n
</em>
If otherwise, calculate the gcd recursively
<em> else:
</em>
<em> return gcd(n,m%n)</em>
<em />
<em>To call the function to calculate the gcd of say 15 and 5 from main, use:</em>
<em>gcd(15,5)</em>
Answer:
supercomputers are the computer that is used in scientific research.
Concatenation, which mean we combine two or more strings into one.
def recursiveFactorial(number):
if number > 1:
return number * recursiveFactorial(number-1)
else:
return 1
stringNum = input("Enter a positive integer: ")
num = int(stringNum)
print(recursiveFactorial(num))
