Answered step by step
Verified Expert Solution
Question
1 Approved Answer
I'm finding the greatest common denominator of 2 integers. As mod uses division, how do i modify the program to ensure that the program do
I'm finding the greatest common denominator of 2 integers. As mod uses division, how do i modify the program to ensure that the program do not perform a division by zero, which results in error. I tried using while not b == 0 or not a == 0: but doesn't work. Can someone tweak it and explain to me how to go about the zerodivisionerror.
ConsoleStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started