S.O.S. Mathematics CyberBoard

Your Resource for mathematics help on the web!
It is currently Tue, 3 Dec 2024 02:55:21 UTC

All times are UTC [ DST ]




Post new topic Reply to topic  [ 1 post ] 
Author Message
 Post subject: Euclidean Algorithm
PostPosted: Tue, 21 Apr 2020 09:37:36 UTC 
Offline
Member

Joined: Fri, 29 Jan 2016 16:55:04 UTC
Posts: 28
I understand that the algorithm proceeds as follows:

k=0, a=q₀b + r₀
k=1, b=q₁r₀ + r₁
k=2, r₀=q₂r₁ + r₂
k=3, r₁=q₃r₂ + r₃

The text I have is using a=75, b=38 as its example. In German this is represented as ggT(75, 38). They then write (I'm translating):

Quote:
We set r₀ = 75 (the larger of the two numbers) and r₁ = 38 and divide:

75 = 1 * 38 + 37, (thus q₁ = 1, r₂ = 37)
38 = 1 * 37 + 1, (thus q₂ = 1, r₃ = 1)
37 = 37 * 1 + 0


The problem is with "thus q₁ = 1." This means to me: r₀ = 75, r₁ = 38, q₁ = 1, r₂ = 37. At k=2, the equation should be: r₀=q₂r₁ + r₂. But at k=2 their equation is r₀=q₁r₁ + r₂.

I don't understand the discrepancy.


Top
 Profile  
 
Display posts from previous:  Sort by  
Post new topic Reply to topic  [ 1 post ] 

All times are UTC [ DST ]


Who is online

Users browsing this forum: No registered users


You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum

Search for:
Jump to:  
cron
Contact Us | S.O.S. Mathematics Homepage
Privacy Statement | Search the "old" CyberBoard

users online during the last hour
Powered by phpBB © 2001, 2005-2017 phpBB Group.
Copyright © 1999-2017 MathMedics, LLC. All rights reserved.
Math Medics, LLC. - P.O. Box 12395 - El Paso TX 79913 - USA