English
Related papers

Related papers: Evaluating Prime Power Gauss and Jacobi Sums

200 papers

We show that for any mod $2^m$ characters, $\chi_1, \chi_2,$ the complete exponential sum, $$ \sum_{x=1}^{2^m}\chi_1(x) \chi_2(Ax^k+B), $$ has a simple explicit evaluation.

Number Theory · Mathematics 2014-03-13 Vincent Pigno , Chris Pinner , Joe Sheppard

We show that the binomial and related multiplicative character sums $$ \sum_{\stackrel{x=1}{(x,p)=1}}^{p^m} \chi (x^l(Ax^k +B)^w),\hspace{3ex} \sum_{x=1}^{p^m} \chi_1 (x)\chi_2(Ax^k +B), $$ have a simple evaluation for large enough $m$ (for…

Number Theory · Mathematics 2014-10-27 Vincent Pigno , Christopher Pinner

Using properties of Gauss and Jacobi sums, we derive explicit formulas for the number of solutions to a diagonal equation of the form $x_1^{2^m}+\dots+x_n^{2^m}=0$ over a finite field of characteristic $p\equiv\pm 3\pmod{8}$. All of the…

Number Theory · Mathematics 2016-05-13 Ioulia N. Baoulina

We obtain explicit estimates for the mixed character sum $S= S(\chi,g,f,p^m) = \sum_{x=1}^{p^m} \chi (g(x)) e_{p^m}(f(x))$, where $p^m$ is a prime power, $\chi$ is a multiplicative character mod $p^m$ and $f,g$ are rational functions over…

Number Theory · Mathematics 2026-04-06 Todd Cochrane , Andrew Granville

We present an explicit evaluation of the double Gauss sum $\displaystyle G(a,b,c;S;p^n):=\sum_{x,y=0}^{p^n-1} e^{2\pi i S(ax^2+bxy+cy^2)/p^n}$, where $a, b, c$ are integers such that $\gcd(a,b,c)=1$, $p$ is a prime, $n$ is a positive…

Number Theory · Mathematics 2016-09-14 Şaban Alaca , Greg Doyle

For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a computable formula for evaluating the mean square sums $\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for any positive integer $r\geq 3$.…

Number Theory · Mathematics 2023-12-13 Neha Elizabeth Thomas , K Vishnu Namboothiri

Let $R$ be a commutative ring, $f \in R[X_1,\ldots,X_k]$ a multivariate polynomial, and $G$ a finite subgroup of the group of units of $R$ satisfying a certain constraint, which always holds if $R$ is a field. Then, we evaluate $\sum…

Number Theory · Mathematics 2017-05-17 Paolo Leonetti , Andrea Marino

The following congruence for power sums, $S_n(p)$, is well known and has many applications: $1^n+2^n +\dots +p^n \equiv\begin{cases} -1 \text{ mod } p, & \text{ if } \ p-1 \ | \ n; 0 \text{ mod } p, & \text{ if } \ p-1 \ \not| \ n,…

Number Theory · Mathematics 2018-01-08 Nicholas J. Newsome , Maria S. Nogin , Adnan H. Sabuwala

In this paper we have estimated one multi-variable character sum \begin{align*} \sum_{a=2}^{p-2}\sum_{b=1}^{p-1}\sum_{c=2}^{p-2}\sum_{d=1}^{p-1}\left(\frac{a^2-b^2}{p}\right)\left(\frac{b^2-1}{p}\right)…

Number Theory · Mathematics 2021-04-21 Nilanjan Bag , Antonio Rojas-León , Zhang Wenpeng

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

Number Theory · Mathematics 2018-04-05 Kevin Chen , Jianqiang Zhao

Let $p>5$ be a prime. We prove congruences modulo $p^{3-d}$ for sums of the general form $\sum_{k=0}^{(p-3)/2}\binom{2k}{k}t^k/(2k+1)^{d+1}$ and $\sum_{k=1}^{(p-1)/2}\binom{2k}{k}t^k/k^d$ with $d=0,1$. We also consider the special case…

Number Theory · Mathematics 2012-10-09 Khodabakhsh Hessami Pilehrood , Tatiana Hessami Pilehrood , Roberto Tauraso

Let $p$ be an odd prime, Jianqiang Zhao has established a curious congruence, which is $$ \sum_{i+j+k=p \atop i,j,k > 0} \frac{1}{ijk} \equiv -2B_{p-3}\pmod p , $$ where $B_{n}$ denotes the $n$-th Bernoulli number. In this paper, we will…

Number Theory · Mathematics 2025-12-03 Jiaqi Wang , Rong Ma

In this paper we study the sum of powers in the Gaussian integers $\mathbf{G}_k(n):=\sum_{a,b \in [1,n]} (a+b i)^k$. We give an explicit formula for $\mathbf{G}_k(n) \pmod n $ in terms of the prime numbers $p \equiv 3 \pmod 4$ with $p \mid…

Number Theory · Mathematics 2014-02-05 Pedro Fortuny Ayuso , Jose Maria Grau , Antonio Oller-Marcen

In this paper, using combinatorial and analytic methods, we prove an exact calculating formula on the $2m$-th power mean value of the generalized quadratic Gauss sums for $m\geq 2$. This solves a conjecture of He and Zhang [`On the $2k$-th…

Number Theory · Mathematics 2015-02-26 Feng Liu , Quan-Hui Yang

The aim of this paper is to deal with congruences for Jacobi sums of order $2l^{2}$ over a finite field $\mathbb{F}_{q}, q=p^{r}$, $p^{r}\equiv 1\ (mod \ 2l^{2})$, where $l>3$ and $p$ are primes. Further, we also calculate Jacobi sums…

Number Theory · Mathematics 2018-08-15 Md. Helal Ahmed , Jagmohan Tanti

In this paper we prove that for any prime $p\ge 11$ holds $$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} +4p^2\sum_{1\le i<j\le p-1}\frac{1}{ij}\pmod{p^7}. $$ This is a generalization of the famous Wolstenholme's theorem which…

Number Theory · Mathematics 2018-04-10 Romeo Mestrovic

An elementary approach is shown which derives the values of the Gauss sums over $\mathbb F_{p^r}$, $p$ odd, of a cubic character without using Davenport-Hasse's theorem. New links between Gauss sums over different field extensions are shown…

Number Theory · Mathematics 2011-11-22 Michele Elia , Davide Schipani

We estimate double sums $$ S_\chi(a, I, G) = \sum_{x \in I} \sum_{\lambda \in G} \chi(x + a\lambda), \qquad 1\le a < p-1, $$ with a multiplicative character $\chi$ modulo $p$ where $I= \{1,\ldots, H\}$ and $G$ is a subgroup of order $T$ of…

Number Theory · Mathematics 2014-05-21 Mei-Chu Chang , Igor E. Shparlinski

Let $p$ be an odd prime. Define the Gaussian power sum \[ G_n(p)=\sum_{a=1}^{p-1}\sum_{b=1}^{p-1}(a+bi)^n\in\mathbb Z[i]. \] We determine $G_p(p)$ modulo high powers of $p$: if $p\equiv 1\pmod 4$ then $$G_p(p)\equiv p^2(1+i)\pmod{p^3},$$…

General Mathematics · Mathematics 2026-02-04 Nikita Kalinin , Faith Shadow Zottor

In this paper, we study the Jacobi sums over Galois rings of arbitrary characteristics and completely determine their absolute values, which extends the work in \cite{feng1}, where the Jacobi sums over Galois rings with characteristics a…

Information Theory · Computer Science 2020-06-04 Dengming Xu
‹ Prev 1 2 3 10 Next ›