English
Related papers

Related papers: Legendre's formula and $p$-adic analysis

200 papers

The Ap\'ery polynomials are given by $$A_n(x)=\sum_{k=0}^n\binom nk^2\binom{n+k}k^2x^k\ \ (n=0,1,2,\ldots).$$ (Those $A_n=A_n(1)$ are Ap\'ery numbers.) Let $p$ be an odd prime. We show that…

Number Theory · Mathematics 2014-04-29 Zhi-Wei Sun

Let $p_{-r}(n)$ denote the $r$-coloured partition function, and $\sigma(n)=\sum_{d|n}d$ denote the sum of positive divisors of $n$. The aim of this note is to prove the following $$…

General Mathematics · Mathematics 2020-08-10 Sumit Kumar Jha

We confirm several conjectures of Sun involving quadratic residues modulo odd primes. For any prime $p\equiv 1\pmod 4$ and integer $a\not\equiv0\pmod p$, we prove that \begin{align*}&(-1)^{|\{1\le k<\frac p4:\ (\frac kp)=-1\}|}\prod_{1\le…

Number Theory · Mathematics 2020-03-13 Fedor Petrov , Zhi-Wei Sun

We investigate the additive theory of the set $S = \{1^c, 2^c, \dots, N^c\}$ when $c$ is a real number. In the language of additive combinatorics, we determine the asymptotic behaviour of the additive energy of $S$. When $c$ is rational,…

Number Theory · Mathematics 2025-12-04 Joseph Harrison

The p-adic formulation of replica symmetry breaking is presented. In this approach ultrametricity is a natural consequence of the basic properties of the p-adic numbers. Many properties can be simply derived in this approach and p-adic…

Disordered Systems and Neural Networks · Physics 2009-10-31 Giorgio Parisi , Nicolas Sourlas

Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…

Discrete Mathematics · Computer Science 2009-03-26 M. Torabi Dashti

We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…

Symbolic Computation · Computer Science 2019-04-22 Jean-Guillaume Dumas

In this paper we study some products related to quadratic residues and quartic residues modulo primes. Let $p$ be an odd prime and let $A$ be any integer. We mainly determine completely the product $$f_p(A):=\prod_{1\le i,j\le(p-1)/2\atop…

Number Theory · Mathematics 2020-09-11 Zhi-Wei Sun

The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…

History and Overview · Mathematics 2017-02-28 Tanay Wakhare

Part I. Some Facts From p-Adic Analysis. Part II. Tables of Integrals.

Mathematical Physics · Physics 2007-05-23 V. S. Vladimirov

In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.

Number Theory · Mathematics 2018-02-13 Shin-ichiro Seki

We improve the classical discrete Hardy inequality for $ 1<p<\infty $ for functions on the natural numbers. For integer values of $ p $ the Hardy weight is an absolutely monotonic function.

Classical Analysis and ODEs · Mathematics 2019-10-09 Florian Fischer , Matthias Keller , Felix Pogorzelski

We express the classical $p$-adic integers $\hat{\mathbb{Z}_p}$, as a metric space, as a final colagebra to a certain endofunctor. We realize the addition and the multiplication on $\hat{\mathbb{Z}_p}$ as the coalgebra maps from…

Number Theory · Mathematics 2015-06-05 Prasit Bhattacharya

The undecidability of the additive theory of primes (with identity) as well as the theory Th(N,+, n -> p\_n), where p\_n denotes the (n+1)-th prime, are open questions. As a possible approach, we extend the latter theory by adding some…

Logic · Mathematics 2007-05-23 Patrick Cegielski , Denis Richard , Maxim Vsemirnov

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

Number Theory · Mathematics 2023-01-10 Arnaud Bodin , Pierre Dèbes , Salah Najib

We consider the class numbers of imaginary quadratic extensions $F(\sqrt{-p})$, for certain primes $p$, of totally real quadratic fields $F$ which have class number one. Using seminal work of Shintani, we obtain two elementary class number…

Number Theory · Mathematics 2023-09-11 Elizabeth Athaide , Emma Cardwell , Christina Thompson

We study a relation between two refinements of the rank one abelian Gross-Stark conjecture: For a suitable abelian extension $H/F$ of number fields, a Gross-Stark unit is defined as a $p$-unit of $H$ satisfying some proporties. Let $\tau…

Number Theory · Mathematics 2017-04-18 Tomokazu Kashio

For a normalized newform $g \in S_{k}(\Gamma_{0}(N))$ with complex multiplication by an imaginary quadratic field $K$, there is a mock modular form $F^{+}$ corresponding to $g$. K. Bringmann et al. modified $F^{+}$ in order to obtain a…

Number Theory · Mathematics 2024-12-18 Ryota Tajima

Let $p>3$ be a prime, and let $d\in\mathbb Z$ with $p\nmid d$. For the determinants $$S_m(d,p)=\det\left[(i^2+dj^2)^{m}\right]_{1\leqslant i,j \leqslant (p-1)/2}\ \ \left(\frac{p-1}2\leqslant m\leqslant p-1\right),$$ Sun recently determined…

Number Theory · Mathematics 2024-04-18 Chen-Kai Ren , Zhi-Wei Sun

Linear forms in logarithms have an important role in the theory of Diophantine equations. In this article, we prove explicit $p$-adic lower bounds for linear forms in $p$-adic logarithms of rational numbers using Pad\'e approximations of…

Number Theory · Mathematics 2022-05-19 Neea Palojärvi , Louna Seppälä
‹ Prev 1 8 9 10 Next ›