Results 221 to 230 of about 379,338 (251)
Some of the next articles are maybe not open access.
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 +2 more sources
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 +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 +2 more sources
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 +2 more sources
On the units of algebraic number fields
Mathematika, 1967Let p be a prime number, Qp the field of p-adic numbers and Ωp the completion of the algebraic closure of Qp with its valuation normed by setting |p| = 1/p.
openaire +2 more sources
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 +2 more sources
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 +2 more sources
2016
Arithmetical algorithms considered in Chap. 5 are based on the arithmetical operations with matrices of the number systems. If the entries of these matrices are not integers or rationals, we need arithmetical algorithms which work with them. Such algorithms exist for algebraic numbers.
openaire +2 more sources
Arithmetical algorithms considered in Chap. 5 are based on the arithmetical operations with matrices of the number systems. If the entries of these matrices are not integers or rationals, we need arithmetical algorithms which work with them. Such algorithms exist for algebraic numbers.
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 +2 more sources
Cancer treatment and survivorship statistics, 2022
Ca-A Cancer Journal for Clinicians, 2022Kimberly D Miller +2 more
exaly
Cancer statistics in China, 2015
Ca-A Cancer Journal for Clinicians, 2016Rongshou Zheng +2 more
exaly