相关论文: Numerical evidence in favor of the Arenstorf formu…
We generalize the Poisson limit theorem to binary functions of random objects whose law is invariant under the action of an amenable group. Examples include stationary random fields, exchangeable sequences, and exchangeable graphs. A…
Let $\Omega(n)$ denote the number of prime factors of a positive integer $n$ counted with multiplicities. We show that for any bounded functions $a,b\colon\mathbb{N}\to\mathbb{C}$, $$\frac{1}{\log{N}}\sum_{n=1}^N…
Wolstenholme's type summations involve certain powers of all residues $k$ modulo some prime number $p$. We first consider the sums of double or triple products of certain powers of all residues, e.g., the sums of the terms $(a+k)^m(b+k)^n$…
Let $\lambda$ be the Liouville function, defined as $\lambda(n) := (-1)^{\Omega(n)}$ where $\Omega(n)$ is the number of prime factors of $n$ with multiplicity. In 2021, Helfgott and Radziwi{\l}{\l} proved that $$\sum_{n\leq x} \frac{1}{n}…
For a given intuitionistic propositional formula A and a propositional variable x occurring in it, define the infinite sequence of formulae { A \_i | i$\ge$1} by letting A\_1 be A and A\_{i+1} be A(A\_i/x). Ruitenburg's Theorem [8] says…
Given a prime $p\geq 5$, we reduce modulo p a convolution of order p-1 of powers of two weighted Bernoulli numbers with Bernoulli numbers in terms of harmonic numbers and generalized harmonic numbers. Our proof is based on studying the…
Let $N$ denote a sufficiently large even integer and $x$ denote a sufficiently large integer, we define $D_{1,2}(N)$ as the number of primes $p$ that such that $N - p$ has at most 2 prime factors. In this paper, we show that $D_{1,2}(N)…
Recently a new type of central limit theorem for belief functions was given in Epstein et al. [9]. In this paper, we generalize the central limit theorem in Epstein et al. [9] to accommodate general bounded random variables. These results…
For $p$ being a large prime number, and $A \subset \mathbb{F}_p$ we prove the following: $(i)$ If $A(A+A)$ does not cover all nonzero residues in $\mathbb{F}_p$, then $|A| < p/8 + o(p)$. $(ii)$ If $A$ is both sum-free and satisfies $A =…
The goal of this note is to provide an alternative proof of Theorem 1.1 (i) in [4], that is, if $n\geq 2$ and $M^{\alpha}$ is bounded on $L^{p}(\mathbb{R}^{n})$ for some $\alpha\in \mathbb{C}$ and $p\geq 2$, then we have \begin{align*}…
Let P be the set of all primes and P_2=P\cup{p_1p_2: p_1,p_2\in P}$. We prove that the sumset 2^P+P_2={2^p+q: p\in P, q\in P_2} has a positive lower density.
We present a formal verification of Wolstenholme's theorem -- $\binom{2p}{p} \equiv 2 \pmod{p^3}$ for prime $p \geq 5$ -- in Lean~4 with Mathlib. The proof proceeds by expanding the shifted factorial product $\prod_{k=1}^{p-1}(p+k)$ to…
For $p\ge 2$, and $\lambda>\max\{n|\tfrac 1p-\tfrac 12|-\tfrac12, 0\}$, we prove the pointwise convergence of cone multipliers, i.e. $$ \lim_{t\to\infty}T_t^\lambda(f)\to f \text{ a.e.},$$ where $f\in L^p(\mathbb R^n)$ satisfies $supp\…
We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs.…
The classical Cauchy-Davenport theorem implies the lower bound n+1 for the number of distinct subsums that can be formed from a sequence of n elements of the cyclic group Z_p (when p is prime and n<p). We generalize this theorem to a…
A prime number $p$ is said to be a Wolstenholme prime if it satisfies the congruence ${2p-1\choose p-1} \equiv 1 \,\,(\bmod{\,\,p^4})$. For such a prime $p$, we establish the expression for ${2p-1\choose p-1}\,\,(\bmod{\,\,p^8})$ given in…
We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.
Let P be a set of points and $L$ a set of lines in (F_p)^2, with |P|,|L|\leq N and N<p. We show that P and L generate no more than C N^(3/2 - 1/806 + o(1)) incidences for some absolute constant C. This improves by an order of magnitude on…
In 1862 Wolstenholme proved that for any prime $p\ge 5$ the numerator of the fraction $$ 1+\frac 12 +\frac 13+...+\frac{1}{p-1} $$ written in reduced form is divisible by $p^2$, $(2)$ and the numerator of the fraction $$ 1+\frac{1}{2^2}…
We show that as soon as $h\to \infty$ with $X \to \infty$, almost all intervals $(x-h\log X, x]$ with $x \in (X/2, X]$ contain a product of at most two primes. In the proof we use Richert's weighted sieve, with the arithmetic information…