elementary number theory - School of Mathematical Sciences
... division with a residue and the Euclid’s algorithm that computes the greatest commond divisor of two natural numbers. It also leads to a proof of the fundamental theorem of arithmetic: Every natural number is a product of prime numbers in a unique way up to the order of the factors. Euclid’s theorem ...
... division with a residue and the Euclid’s algorithm that computes the greatest commond divisor of two natural numbers. It also leads to a proof of the fundamental theorem of arithmetic: Every natural number is a product of prime numbers in a unique way up to the order of the factors. Euclid’s theorem ...
Example 6.1 Rev 1N2
... The solution is found by adding the nonhomogeneous part to the homogeneous part. > Y:=evalm(mat&*Y0+mat3): The solution at y = 0 and y = 1 is stored in sol0 and sol1 to calculate the unknown constants. > sol0:=map(eval,evalm(subs(zeta=0,evalm(Y)))): > sol1:=map(eval,evalm(subs(zeta=epsilon/h,evalm(Y ...
... The solution is found by adding the nonhomogeneous part to the homogeneous part. > Y:=evalm(mat&*Y0+mat3): The solution at y = 0 and y = 1 is stored in sol0 and sol1 to calculate the unknown constants. > sol0:=map(eval,evalm(subs(zeta=0,evalm(Y)))): > sol1:=map(eval,evalm(subs(zeta=epsilon/h,evalm(Y ...
![9 The resultant and a modular gcd algorithm in Z[x]](http://s1.studyres.com/store/data/017337470_1-8c6dfa8fbd5c9da3a383209d818c2d7f-300x300.png)
