Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

|
Options

bobbym
2012-10-21 17:23:21

Hi Johnathon bresly;

You posted before I was done. There is more up there now.

Johnathon bresly
2012-10-21 17:15:10

I have quite understand it,30 minutes ago I searched in wikihow and found a similar way.

bobbym
2012-10-21 12:31:51

Hi;

Let's do an example:

To solve this you form the following table:

The first two rows are just the GCD algorithm applied to 74 and 54.

The last row is generated by the following trick. See the 1 and the 0 that are boxed off they are always given. To get the 2 you take the number before it (second boxed number (1)) and multiply it by the top row number that is in the same column. So that is (1)(2), now you add the number 2 before it ( second boxed number ) (1)(2) +1 = 3.

To get the next number you take number before it and times it by the top row, same column and add the number before that.
(2)(1)+1 = 3.

Next is (3)(2)+2 = 8.

Last is (8)(1)+3 = 11. Now the whole table is filled up and ready for the final stage.

Cross multiply the first 2 numbers in the second and third row.

So x =-8  and y = 11 is a solution.

Johnathon bresly
2012-10-21 12:29:59

It will be better if you post it.

bobbym
2012-10-21 12:07:32

Hi;

Okay, I will need some time to post it. Or are you able to download a pdf file if I give you a link?

Johnathon bresly
2012-10-21 11:51:32

I will try my best to understand those methods,so please post them.

bobbym
2012-10-21 07:18:26

Hi;

The other method is somewhat simpler but requires a knowledge of recurrence or difference equations. Are you up to that?

Johnathon bresly
2012-10-21 03:44:02

Oh,I understand it now,but what is it with the other solution method.

Johnathon bresly
2012-10-21 01:36:18

This back substitution is a little complex,is there any rule for which number to substitute in the steps?

bobbym
2012-10-20 20:12:55

Hi Johnathon bresly;

Here is a method to do this;

This is best understood using an example:

First find the gcd(1124,84), which equals 4.

Here are the steps.

Now we back substitute starting with the second to last step.

So then a solution of

is

x = 8 and y = -107

There is a much better way to do this using a backward recurrence but you would need to go to another page to see it.

Johnathon bresly
2012-10-20 18:43:19

I am sorry but i use mobile phone to go to internet and that link is not visible to me so it'd be better if you explain it here,and i have learned the euclidean algorithm now,(not the extended one)

bobbym
2012-10-20 12:11:15

Hi;

Trial and error is not exactly guessing it is just the simplest without learning more math.

If you do want more, read this first it will give an example of the extended GCD algorithm.

http://mathworld.wolfram.com/DiophantineEquation.html

Come back then with your questions.

Johnathon bresly
2012-10-20 11:55:41

So the first solution can only be achieved by guessing?

bobbym
2012-10-20 11:31:44

Hi;

If the gcd(a,b) does not divide c then there are no solutions.

If gcd(a,b)= d and d does divide c then there are an infinite number of solutions.

The simplest way is to get a particular solution by trial and error. This is feasible because of the simplicity of the equations.

Once you have a particular solution x0 and y0 you can get all of them by these parametric equations.

Johnathon bresly
2012-10-20 02:56:19

Could you explain it further(i don't know the Euclidean algorithm)