Related papers: Two Digit Theorems

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

The numbers e_p(k,n) defined as min(nu_p(S(k,j)j!): j >= n) appear frequently in algebraic topology. Here S(k,j) is the Stirling number of the second kind, and nu_p(-) the exponent of p. The author and Sun proved that if L is sufficiently…

A set of natural numbers is primitive if no element of the set divides another. Erd\H{o}s conjectured that if S is any primitive set, then \sum_{n\in S} 1/(n log n) \le \sum_{n\in \P} 1/(p log p), where \P denotes the set of primes. In this…

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…

Let $k$ be a given positive odd integer and $p$ an odd prime. In this paper, we shall give a sufficient condition when a prime $p$ divides the order of the groups $K_{2k}(\mathbb{Z}[\zeta_m+\zeta_m^{-1}])$ and $K_{2k}(\mathbb{Z}[\zeta_m])$,…

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…

We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ \epsilon}$, and we give some…

We proved that any even number not less than 6 can be expressed as the sum of two old primes, $2n=p_i+p_j$

For integers x and k, let T(x;2k) denote the number of twin prime pairs (p,p+2k) with a distance 2k<=2x**0.5 and p<=x (not p+2k<=x). Let Tg(x;2x**0.5) denote the average of T(x;2k) for all 2k<=2x**0.5. Logically, T(x;2k) should be a…

We provide an explicit estimate on the least primitive root mod $p^{2}$. We show, in particular, that every prime $p$ has a primitive root mod $p^{2}$ that is less than $p^{0.99}$.

Let $p>1$ be a large prime number, let $q=O(\log\log p)$ and let $1\leq a<q$ be a pair of relatively prime integers. It is proved that there is a prime primitive root $u\ll (\log p)(\log \log p)^5$ such that $u\equiv a\bmod q$ in the prime…

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

Let $p$ be a prime and let $g(p)$ be the least primitive root modulo $p$. We prove that for any $\epsilon>0$ and $p$ large enough the bound \begin{align} g(p)\ll p^{\frac{1}{4\sqrt{e}}+\epsilon} \nonumber \end{align} holds for most prime…

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

In this paper, we use our previous study of the higher order Bernoulli numbers $B_n^{(l)}$ to investigate the $p$-adic properties of the Stirling numbers of the second kind $S(n,k)$. For example, we give a new, greatly simplified proof of…

Let $p\equiv 8\mod 9$ be a prime. In this paper we give a sufficient condition such that at least one of $p$ and $p^2$ is the sum of two rational cubes. This is the first general result on the $8$ case of the so-called Sylvester conjecture.

We use Zagier's one-sentence proof approach to show that a prime number $p$ admits a form $p=a^2+ab+b^2$ for some integers $a$ and $b$ if and only if $p=3$ or $p\equiv 1 \pmod{3}$.

Let $p>3$ be a prime, and let $q_p(2)=(2^{p-1}-1)/p$ be the Fermat quotient of $p$ to base 2. Recently, Z. H. Sun proved that \sum_{k=1}^{p-1}\frac{1}{k\cdot 2^k}\equiv q_p(2)-\frac{p}{2}q_p(2)^2 \pmod{p^2} which is a generalization of a…

This paper presents an analysis of primitive permutation groups of degree $3p$, where $p$ is a prime number, analogous to H. Wielandt's treatment of groups of degree $2p$. It is also intended as an example of the systematic use of…

Let $p>2$ be prime and $g$ a primitive root modulo $p$. We present an argument for the fact that discrete logarithms of the numbers in any arithmetic progression are uniformly distributed in $[1,p]$ and raise some questions on the subject.