相关论文: An Improvement on Olson's Constant for Z_p+Z_p

We show that for every $0 < \epsilon \leq 1$ and integer $k\geq 1$, there exists an integer $n = n(\epsilon,k)$ so that for all primes $p$, and integers $0 \leq a \leq p-1$, there exist integers $1 \leq x_1 < ... < x_n \leq p^\epsilon$ such…

Let $E$ be an elliptic curve defined over ${\mathbb Q}$. For a prime $p$ of good reduction for $E$, denote by $e_p$ the exponent of the reduction of $E$ modulo $p$. Under GRH, we prove that there is a constant $C_E\in (0, 1)$ such that $$…

We give a lower bound for Wiener norm of characteristic function of subsets A from Z_p, p is a prime number, in the situation when exp((log p/log log p)^{1/3}) \le |A| \le p/3.

This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result…

Let $N$ and $p$ be prime numbers with $p \geq 5$ such that $p || (N + 1)$. In a previous paper, we showed that there is a cuspform $f$ of weight 2 and level $\Gamma_0(N^2)$ whose $\ell$-th Fourier coefficient is congruent to $\ell + 1$…

Typically, one expects that there are around x\prod_{p\not\in P, p <= x} (1-1/p) integers up to x, all of whose prime factors come from the set P. Of course for some choices of P one may get rather more integers, and for some choices of P…

Let $f(n)=\min_{p} |n-p|$, where $p$ is a prime. We show that there is a positive constant $\delta$ such that for any large integer $N$ there exist two positive integers $n_1$ and $n_2$ such that $N=n_1 + n_2$ and $f(n_i)\gg \ln N (\ln\ln…

A group is called capable if it is a central factor group. For each prime $p$ and positive integer $c$, we prove the existence of a capable $p$-group of class $c$ minimally generated by an element of order $p$ and an element of order…

For a nonnegative integer $p$, the $p$-numerical semigroup $S_p$ is defined as the set of integers whose nonnegative integral linear combinations of given positive integers $a_1,a_2,\dots,a_\kappa$ with $\gcd(a_1,a_2,\dots,a_\kappa)=1$ are…

We prove that a suitably adjusted version of Peter Jones' formula for interpolation by bounded holomorphic functions gives a sharp upper bound for what is known as the constant of interpolation. We show how this leads to precise and…

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

Three mathematical constants bear the name of the venerable Leonhard Euler: Euler's number, $e=2.718281\ldots$; the Euler-Mascheroni constant, $\gamma=0.577216\ldots$; and the Euler-Gompertz constant, $\delta=0.596347\ldots$. In the present…

Over the years various errors have been identified in the 1980 paper of James on the groups of order $p^6$, where $p$ is an odd prime. Here we summarise them.

We showed that the prime gap for a prime number p is less than or equal to the prime count of the prime number.

Let $u\in W^{2,p}_0$, $1\le p\le \infty$ be a solution of the Poisson equation $\Delta u = h$, $h\in L^p$, in the unit disk. It is proved that $\|\nabla u\|_{L^p} \le a_p\|h\|_{L^p}$ with sharp constant $a_p$ for $p=1$ and $p=\infty$ and…

Let $P(X)\in\mathbb{Z}[X]$ be an irreducible, monic, quartic polynomial with cyclic or dihedral Galois group. We prove that there exists a constant $c_P>0$ such that for a positive proportion of integers $n$, $P(n)$ has a prime factor $\ge…

Suppose that $y>0$, $0\leq\alpha<2\pi$, and $0<K<1$. Let $P^+$ be the set of primes $p$ such that $\cos(y\ln p+\alpha)>K$ and $P^-$ the set of primes $p$ such that $\cos(y\ln p+\alpha)<-K$. In this paper, we prove $\sum_{p\in…

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

This note presents an upper bound for the least prime primitive roots $g^*(p)$ modulo $p$, a large prime. The current literature has several estimates of the least prime primitive root $g^*(p)$ modulo a prime $p\geq 2$ such as $g^*(p)\ll…

Consider averages along the prime integers $ \mathbb P $ given by \begin{equation*} \mathcal{A}_N f (x) = N ^{-1} \sum_{ p \in \mathbb P \;:\; p\leq N} (\log p) f (x-p). \end{equation*} These averages satisfy a uniform scale-free $ \ell…