Results 271 to 280 of about 15,204 (313)
Some of the next articles are maybe not open access.
1967
We shall need some elementary results about vector-spaces over Q, involving the following concept: Definition 1. Let E be a vector-space of finite dimension over Q. By a Q-lattice in E, we understand a finitely generated subgroup of E which contains a basis of E over Q. Proposition 1.
openaire +1 more source
We shall need some elementary results about vector-spaces over Q, involving the following concept: Definition 1. Let E be a vector-space of finite dimension over Q. By a Q-lattice in E, we understand a finitely generated subgroup of E which contains a basis of E over Q. Proposition 1.
openaire +1 more source
1979
Any nonconstant polynomial with rational coefficients has roots in the complex numbers. Those complex numbers which are roots of polynomials with rational coefficients are called algebraic numbers.
openaire +1 more source
Any nonconstant polynomial with rational coefficients has roots in the complex numbers. Those complex numbers which are roots of polynomials with rational coefficients are called algebraic numbers.
openaire +1 more source
Factoring Polynomials Over Algebraic Number Fields
ACM Transactions on Mathematical Software, 1976A method for factoring polynomials whose coefficients are in an algebraic number field is presented. This method is a natural extension of the usual Henselian technique for factoring polynomials with integral coefficients. In addition to working in any number field, our algorithm has the advantage of factoring nonmonic polynomials without inordinately ...
Weinberger, P. J. +1 more
openaire +2 more sources
1988
Let us consider the diophantine equation $$x^2 - dy^2 = 1$$ (4.1) , erroneously called Pell’s equation. (For its history, see Ref. 9.) Here d ≠ 0 is a square-free integer. We seek the integer solutions of (4.1). If d 1, it is a nontrivial fact that (4.1) has infinitely many solutions in integers.
openaire +1 more source
Let us consider the diophantine equation $$x^2 - dy^2 = 1$$ (4.1) , erroneously called Pell’s equation. (For its history, see Ref. 9.) Here d ≠ 0 is a square-free integer. We seek the integer solutions of (4.1). If d 1, it is a nontrivial fact that (4.1) has infinitely many solutions in integers.
openaire +1 more source
ALGEBRAIC NUMBER FIELDS WITH LARGE CLASS NUMBER
Mathematics of the USSR-Izvestiya, 1974zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2012
This chapter is an introduction to algebraic number fields, which arose from both a generalization of the arithmetic in ℤ and the necessity to solve certain Diophantine equations. After recalling basic concepts from algebra and providing some polynomial irreducibility tools, the ring of integers \(\mathcal {O}_{\mathbb {K}}\) of an algebraic number ...
openaire +1 more source
This chapter is an introduction to algebraic number fields, which arose from both a generalization of the arithmetic in ℤ and the necessity to solve certain Diophantine equations. After recalling basic concepts from algebra and providing some polynomial irreducibility tools, the ring of integers \(\mathcal {O}_{\mathbb {K}}\) of an algebraic number ...
openaire +1 more source
1993
An algebraic number field F is a finite extension field of the rational numbers ℚ. It can be generated by a root p of a monic irreducible polynomial $$f(t) = {{t}^{n}} + {{a}_{1}}{{t}^{{n - 1}}} + {\text{ }} \ldots + {{a}_{n}}\epsilon \mathbb{Z}[t]$$ , (27) where n is also called the degree of F.
openaire +1 more source
An algebraic number field F is a finite extension field of the rational numbers ℚ. It can be generated by a root p of a monic irreducible polynomial $$f(t) = {{t}^{n}} + {{a}_{1}}{{t}^{{n - 1}}} + {\text{ }} \ldots + {{a}_{n}}\epsilon \mathbb{Z}[t]$$ , (27) where n is also called the degree of F.
openaire +1 more source
Factoring Polynomials over Algebraic Number Fields
SIAM Journal on Computing, 1985The author describes an algorithm for factoring polynomials over arbitrary number fields. This algorithm works as follows. Given a polynomial f, defined over a number field K. We take the norm N f of f to \({\mathbb{Q}}[X]\), and factor N f over \({\mathbb{Q}}\). If N f is square free we derive a factorization of f.
openaire +2 more sources
Algebraic Numbers and Number Fields
1998A number α is called an algebraic number if it satisfies an equation of degree m of the form $${\alpha ^m} + {a_1}{\alpha ^{m - 1}} + {a_2}{\alpha ^{m - 2}} + \cdots + {a_m} = 0$$ where a 1, a 2,..., a m are rational numbers.
openaire +1 more source
1981
A system of complex numbers is called a number field (or, more briefly, a field) if it contains more than one number and if along with the numbers α and β it always contains α + β, α − β,αβ, and, if β ≠ 0, α/β.
openaire +1 more source
A system of complex numbers is called a number field (or, more briefly, a field) if it contains more than one number and if along with the numbers α and β it always contains α + β, α − β,αβ, and, if β ≠ 0, α/β.
openaire +1 more source