Trying to write a program to implement Euler's Algorithm????

I am trying to write a program to implement Euler's algorithm. I know that the greatest common divisor of (a,b,c) = gcd(gcd(a,b),c). I also want to write another program to compute the gcd of three natural numbers. I am having trouble doing this though. Here is what I know, that a = b*(quotient q) + remainder(r), where a>b and b>r, so that to find the gcd(a,b) I could replace a and b by b and r and repeat the process. The successive remainders get smaller until I eventually get r = 0. I just simply am confused on how to go about writing a program for this.

[Reelz]

I have the code! But now I need to write it to compute three numbers? I do not know why but this code right here is not working, help please?

clear; clc

% input, take only positive numbers into account

a = input('First number: ');

b = input('Second number: ');

c = input('Third number: ');

a = abs(a);

b = abs(b);

c = abs(c);

r = (a - b*floor(a/b/c));

% Repeat the operation till updates of a = # of update b

while r ~= 0

a > b;

a = b;

b = r;

r = (a - b*floor(a/b/c));

end

% Show result

GCD = b

[Geoff]

Create a function to compute GCD of 2 numbers:

function [g] = gcd(a,b)

Put your code in there and make it work.

Like you already said, gcd(a,b,c) is the same as gcd(gcd(a,b),c)

[Reelz]

I have the code down, but now I am trying to compute three outputs, I keep running into trouble though. Help please?

clear; clc

% input, take only positive numbers into account

a = input('First number: ');

b = input('Second number: ');

c = input('Third number: ');

a = abs(a);

b = abs(b);

c= abs(c);

r = a - b*floor(a/b);

% Repeat the operation till updates of a = # of update b

while r ~= 0

a > b;

a = b;

b = r;

r = a - b*floor(a/b);

end

% Show result

GCD = b

[Geoff]

Eh?? What are the other two outputs. I understand you want to compute GCD(a,b,c). Is that correct? If so, read my last comment. Make a function to compute GCD of two numbers. I don't see any function definitions in your code.

Answer 1

[Geoff]

Have you considered doing a google for the Euclidean Algorithm?

http://lmgtfy.com/?q=euclidean+algorithm

Try the very first search result =P

Halfway down the page, there's very concise pseudocode.