Related papers: On the congruence $x^x\equiv \lambda \pmod p$

The polynomials of degree $\frac{p-1}{2}$ of range sum $p$ was determined in {\tt arXiv:2311.06136 [math.NT]} for large enough primes. We extend this result by reducing the lower bound for the primes to $23$ by introducing a new and…

For any positive integer $n$ and variables $a$ and $x$ we define the generalized Legendre polynomial $P_n(a,x)=\sum_{k=0}^n\b ak\b{-1-a}k(\frac{1-x}2)^k$. Let $p$ be an odd prime. In the paper we prove many congruences modulo $p^2$ related…

In the recent article arXiv:1606.03351, Apagodu and Zeilberger discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the end they…

Recently the first author proved a congruence proposed in 2006 by Adamchuk: $\sum_{k=1}^{\lfloor\frac{2p}{3}\rfloor}\binom{2k}{k}\equiv 0\pmod{p^2}$ for any prime $p=1 \pmod{3}$. In this paper, we provide more examples (with proofs) of…

In this paper, we pose lots of challenging conjectures on congruences for the sums involving binomial coefficients and Ap\'ery-like numbers modulo $p^3$, where $p$ is an odd prime.

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

Let $p$ be a prime and let $x$ be a $p$-adic integer. We provide two supercongruences for truncated series of the form $$\sum_{k=1}^{p-1} \frac{(x)_k}{(1)_k}\cdot \frac{1}{k}\sum_{1\le j_1\le\cdots\le j_r\le k}\frac{1}{j_1^{}\cdots…

We give upper and lower bounds for the number of solutions of the equation $p(z)\log|z|+q(z)=0$ with polynomials $p$ and $q$.

In 2017, motivated by a supercongruence conjectured by Kimoto and Wakayama and confirmed by Long, Osburn and Swisher, Z.-W. Sun introduced the sequence of polynomials: $$…

In this paper we deduce some new supercongruences modulo powers of a prime $p>3$. Let $d\in\{0,1,\ldots,(p-1)/2\}$. We show that $$\sum_{k=0}^{(p-1)/2}\frac{\binom{2k}k\binom{2k}{k+d}}{8^k}\equiv 0\ (\mbox{mod}\ p)\ \ \ \mbox{if}\ d\equiv…

Let $A$ be a central division algebra of prime degree $p$ over $\mathbb{Q}$. We obtain subconvex hybrid bounds, uniform in both the eigenvalue and the discriminant, for the sup-norm of Hecke-Maass forms on the compact quotients of…

Let $\varepsilon>0$ be a fixed small constant, ${\mathbb F}_p$ be the finite field of $p$ elements for prime $p$. We consider additive and multiplicative problems in ${\mathbb F}_p$ that involve intervals and arbitrary sets. Representative…

For any irrational real number xi, let lambda(xi) denote the supremum of all real numbers lambda such that, for each sufficiently large X, the inequalities |x_0| < X, |x_0*xi-x_1| < X^{-lambda} and |x_0*xi^2-x_2| < X^{-lambda} admit a…

We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.

In this article, we consider the estimation of exponential sums along the points of the reduction mod $p^{m}$ of a $p$-adic analytic submanifold of $ \mathbb{Z}_{p}^{n}$. More precisely, we extend Igusa's stationary phase method to this…

We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…

We obtain new bounds of exponential sums modulo a prime $p$ with binomials $ax^k + bx^n$. In particular, for $k=1$, we improve the bound of Karatsuba (1967) from $O(n^{1/4} p^{3/4})$ to $O\left(p^{3/4} + n^{1/3}p^{2/3}\right)$ for any $n$,…

Let $p>3$ be a prime and $m,n\in\Bbb Z$ with $p\nmid mn$. Built on the work of Morton, in the paper we prove the uniform congruence: $$&\sum_{x=0}^{p-1}\Big(\frac{x^3+mx+n}p\Big) \equiv {-(-3m)^{\frac{p-1}4} \sum_{k=0}^{p-1}\binom{-\frac…

Let $p$ be a prime. In 1878 \'{E}. Lucas proved that the congruence $$ {p-1\choose k}\equiv (-1)^k\pmod{p}$$ holds for any nonnegative integer $k\in\{0,1,\ldots,p-1\}$. The converse statement was given in Problem 1494 of {\it Mathematics…