Good evening,
I have a question concerning the euclidean algorithm.
One knows that for a1,…,an∈N and k∈N there exist some λi∈Z such that :
gcd(a1,…,an)=1kn∑i=1λiai
Here is my question: can one find a m0∈N that for every m≥m0 there are scalars μi∈N such that:
gcd(a1,…,an)=1mn∑i=1μiai
Unfortunately I have only very rudimentary knowledge about number theory ...
With best regards
Mat
Answer
Let's say that gcd(a1,…,an)=d and d=n∑i=1λiai for some λi∈Z.
Suppose that si∈N are sufficiently large such that ri=λi+sia1a2…ai−1ai+1…an>a1d|λi| and n∑i=1riai=m0d for some m0∈N.
For all r=0,1,…,a1d−1 we have (m0+r)d=n∑i=1(ri+rλi)ai
and ri+rλi>0 for all i.
For r≥a1d if r=qa1d+s with q∈N, s∈{0,1,…,a1d−1} we have (m0+r)d=(r1+sλ1+q)a1+n∑i=2(ri+sλi)ai
and r1+sλ1+q>0, ri+sλi>0 for all i≥2.
Therefore for every m≥mo, md=n∑i=1μiai⇒d=1mn∑i=1μiai for some μi∈N.
Titanium White Wheels: A new type of tire system - TITS
ReplyDelete› titanium earrings sensitive ears TITS › TITS how strong is titanium › black titanium ring TITS does titanium have nickel in it › TITS › TITS › TITS › everquest: titanium edition TITS_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T_T
advice realistic dildo,cheap sex toys,dildos,love dolls,custom sex doll,dog dildo,custom sex doll,custom sex doll,sex chair pop over to this website
ReplyDelete