subject
Mathematics, 08.04.2020 01:25 raiindrxp

6.6. Using the extended Euclidean algorithm, compute the greatest common divisor and the parameters s, t of 1. 198 and 243 2. 1819 and 3587 For every problem check if s r0 +t r1 = gcd(r0,r1) is actually fulfilled. The rules are the same as above: use a pocket calculator and show what happens in every iteration step.

ansver
Answers: 1

Another question on Mathematics

question
Mathematics, 21.06.2019 14:30
Given the parent function of [tex]f(x)=x^4[/tex], what change will occur when the function is changed to [tex]f(\frac{1}{2} x)[/tex]?
Answers: 3
question
Mathematics, 21.06.2019 15:00
Answer this question! 30 points and brainliest! only if you know the answer.
Answers: 1
question
Mathematics, 21.06.2019 15:30
Which of the following statements is not true? a.parallel lines are lines in the same plane that never intersect. b.congruent figures have the same shape and same size angles and sides. c.similar figures must have the same shape and the same size. d.a rotation is when you turn a figure around a certain point.
Answers: 1
question
Mathematics, 21.06.2019 22:00
If i had 1234 apples and 1 banana what is the total amount
Answers: 2
You know the right answer?
6.6. Using the extended Euclidean algorithm, compute the greatest common divisor and the parameters...
Questions
question
Arts, 21.02.2021 05:10
question
Mathematics, 21.02.2021 05:10
question
Mathematics, 21.02.2021 05:10
question
Mathematics, 21.02.2021 05:10
question
Mathematics, 21.02.2021 05:10
Questions on the website: 13722362