subject
Mathematics, 18.07.2019 17:30 allb2916

In applying the euclidean algorithm to find the gcd(a, b) for some integers a and b, some remainder ri is a prime number. prove that gcd(a, b) = ri or 1. when does each case occur? hint: consider ri+1.

ansver
Answers: 3

Another question on Mathematics

question
Mathematics, 21.06.2019 16:30
What is the binomial expansion of (2x-3)^5
Answers: 1
question
Mathematics, 21.06.2019 18:00
The swimming pool is open when the high temperature is higher than 20∘c. lainey tried to swim on monday and thursday (which was 3 days later). the pool was open on monday, but it was closed on thursday. the high temperature was 30∘c on monday, but decreased at a constant rate in the next 3 days. write an inequality to determine the rate of temperature decrease in degrees celsius per day, d, from monday to thursday.
Answers: 1
question
Mathematics, 21.06.2019 18:30
Which one ? is the answer and how to find this answer
Answers: 2
question
Mathematics, 21.06.2019 18:30
The monetary value earned for selling goods or services to customers is called a.) revenue b.) assets c.) money d.) accounting
Answers: 2
You know the right answer?
In applying the euclidean algorithm to find the gcd(a, b) for some integers a and b, some remainder...
Questions
question
Mathematics, 16.12.2020 23:40
question
Social Studies, 16.12.2020 23:40
Questions on the website: 13722362