相关论文: On the Gaps between Two Consecutive Prime Numbers

For $p\geq 1$ one can define a generalization of the unknotting number $tu_p$ called the $p$th untwisting number which counts the number of null-homologous twists on at most $2p$ strands required to convert the knot to the unknot. We show…

We derive heuristically approximate formulas for the negative $k$--moments $M_{-k}(x)$ of the gaps between consecutive primes$<x $ represented directly by $\pi(x)$ --- the number of primes up to $x$. In particular we propose an analytical…

We examine the prime gaps using a statistical approach. It is first shown that the Andrica's conjecture is true for half or more cases. Using the arguments of averages, it is further shown that Andrica's conjecture is true. We further…

Let $p$ be a prime and let $x$ be a $p$-adic integer. We provide two supercongruences for truncated series of the form $$\sum_{k=1}^{p-1} \frac{(x)_k}{(1)_k}\cdot \frac{1}{k}\sum_{1\le j_1\le\cdots\le j_r\le k}\frac{1}{j_1^{}\cdots…

Let $(F_n)$ be the sequence of Fibonacci numbers and, for each positive integer $k$, let $\mathcal{P}_k$ be the set of primes $p$ such that $\gcd(p - 1, F_{p - 1}) = k$. We prove that the relative density $\text{r}(\mathcal{P}_k)$ of…

Based on symbolic dynamics methods, we show the primes gap pattern could be described by the chaos orbit of Logistic mapping X(k+1)=1-uX(k)^2, u=1.5437. If so, there will be arbitrarily many twin primes.

This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…

Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…

Given a complex number $c$, define the divisor function $\sigma_c:\mathbb N\to\mathbb C$ by $\sigma_c(n)=\sum_{d\mid n}d^c$. In this paper, we look at $\overline{\sigma_{-r}(\mathbb N)}$, the topological closures of the image of…

Legendre's conjecture states that there exists a prime between $n^2$ and $(n+1)^2$, for every positive integer $n$. Here I prove that for sufficiently large $n$, there is a prime number between $n^2$ and $(n+1)^2$. The proof relies on the…

We obtain the general k-correlations for a short divisor sum related to primes.

Let $p\geq 3$ be a prime and $n\geq 1$ be an integer. Let $K\subseteq {\mathbb{F}_p}$ denote a fixed subset with $0\in K$. Let $A\subseteq ({\mathbb{F}_p})^n$ be an arbitrary subset such that $$\{…

On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.

We improve some results on the size of the greatest prime factor of integers of the form ab+1, where a and b belong to finite sets of integers with rather large density.

We prove an upper bound for the exponential sum associated to a localized $k-$divisor function, i.e., the counting function of the number of ways to write a positive integer $n$ as a product of $k\ge 2$ positive integers, each of them…

We report on the results of a computer search for primes $p$ which divide an Harmonic number $H_{\lfloor p/N \rfloor}$ with small $N > 1$.

We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.

Professor Tibor \v{S}al\'at, at one of his seminars at Comenius University, Bratislava, asked to study the influence of gaps of an integer sequence A={a_1<a_2<...<a_n<...} on its exponent of convergence. The exponent of convergence of A…

The purpose of this note is to obtain some congruences modulo a power of a prime $p$ involving the truncated hypergeometric series $$\sum_{k=1}^{p-1} {(x)_k(1-x)_k\over (1)_k^2}\cdot{1\over k^a}$$ for $a=1$ and $a=2$. In the last section,…

The divisor function $\sigma(n)$ sums the divisors of $n$. We call $n$ abundant when $\sigma(n) - n > n$ and perfect when $\sigma(n) - n = n$. I recently introduced the recursive divisor function $a(n)$, the recursive analog of the divisor…