Here is a question about proof by strong induction on Greatest Common Divisor. I

ID: 3824165 • Letter: H

Question

Here is a question about proof by strong induction on Greatest Common Divisor. I appreciate your help, and I will give thumbs up if your answer is on the right track.

(a) Prove by (strong) induction on b that for all a and b, (i.e. a and b are integers and they can be positive or negative and a can be zero, which means your answer needs to cover all different range of a&b), there exists and t such that gcd(a, b) = sa + tb.
(b) Use your proof to nd s and t such that s * 93 + t * 16 = 1.

Thanks so much!!

Explanation / Answer

#include int main() { int n1, n2, i, gcd; printf("Enter two integers: "); scanf("%d %d", &n1, &n2); for(i=1; i

Navigate

Here is a question about numerical computing, more specifially about solving non

Here is a question by my Econ professor: a woman is selling tacos and burritos a

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

Here is a question about proof by strong induction on Greatest Common Divisor. I

Question

Explanation / Answer

Related Questions

Navigate