<span>Exploit -</span> An attack that takes advantage of a system vulnerability, often<span> due to a combination of one or more improperly configured services.</span>
Records for the first one and table for the second one
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>
let's say they catch-up to each other after t hour.
so
in t hour distance travelled by Renee
d = speed × time = 50t
in t hour distance travelled by Kim
d = speed × time = 60(t-1) + 0×1 = 60(t-1)
Note: here kim didn't covered any distance in first hour and in rest t-1 hour it travelled all distance
now.as distance travelled by both is same so
60(t-1) = 50t
60t -60 = 50t
adding 60 both sides
60t = 50t+60
subtracting 50t both sides
60t -50t = 50t+60 - 50t
10t = 60
dividing by 10 both sides
t = 60/10 = 6
so in 6 hour both will catch-up to each other
