English
Related papers

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

200 papers

We give a new proof of a theorem by P. Mihailescu which states that the equation $x^p-y^q=1$ is unsolvable with $x, y$ integral and $p, q$ odd primes, unless the congruences $p^q \equiv p\pmod{q^2}$ and $q^p\equiv q \pmod{p^2}$ hold.

Number Theory · Mathematics 2020-10-13 Jan-Christoph Schlage-Puchta

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

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

Number Theory · Mathematics 2010-02-25 Li-Lu Zhao , Zhi-Wei Sun

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…

Number Theory · Mathematics 2022-01-25 Shivarajkumar

We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.

Number Theory · Mathematics 2020-07-31 I. E. Shparlinski , C. L. Stewart

The polynomials $d_n(x)$ are defined by \begin{align*} d_n(x) &= \sum_{k=0}^n{n\choose k}{x\choose k}2^k. \end{align*} We prove that, for any prime $p$, the following congruences hold modulo $p$: \begin{align*}…

Number Theory · Mathematics 2016-04-19 Song Guo , Victor J. W. Guo

Let p be an odd prime. Let K_p = \Q(zeta_p) be the p-cyclotomic field. We apply a Kummer and Stickelberger relation of K_p to some singular not primary numbers A of K_p connected to p-class group of K_p and prove they verify the congruence…

Number Theory · Mathematics 2007-05-23 Roland Queme

Let $s$ be a fixed positive integer constant, $\varepsilon$ be a fixed small positive number. Then, provided that a prime $p$ is large enough, we prove that for any set $\{{\mathcal M}\subseteq \mathbb F_p^*$ of size $|{\mathcal M}|=…

Number Theory · Mathematics 2025-09-10 Moubariz Z. Garaev , Julio C. Pardo , Igor E. Shparlinski

A new inequality, $(x)^{p}+(1-x)^{\frac{1}{p}}\leq1$ for $p \geq 1$ and $\frac{1}{2} \geq x \geq 0$ is found and proved. The inequality looks elegant as it integrates two number pairs ($x$ and $1-x$, $p$ and $\frac{1}{p}$) whose summation…

General Mathematics · Mathematics 2021-02-03 Yiguang Liu

We investigate, using the weighted linear sieve, the distribution of almost-primes among the residue classes (mod p) that generate the multiplicative group of reduced residue classes. We are concerned with finding an upper bound for the…

Number Theory · Mathematics 2007-05-23 Greg Martin

In this article explicit formulas for the recurrence equation p_{n+1}(x) = (A_n x + B_n) p_n(x) - C_n p_{n-1}(x) and the derivative rules sigma(x) p'_n(x) = alpha_n p_{n+1}(x) + beta_n p_n(x) + gamma_n p_{n-1}(x) and sigma(x) p'_n(x) =…

Classical Analysis and ODEs · Mathematics 2008-02-03 Wolfram Koepf , Dieter Schmersau

We study the distribution of palindromic numbers (with respect to a fixed base $g\ge 2$) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes $n\le x$ as $x\to\infty$. Our results show…

Number Theory · Mathematics 2007-05-23 William D. Banks , Derrick N. Hart , Mayumi Sakata

In this paper, we consider the existence and multiplicity of normalized solutions for the following $p$-Laplacian critical equation \begin{align*} \left\{\begin{array}{ll} -\Delta_{p}u=\lambda\lvert u\rvert^{p-2}u+\mu\lvert…

Analysis of PDEs · Mathematics 2023-06-13 Shengbing Deng , Qiaoran Wu

We establish $L^p$ error estimates for monotone numerical schemes approximating Hamilton-Jacobi equations on the $d$-dimensional torus. Using the adjoint method, we first prove a $L^1$ error bound of order one for finite-difference and…

Analysis of PDEs · Mathematics 2026-01-01 Alessio Basti , Fabio Camilli

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Number Theory · Mathematics 2015-06-30 Tewodros Amdeberhan , Roberto Tauraso

This monograph considers a few topics in the theory of primitive roots g(p) modulo a prime p>=2. A few estimates of the least primitive roots g(p) and the least prime primitive roots g^*(p) modulo p, a large prime, are determined. One of…

General Mathematics · Mathematics 2015-03-13 N. A. Carella

In this paper the authors consider four questions of primary interest for the representation theory of reductive algebraic groups: (i) Donkin's Tilting Module Conjecture, (ii) the Humphreys-Verma Question, (iii) whether $\operatorname{St}_r…

Representation Theory · Mathematics 2023-07-03 Christopher P. Bendel , Daniel K. Nakano , Cornelius Pillen , Paul Sobaje

We prove sharp asymptotic estimates for the gradient of positive solutions to certain nonlinear $p$-Laplace equations in Euclidean space by showing symmetry and uniqueness of positive solutions to associated limiting problems.

Analysis of PDEs · Mathematics 2024-07-29 Ramya Dutta , Pierre-Damien Thizy

We prove large sieve inequalities with multivariate polynomial moduli and deduce a general Bombieri--Vinogradov type theorem for a class of polynomial moduli having a sufficient number of variables compared to its degree. This sharpens…

Number Theory · Mathematics 2021-10-27 Karin Halupczok , Marc Munsch

We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a…

Logic in Computer Science · Computer Science 2017-10-17 Bartosz Bednarczyk , Witold Charatonik