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:10
Olivia uses the work below to determine 55% of 720 which explains the error in olivia’s solution
Answers: 1
question
Mathematics, 21.06.2019 18:00
Aschool puts on a play. the play costs $1,200 in expenses. the students charge $4.00 for tickets. there will be one performance of the play in an auditorium that seats 500 people. what is the domain of the function that shows the profit as a function of the number of tickets sold?  
Answers: 2
question
Mathematics, 21.06.2019 20:00
The function models the number of accidents per 50 million miles driven as a function
Answers: 1
question
Mathematics, 21.06.2019 21:00
When george started his current job, his employer told him that at the end of the first year, he would receive two vacation days. after each year worked, his number of vacation days will double up to five work weeks (25days) of payed vacation. how many vacation days will he have in 4 years
Answers: 1
You know the right answer?
6.6. Using the extended Euclidean algorithm, compute the greatest common divisor and the parameters...
Questions
question
Mathematics, 30.10.2020 17:50
question
Mathematics, 30.10.2020 17:50
Questions on the website: 13722360