THE GREATEST COMMON DIVISOR AND LEAST COMMON MULTIPLE Definition let a,b Z Where a o or b o

The positive integer d is the greatest common divisor of a and b if and only if 1. The positive integer d is a common divisor of a and b 2. When an integer c is another common divisor of a and b will get that c And written by ( ( Proof since d c( ) ( ( ) ck ) ) so ( ) ( ) d( ) d.1 d;( ) 1 ( ) that is ) , G.C.D d

so c( )

d;k

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Theorem Let a, b ( Lemma ( Proof ) Z where a ) ax + by o or b o will have integers x , y that make

Proof Look at the theory of number 1 1 ax + by ; x,y Z

Look at the theory of number Z where a o and b o

Definition let a, b

The positive integer m is the least common multiple of a and b if and only if 1. The positive integer m is common multiple of a and b 2. When an integer c is another common multiple of a and b will get m And written by [ [ ] , L.C.M 1, ) x,y m( Z ) ) + bj( c

Lemma Let m Proof

], if c is a common multiple of a and b then ] , and so ai ip + jq mk ; k )[ ] c cip + cjq m bj , ax axip + byjq c ai(

since m [ Consider 1 So c

by; ( )

xp + yq

That is Example show that (

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

Solution let (

d, [ ) 1 m (

] )

m will get a 1 s,t Z

dx, b

dy and ap

Where ( Consider

xs + yt;

mxt + myt apxt + bqyt dxpxt + dyqyt d( ) dk; k xpxt+yqyt

Therefore

N Show that [ ] m, ( ) ] ( ) )

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Example Let a, b a ( ) b Solution ( ) Let [ a dx , b

d will get that 1 b; ( )

dy and ai and bj

m bj; (

consider ai but a, b

if and only if aix

a, bjy

N so x b

Therefore a

( ) we are obvious. @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

The bearing of G.C.D and L.C.M Theorem let a, b Proof since (a, b) Z where a 0 and b 0 will get that (a, b)[a, b]=ab (| |,| |) and [ ] [| | | |]

So we will show when a and b are positive integers. Let [ ] m and m [ ] dx dy b a , we will show that d is G.C.D of a and b and ci, b Z,we will show that yj xi m ax, m by x,y Z

Consider m SO m m Let c SO dy ax by

Z Where, ,

But (

so b and m dx ck d md

Z ax it will get cj that is d ab [ ]( b ( ) ) ab dx

And since cj Hence cxk

Therefore m Theorem Let a, b, c

; a 0, b 0, c 0 then will get [ca, cb]=c[a, b]

Poof Let [ca, cb]=M, [a, b]=K So M=cai=cbj; (I, j)=1, K=ap=bq and then CK=cap=cbq; (p, q)=1 Considering, 1=ix+jy, x,y , 1=ps+qt, s,t

Hence, CK=capix+cbqjy=(cai)px+(cbj)qy=M(px+qy)........ (1) And, M=caips+cbjqt=(cap)is+(cbq)jt=CK(is+jt)................. (2) According to (1) will get M/CK, (2) will get CK/M But, then M, CK so, [CA, CB]=M=CK=C[A, B] ; a 0 b 0

EXAMPLE prove that (a+ b,[a, b])=(a, b), a,b Proof ( ) let d=(a+ b,[a, b]), m=[a, b], k=(a, b) So, we have x, y, I, j

that make dx=a+ b, dy=m=ai=bj

And, then dxi=ai+bi, dxj=aj+bj so, d/bi, d/aj Thence, (I, J)=1 1=is+jt, s,t Which it make a=ais+ajt, b=bis+bjt Therefore, d/a, d/b that is d/k ( ) we are obvious @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Accuracy always arise from inaccuracy so, you have to create good imagination for Approaching accuracy. I am pleased to contribute everyone. Phone 081-4336083

EXAMPLE Prove that ([ Proof Consider ([ And [(

] ) ] ) )(
(

[(
)

)( (
)( )( ) ))

)] ; a ,b ,c ))

Z ,a

o and b

(
(

-------( )

)]

((

------( ) )( ) (( )( ))( ( ))

Suppose that( )

( ) , will get (

)(

We have to show that it is divisible each other. Let ( ( ) ,( ( So (( ) ) ) )( )) ( ( a m And ( ( )) ab ab Hence (( )( n a x ( And ( )( )( ) ) ))( ( c( acx )) n y ( ) bcy b m ) cx ( m ) y m ;( ) by ; ( ;( ) ) ) ( ( ) ;( ) n ( c( ) ) ) ) , ;( ) ( ) ;( ) ( ) ;

c y n

We see obviously that ((

)(

))( )( ))( )( (

)) is divided exactly by ( ) is divided exactly by ))

)(

)(

SIMILARLY, we can show that ( (( THEREFORE, ([ number, [ ]( ) ] ) and ( )( [( )

)(

)] The try is the succeed. ( )

The reader can observe the proof passing through we use only the definition, relatively prime . Please have a try the following

exercises. The desperate man always does desperately.

EXERCISES Prove the expression being the following signs. When let a, b and c are integers. 1. 2. 3. 4. 5. 6. 7. 8. 9. [ ( ( If ( If If ( ( [ [ ( ( ( [ ) ] )] ]) ]( ([ ][ )( )[ ) ( then ) ] ( [ )] )) [ ( ) ][ ];a ), ( ]; a ( ,b ), ( , ) )( ) ) ;a ] ;a a+ b; a ( ]; a ); a ); a and c ); a ( ); a ;a ,b ,b ,b or b and b and b ,b ,b and c and c ]); a ,b and c ); a ,b or b or c and c or c and ,a and c and (a-b, a+b)=1 or 2 ,b or c

) then(

)=1 then(

10. ( 11. [ 12. ( 13. [ 14. [(

abc; a

Good youngsters should recognize when to start what has to be done. Good elders should know when to stop what is being done. I have to thank Professor Dr. NARONG PHUNNIM being my original about Mathematics And that is important it cause I have so happiness. (081-4336083)