English

On a Problem of Mordell with Primitive Roots

Number Theory 2009-12-30 v2

Abstract

We consider the sums of the form S=x=1Nexp((ax+b1g1x+...+brgrx)/p) S=\sum_{x=1}^{N} \exp\big((ax+b_1g_1^x+... +b_rg_r^x)/p \big) , where pp is prime and g1,...,grg_1,..., g_r are primitive roots (modp)\pmod p. An almost forty years old problem of L. J. Mordell asks to find a nontrivial estimate of SS when at least two of the coefficients b1,...,brb_1,...,b_r are not divizible by pp. Here we obtain a nontrivial bound of the average of these sums when g1g_1 runs over all primitive roots (modp)\pmod p.

Keywords

Cite

@article{arxiv.0911.2832,
  title  = {On a Problem of Mordell with Primitive Roots},
  author = {Cristian Cobeli},
  journal= {arXiv preprint arXiv:0911.2832},
  year   = {2009}
}

Comments

7 pages, added detailed proof of Lemma 2