Computer Science, asked by irenesamson602, 2 months ago

Let m be the gcd of 117 and 299. Find m using the Euclidean algorithm

Answers

Answered by kaushikghorai84

1

Answer:

gcd(m) = 13

Explanation:

a > b

a = 299

b = 117

a = b * q + r

299 = 117 * 2 + 65

117 = 65 * 1 + 52

65 = 52 * 1 + 13

52 = 13 * 4 + 0

gcd = 13

Previous Question

Next Question

Similar questions

Economy, 1 month ago

(accounting for Not-for-profit organization) is this the chap l need the introduction please .•♫•♬•❤HELP ME YARR PLEASE ❤•♬•♫•.

Math, 1 month ago

slove the following question 4/2^2+4/2^2...

Math, 1 month ago

if (5,0) is a solution of 11x-2y=p then find the value of p...

Science, 2 months ago

correct them and rewrite the statement : 1)In february,orien rises at 8 pm on the eastern horizon. 1.Ans 2)Bones are joined to each other by muscles. 2.Ans 3) Micro organism having many cells. 3.Ans...

Physics, 2 months ago

A two wire DC distributor AB, 1000 meter long, is supplied from both ends, 240 V at A and 242 V at B. There is a concentrated load of 200 A at a distance of 400 meter from A and a uniformly load 1.0 A/m between the midpoint and end B. Determine (i) the current fed at points A and B (ii) the point of minimum potential and (iii) voltage and this point. Consider cable resistance as 0.005 ohm...

Math, 9 months ago

a hotel meal usually Costs 80 .a special rate of 60 is offered for lunch on Thursday only .calculate the percent discount...

Social Sciences, 9 months ago

contribution of srinivas ramanujan in mathematics...

Math, 9 months ago

simplify 17 2/3, 17 9/5...