Let M<SUB>s</SUB>, be the number of solutions of the equation X<SUB>1</SUB><SUP>3</SUP>+ X<SUB>2</SUB><SUP>3</SUP>+ … + X<SUB>s</SUB><SUP>3</SUP>=0 in the finite field GF(p). For a prime p ≡ 1(mod 3), ∑<SUP>∞</SUP><SUB>s=1</SUB> M<SUB>s</SUB>X<SUP>3</SUP> = (x/1-px)+((x<SUP>2</SUP>(p-1)(2+dx))/(1-3px<SUP>2</SUP>-pdx<SUP>3</SUP>)), M<SUB>3</SUB>= p<SUP>2</SUP> + d(p - 1), and M<SUB>4</SUB> = p<SUP>2</SUP> + 6(p<SUP>2</SUP> − p). Here d is uniquely determined by 4<SUB>p</SUB> = d<SUP>2</SUP> + 27b<SUP>2</SUP> and d ≡ 1(mod 3)
AbstractThis paper contributes to the classical problem of the determination of the zeros of a cubic...
AbstractLet N be the number of solutions of the equationx1m1+⋯+xnmn=ax1⋯xn over the finite field Fq=...
Denote by R(F,G) the resultant of two binary forms F,G. Let S = {p1,..., pt} be a finite, possibly e...
Let Ms, be the number of solutions of the equation X13+ X23+ … + Xs3=0 in the finite field GF(...
AbstractLet Ms, be the number of solutions of the equation X13 + X23+ … + Xs3=0 in the finite field ...
AbstractWe extend to finite fields in general the results proved, in a recent paper (J. Number Theor...
AbstractLet F be a finite field with q=pf elements, where p is a prime. Let N be the number of solut...
AbstractLet α,β∈Fqt∗ and let Nt(α,β) denote the number of solutions (x,y)∈Fqt∗×Fqt∗ of the equation ...
AbstractLet F be a finite field with q=pf elements, where p is a prime number. Let N(n) be the numbe...
AbstractLet f be a polynomial over finite field Fq with q elements and let N(f=0) denote the number ...
We obtain an explicit combinatorial formula for the number of solutions (x1, ..., xr) ∈ (Fpab )r to ...
We use the Hardy-Littlewood circle method, in the form developed by Heath-Brown in 1996, to investig...
We use the Hardy-Littlewood circle method, in the form developed by Heath-Brown in 1996, to investig...
AbstractThe author determines all pure cubic fields Q(n3) whose class numbers are multiples of three
AbstractWe provide an efficient reduction for counting the number of zeros of the so-called general ...
AbstractThis paper contributes to the classical problem of the determination of the zeros of a cubic...
AbstractLet N be the number of solutions of the equationx1m1+⋯+xnmn=ax1⋯xn over the finite field Fq=...
Denote by R(F,G) the resultant of two binary forms F,G. Let S = {p1,..., pt} be a finite, possibly e...
Let Ms, be the number of solutions of the equation X13+ X23+ … + Xs3=0 in the finite field GF(...
AbstractLet Ms, be the number of solutions of the equation X13 + X23+ … + Xs3=0 in the finite field ...
AbstractWe extend to finite fields in general the results proved, in a recent paper (J. Number Theor...
AbstractLet F be a finite field with q=pf elements, where p is a prime. Let N be the number of solut...
AbstractLet α,β∈Fqt∗ and let Nt(α,β) denote the number of solutions (x,y)∈Fqt∗×Fqt∗ of the equation ...
AbstractLet F be a finite field with q=pf elements, where p is a prime number. Let N(n) be the numbe...
AbstractLet f be a polynomial over finite field Fq with q elements and let N(f=0) denote the number ...
We obtain an explicit combinatorial formula for the number of solutions (x1, ..., xr) ∈ (Fpab )r to ...
We use the Hardy-Littlewood circle method, in the form developed by Heath-Brown in 1996, to investig...
We use the Hardy-Littlewood circle method, in the form developed by Heath-Brown in 1996, to investig...
AbstractThe author determines all pure cubic fields Q(n3) whose class numbers are multiples of three
AbstractWe provide an efficient reduction for counting the number of zeros of the so-called general ...
AbstractThis paper contributes to the classical problem of the determination of the zeros of a cubic...
AbstractLet N be the number of solutions of the equationx1m1+⋯+xnmn=ax1⋯xn over the finite field Fq=...
Denote by R(F,G) the resultant of two binary forms F,G. Let S = {p1,..., pt} be a finite, possibly e...