Stepanov method of the estimation of the number of roots of some equations (Q1316875): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Christian Elsholtz / rank | |||
Property / reviewed by | |||
Property / reviewed by: Christian Elsholtz / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5587679 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5631186 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An elementary proof of the Hasse-Weil theorem for hyperelliptic curves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3215356 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:34, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Stepanov method of the estimation of the number of roots of some equations |
scientific article |
Statements
Stepanov method of the estimation of the number of roots of some equations (English)
0 references
12 April 1994
0 references
Let \(p\) be an odd prime, and \(\mathbb{F}_ p\) a finite field with \(p\) elements. \(L(x)= \sum_{k=1}^{p-1} x^{p-k}/k\) and \(E(x)= \sum_{k=0}^{p-1} x^ k/k!\) are two polynomials over \(\mathbb{F}_ p\). In the present paper, the author proves that for any \(\lambda\in \mathbb{F}_ p\) the number of roots of \(L(x)-\lambda\) or \(E(x)-\lambda\) in \(\mathbb{F}_ p\) does not exceed \(2p^{2/3}+2\).
0 references
finite field
0 references
polynomials
0 references
number of roots
0 references