The problem of large powers and that of large roots
Let \(K\) be a field of the characteristic 0. There exist problems that can be solved by a finite number of operations. For example, if \(a_0,\ldots,a_n\) and \(b\) are elements of \(K,\) it is possible to find out if \(b\) is a root of a polynomial \(a_0+a_1x+\ldots+a_nx^n,\) using Horner's algorithm, and a test for the equality to zero. Such calculations can be presented by special graphs. The natural question is: what is the minimal number of operations sufficient for solving a concrete problem? Let's enrich the given field with differentiation (and so deal with a differential field). Is it true that the minimal number of operations sufficient for solving a concrete problem will be reduced? The author investigates two problems, the problem of large powers and the problem of large roots, for which differentiation do not accelerate calculations. The author uses calculation schemes from \textit{B. Poizat} [Les petits cailloux. Lyon: Aléas (1995; Zbl 0832.68044)].
- Publication:3490076
- Some problems involving powers of integers
- scientific article; zbMATH DE number 5307537
- On the Power Sums of the Roots of a Polynomial
- The number of roots of polynomials of large degree in a prime field
- On Waring's problem for larger powers
- Power roots of polynomials over arbitrary fields
- On roots of polynomials with power series coefficients
- On the “Problem of the Last Root” for Exponential Terms
This page was built for publication: The problem of large powers and that of large roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2710600)
