We consider Weil sums of binomials of the form $W_{F,d}\left(a\right)={\sum }_{x\in F}\psi (x^d-ax)$, where F is a finite field, ψ: F → ℂ is the canonical additive character, $gcd(d,|F^{\times }\left|\right)=1$, and $a\in F^{\times }$. If we fix F and d, and examine the values of $W_{F,d}\left(a\right)$ as a runs through $F^{\times }$, we always obtain at least three distinct values unless d is degenerate (a power of the characteristic of F modulo $|F^{\times }|$). Choices of F and d for which we obtain only three values are quite rare and desirable in a wide variety of applications. We show that if F is a field of order 3ⁿ with n...

For any positive integer $k\ge 3$, it is easy to prove that the $k$-polygonal numbers are $a_n\left(k\right)=(2n+n(n-1)(k-2))/2$. The main purpose of this paper is, using the properties of Gauss sums and Dedekind sums, the mean square value theorem of Dirichlet $L$-functions and the analytic methods, to study the computational problem of one kind mean value of Dedekind sums $S(a_n\left(k\right){\overline{a}}_m\left(k\right),p)$ for $k$-polygonal numbers with $1\le m,n\le p-1$, and give an interesting computational formula for it.

Let p be a prime, ℤₚ be the finite field in p elements, k be a positive integer, and A be the multiplicative subgroup of nonzero kth powers in ℤₚ. The goal of this paper is to determine, for a given positive integer s, a value tₛ such that if |A| ≫ tₛ then every element of ℤₚ is a sum of s kth powers. We obtain $t₄=p^{22/39+ϵ}$, $t₅=p^{15/29+ϵ}$ and for s ≥ 6, $tₛ=p^{(9s+45)/(29s+33)+ϵ}$. For s ≥ 24 further improvements are made, such as $t_{32}=p^{5/16+ϵ}$ and $t_{128}=p^{1/4}$.

A positive integer $n$ is called a square-free number if it is not divisible by a perfect square except $1$. Let $p$ be an odd prime. For $n$ with $(n,p)=1$, the smallest positive integer $f$ such that $n^f\equiv 1(modp)$ is called the exponent of $n$ modulo $p$. If the exponent of $n$ modulo $p$ is $p-1$, then $n$ is called a primitive root mod $p$. Let $A\left(n\right)$ be the characteristic function of the square-free primitive roots modulo $p$. In this paper we study the distribution $$\sum _{n\le x}A\left(n\right)A(n+1),$$ and give an asymptotic formula by using properties of character...

We study sums and products in a field. Let $F$ be a field with $\mathrm{ch}\left(F\right)\ne 2$, where $\mathrm{ch}\left(F\right)$ is the characteristic of $F$. For any integer $k\ge 4$, we show that any $x\in F$ can be written as $a_1+\cdots +a_k$ with $a_1,\cdots ,a_k\in F$ and $a_1\cdots a_k=1$, and that for any $\alpha \in F\setminus \left\{0\right\}$ we can write every $x\in F$ as $a_1\cdots a_k$ with $a_1,\cdots ,a_k\in F$ and $a_1+\cdots +a_k=\alpha$. We also prove that for any $x\in F$ and $k\in \{2,3,\cdots \}$ there are $a_1,\cdots ,a_{2k}\in F$ such that $a_1+\cdots +a_{2k}=x=a_1\cdots a_{2k}$.

Let $\Omega \subset {ℂ}^n$ be a bounded, simply connected $ℂ$-convex domain. Let $\alpha \in {\mathbb{Z}}_{+}^n$ and let $f$ be a function on $\Omega$ which is separately $C^{2{\alpha }_j-1}$-smooth with respect to $z_j$ (by which we mean jointly $C^{2{\alpha }_j-1}$-smooth with respect to $\mathrm{Re}{z}_j$, $\mathrm{Im}{z}_j$). If $f$ is $\alpha$-analytic on $\Omega \setminus f^{-1}\left(0\right)$, then $f$ is $\alpha$-analytic on $\Omega$. The result is well-known for the case ${\alpha }_i=1$, $1\le i\le n$, even when $f$ a priori is only known to be continuous.

Let $k$ be a fixed integer. We study the asymptotic formula of $R(H,r,k)$, which is the number of positive integer solutions $1\le x,y,z\le H$ such that the polynomial $x^2+y^2+z^2+k$ is $r$-free. We obtained the asymptotic formula of $R(H,r,k)$ for all $r\ge 2$. Our result is new even in the case $r=2$. We proved that $R(H,2,k)=c_k{H}^3+O\left(H^{9/4+\epsilon }\right)$, where $c_k>0$ is a constant depending on $k$. This improves upon the error term $O\left(H^{7/3+\epsilon }\right)$ obtained by G.-L. Zhou, Y. Ding (2022).

The sequence of balancing numbers $\left(B_n\right)$ is defined by the recurrence relation $B_n=6B_{n-1}-B_{n-2}$ for $n\ge 2$ with initial conditions $B_0=0$ and $B_1=1.$ $B_n$ is called the $n$th balancing number. In this paper, we find all repdigits in the base $b,$ which are sums of four balancing numbers. As a result of our theorem, we state that if $B_n$ is repdigit in the base $b$ and has at least two digits, then $(n,b)=(2,5),(3,6)$. Namely, $B_2=6={\left(11\right)}_5$ and $B_3=35={\left(55\right)}_6.$