subject
Mathematics, 10.07.2019 04:40 averagegirl27

A. use the euclidean algorithm to find gcd(870, 153). show every step and every iteration of the algorithm, but you do not need to show each individual calculation used. b. use the euclidean algorithm to find gcd(4282, 1239). show every step and every iteration of the algorithm, but you do not need to show each individual calculation used.

ansver
Answers: 3

Another question on Mathematics

question
Mathematics, 21.06.2019 17:30
During a bike challenge riders have to collect various colored ribbons each 1/2 mile they collect a red ribbon each eighth mile they collect a green ribbon and each quarter mile they collect a blue ribbion wich colors of ribion will be collected at the 3/4 markrer
Answers: 3
question
Mathematics, 21.06.2019 19:30
Anna is constructing a line segment that is congruent to another segment ab. for the construction, which tool should be used to mesure segment ab
Answers: 1
question
Mathematics, 21.06.2019 22:30
Varies inversely with x. if y=8.5 when x=-1 find x when y=-1
Answers: 1
question
Mathematics, 22.06.2019 00:50
Assume that adults have iq scores that are normally distributed with a mean of mu equals 100 and a standard deviation sigma equals 20. find the probability that a randomly selected adult has an iq between 80 and 120.assume that adults have iq scores that are normally distributed with a mean of mu equals 100 and a standard deviation sigma equals 20. find the probability that a randomly selected adult has an iq between 80 and 120.
Answers: 3
You know the right answer?
A. use the euclidean algorithm to find gcd(870, 153). show every step and every iteration of the alg...
Questions
question
Social Studies, 11.07.2019 08:20
question
History, 11.07.2019 08:20
Questions on the website: 13722367