home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!mcsun!sunic!aun.uninett.no!ugle.unit.no!levangerhs.no!ap
- From: ap@levangerhs.no (Andrei Prasolov)
- Subject: Re: ALGEBRAIC NUMBER ARITHMETIC
- Message-ID: <1992Jul30.151149.12688@ugle.unit.no>
- Keywords: algebraic numbers, arithmetic
- Sender: news@ugle.unit.no (NetNews Administrator)
- Organization: Hogskolen i Levanger
- Date: Thu, 30 Jul 92 15:11:49 GMT
- Lines: 35
-
- Answering to <aet.712408532@munagin>
- in <1992Jul29.163830.6443@ugle.unit.no>
- I made a mistake. If we represent algebraic numbers
- only by their minimal polynomials, we cannot construct
- a correct arithmetic. Let us take the main root x of
-
- 2
- f(X) = X -2 and the main root y of
-
- 4
- g(Y) = Y -2. The algorythm says that z = x+y is
-
- a root of h(Z) = h_1(Z) * h_2(Z) where
- h_1(Z) = (Z^2+2)^2-2(2Z+1)^2
- has roots x+y, x-y, -x+iy, -x-iy, and
- h_2(Z) = (Z^2+2)^2-2(2Z-1)^2
- has roots x+iy, x-iy, -x+y, -x-y.
- The algorythm cannot determine, which polynomial
- from the two the number x+y is a root of.
- So the representation by pairs (irr. polynomial, interval)
- seems to be reasonable. One needs, however, the following
- two algorythms:
- 1. Separation of roots of a polynomial
- (there exists a lot of algorythms).
- 2. Decomposition of polynomials over Q into
- prime factors (I am not aware of any).
-
- Andrei PRASOLOV
- Hoegskolen i Levanger
- Kirkegt 1, 7600 Levanger
- Norway
-
- Tel. 47-76-89157 (office), 47-76-89688+2304 (home)
- Telefax 47-76-89155, e-mail AP@LEVANGERHS.NO
-
-