Consider the linear congruence equation $x_1+...+x_k\equiv b(mod{n}^s)$ for $b\in \mathbb{Z}$, $n,s\in \mathbb{N}$. Let ${(a,b)}_s$ denote the generalized gcd of $a$ and $b$ which is the largest $l^s$ with $l\in \mathbb{N}$ dividing $a$ and $b$ simultaneously. Let $d_1,...,d_{\tau \left(n\right)}$ be all positive divisors of $n$. For each $d_j\mid n$, define ${𝒞}_{j,s}\left(n\right)=\{1\le x\le n^s:{(x,n^s)}_s=d_j^s\}$. K. Bibak et al. (2016) gave a formula using Ramanujan sums for the number of solutions of the above congruence equation with some gcd restrictions on $x_i$. We generalize their result with generalized gcd restrictions on $x_i$ and prove that for the above linear congruence, the number of solutions...

For a prime $p$ and positive integers $\ell \<k\<h\<p$ with $d=(h,k,\ell ,p-1)$, we show that $M$, the number of simultaneous solutions $x,y,z,w$ in ${\mathbb{Z}}_p^{*}$ to $x^h+y^h=z^h+w^h$, $x^k+y^k=z^k+w^k$, $x^{\ell }+y^{\ell }=z^{\ell }+w^{\ell }$, satisfies$${\displaystyle M\le 3d^2{(p-1)}^2+25hk\ell (p-1).}$$When $hk\ell =o\left(p{d}^2\right)$ we obtain a precise asymptotic count on $M$. This leads to the new twisted exponential sum bound$${\displaystyle \left|\sum _{x=1}^{p-1}\chi \left(x\right)e^{2\pi if\left(x\right)/p}\right|\le 3^{\frac{1}{4}}{d}^{\frac{1}{2}}{p}^{\frac{7}{8}}+\sqrt{5}{\left(hk\ell \right)}^{\frac{1}{4}}{p}^{\frac{5}{8}},}$$for trinomials $f=a{x}^h+b{x}^k+c{x}^{\ell }$, and to results on the average size of such sums.

We shall describe how to construct a fundamental solution for the Pell equation $x^2-m{y}^2=1$ over finite fields of characteristic $p\ne 2$. Especially, a complete description of the structure of these fundamental solutions will be given using Chebyshev polynomials. Furthermore, we shall describe the structure of the solutions of the general Pell equation $x^2-m{y}^2=n$.

We address three questions posed by K. Bibak (2020), and generalize some results of K. Bibak, D. N. Lehmer and K. G. Ramanathan on solutions of linear congruences ${\sum }_{i=1}^k{a}_i{x}_i\equiv b(modn)$. In particular, we obtain explicit expressions for the number of solutions, where $x_i$’s are squares modulo $n$. In addition, we obtain expressions for the number of solutions with order restrictions $x_1\ge \cdots \ge x_k$ or with strict order restrictions $x_1>\cdots >x_k$ in some special cases. In these results, the expressions for the number of solutions involve Ramanujan...

For every finite Abelian group Γ and for all $g,a₁,...,a_k\in \Gamma$, if there exists a solution of the equation ${\sum }_{i=1}^k{a}_i{x}_i=g$ in non-negative integers $x_i\le b_i$, where $b_i$ are positive integers, then the number of such solutions is estimated from below in the best possible way.