Cargando…
On the Generalization of Lehmer Problem and High-Dimension Kloosterman Sums
For any fixed integer k ≥ 2 and integer r with (r, p) = 1, it is clear that there exist k integers 1 ≤ a (i) ≤ p − 1 (i = 1, 2, …, k) such that a (1) a (2) ⋯ a (k) ≡ r mod p. Let N(k, r; p) denote the number of all (a (1), a (2), ⋯ a (k)) such that a (1) a (2) ⋯ a (k) ≡ r mod p and 2†(a (1) + a (2)...
Autores principales: | Chen, Guohui, Zhang, Han |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4124714/ https://www.ncbi.nlm.nih.gov/pubmed/25133256 http://dx.doi.org/10.1155/2014/726053 |
Ejemplares similares
-
Gauss sums, Kloosterman sums, and monodromy groups (AM-116)
por: Katz, Nicholas M
Publicado: (1988) -
Teaching Ordinal Patterns to a Computer: Efficient Encoding Algorithms Based on the Lehmer Code
por: Berger, Sebastian, et al.
Publicado: (2019) -
Theory of Lehmer transform and its applications in identifying the electroencephalographic signature of major depressive disorder
por: Ataei, Masoud, et al.
Publicado: (2022) -
On the General Dedekind Sums and Two-Term Exponential Sums
por: Zhang, Junli, et al.
Publicado: (2014) -
Spinning Sum Rules for the Dimension-Six SMEFT
por: Remmen, Grant N., et al.
Publicado: (2022)