Related papers: Legendre's formula and $p$-adic analysis
We provide a necessary and sufficient condition for $n!$ to be a sum of three squares. The condition is based on the binary representation of $n$ and can be expressed by the operation of an automaton.
Given primes $\ell\ne p$, we record here a $p$-adic valued Fourier theory on a local field over $\mathbf{Q}_\ell$, which is developed under the perspective of group schemes. As an application, by substituting rigid analysis for complex…
Write $T(n)$ as the sum of the reciprocals of the primes which divide $n$. Write $H(n) = \prod_{p|n}p/(p-1)$ where the product is over the prime divisors of $n$. We prove new bounds for $T(n)$ and $H(n)$ in terms of the smallest prime…
We introduce a Dirichlet-series framework for studying the asymptotic behavior of generalized factorial functions defined by Legendre-type valuation formulas. Let $K$ be a number field and let $S$ be a finite set of prime ideals. For a…
In this article we deal with the problem of counting the number of pairs of normalized eigenforms $ (f,g) $ of weight $k$ and level $N$ such that $ a_p (f) = a_p (g) $ where $a_p (f) $ denotes the $p-$th Fourier coefficient of $f$. Here $p$…
The classical $n$-variable Kloosterman sums over finite fields are well understood by Deligne's theorem from complex point of view and by Sperber's theorem from $p$-adic point of view. In this paper, we study the complex and $p$-adic…
In this article, we study the Euler's factorial series $F_p(t)=\sum_{n=0}^\infty n!t^n$ in $p$-adic domain under the Generalized Riemann Hypothesis. First, we show that if we consider primes in $k\varphi(m)/(k+1)$ residue classes in the…
In this paper, we study Catalan numbers which can be represented by the p-adic integral on Zp and we investigate some properties and formulae related to Catalan numbers and special numbers.
We develop a theory of $p$-adic continued fractions for a quaternion algebra $B$ over $\mathbb Q$ ramified at a rational prime $p$. Many properties holding in the commutative case can be proven also in this setting. In particular, we focus…
In this article, we consider the weighted partition function $p_f(n)$ given by the generating series $\sum_{n=1}^{\infty} p_f(n)z^n = \prod_{n\in\mathbb{N}^{*}}(1-z^n)^{-f(n)}$, where we restrict the class of weight functions to strongly…
$T$-adic exponential sums associated to a Laurent polynomial $f$ are introduced. They interpolate all classical $p^m$-power order exponential sums associated to $f$. The Hodge bound for the Newton polygon of $L$-functions of $T$-adic…
Mathematicians has been trying to prove the weak Goldbach's conjecture by adding prime numbers, as stated in the conjecture. However, we believe that the solution does not need to be analytically solved. Instead of trying to add prime…
Let n >= 1 and let p be a prime. Let t = 1 - zeta_{p^n}. Expand an integer j in [0,p^n-1], coprime to p, p-adically as j = sum_{s >= 0} a_s p^s. Denote the tensor product over Z_(p) by o . Then the #([0,j] - (p))th Z_(p)[t]-linear…
A classical problem in analytic number theory is to study the distribution of $\alpha p$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is…
Let $p$ be an odd prime and $d = p^{\tau}(p-1)$. In the spirit of Aritn's conjecture, consider the system of two diagonal forms of degree $d$ in $s$ variables given by \begin{equation*}\begin{split} a_1x_1^d + \cdots + a_sx_s^d = 0\\…
Continued fraction expansions provide a well-established bridge between algebraic properties of numbers and combinatorics on words. In this article, we investigate the algebraicity of $p$-adic numbers whose continued fractions arise from…
The explicit formulas of operations, in particular addition and multiplication, of $p $-adic integers are presented. As applications of the results, at first the explicit formulas of operations of Witt vectors with coefficients in…
A method of constructing finite $p$-adic Sylvester expansions for all rationals is presented. This method parallels the classical Fibonacci-Sylvester (greedy) algorithm by iterating a $p$-adic division algorithm. The method extends to…
In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…
We define "splitting functions of level l" for any integer l>0. These functions generalize Dwork's splitting functions : they allow us to represent additive characters of order $p^l$. Then we use these functions to obtain a Stickleberger…