An average bound for character sums with some counter-dependent recurrence sequences

Sanka Balasuriya*, Arne Winterhof, Igor E. Shparlinski

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

We estimate hybrid sums of multiplicative and additive characters "on average" over all initial values aa(0) = a with the sequences aa(n) over a finite field Fp, where p is prime, defined by a(n) = naa(n - 1) + 1, n = 1, 2,. Various arithmetic properties of such sequences have recently been studied in the literature.

Original languageEnglish
Pages (from-to)1403-1409
Number of pages7
JournalRocky Mountain Journal of Mathematics
Volume39
Issue number5
DOIs
Publication statusPublished - 2009

Fingerprint Dive into the research topics of 'An average bound for character sums with some counter-dependent recurrence sequences'. Together they form a unique fingerprint.

Cite this