相关论文: Recurrence Divisibility Tests
We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.
In this paper we study the integrals of fractional parts of given functions, and develop some new tools to understand the behaviour of prime differences. We demonstrate how simply some seemingly difficult conjectures related to prime…
Recently we had derived a new type generalized binomials mixed recurrence for primordial sequence case . Here we report on this new type mixed V and U binomials recurrence in brief.
We provide a way to modify and to extend a previously established inequality by P. Erd\H{o}s, R. Graham and others and to answer a conjecture posed in the nineties by R. Graham, which bears on the lack of divisibility of the central…
There is a probability charge on the power set of the integers that gives probability $1/p$ to every residue class modulo a prime $p$. There exists such a charge that gives probability $w$ to the set of prime numbers iff $w \in [0,1/2]$.…
Monier and Rabin proved that an odd composite can pass the Strong Probable Prime Test for at most $\frac 14$ of the possible bases. In this paper, a probable prime test is developed using quadratic polynomials and the Frobenius…
In this note we prove an inequality involving primes and the product of consecutive primes.
We study an LCM-based analogue of Rowland's GCD-based prime-generating recurrence, introduced by the author in 2008. The multiplicative increments of this sequence are conjectured always to be $1$ or prime, but a complete proof requires a…
Let $Q$ be a set of primes with relative density $\delta$. We count integers in $[1,x]$ with prime factors all in $Q$ that also have a divisor in $(y,2y]$. We establish the order of magnitude for all $\delta \in (0,1]$. This generalizes the…
Lucas-Lehmer test is the current standard algorithm used for testing the primality of Mersenne numbers, but it may have limitations in terms of its efficiency and accuracy. Developing new algorithms or improving upon existing ones could…
In this article, we explore the Riemann zeta function with a perspective on primes and non-trivial zeros. We develop the Golomb's recurrence formula for the $n$th+1 prime, and assuming (RH), we propose an analytical recurrence formula for…
We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…
We obtain a lower bound for \[ \#\{x/2< p_{n}\leq x:\ p_n \equiv\ldots\equiv p_{n+m}\equiv a\text{ (mod $q$)},\ p_{n+m} - p_{n}\leq y\}, \] where $p_{n}$ is the $n^{\text{th}}$ prime.
We investigate strong divisibility sequences and produce lower and upper bounds for the density of integers in the sequence which only have (somewhat) large prime factors. We focus on the special cases of Fibonacci numbers and elliptic…
For the sequence defined by a(n) = a(n-1) + gcd(n, a(n-1)) with a(1) = 7 we prove that a(n) - a(n-1) takes on only 1s and primes, making this recurrence a rare "naturally occurring" generator of primes. Toward a generalization of this…
We consider the integers having the property of reversing when multiplied by a specific integer k. First, we proved that k should be either 1, 4 or 9. Second, we classify these integers as (10, 1)- reverse multiples, (10, 4)- reverse…
A double occurrence word $w$ over a finite alphabet $\Sigma$ is a word in which each alphabet letter appears exactly twice. Such words arise naturally in the study of topology, graph theory, and combinatorics. Recently, double occurrence…
We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like…
This article is meant to provide an additional point of view, applying known knowledge, to supply keys that have a series of non-repeating digits, in a manner that is not usually thought of. Traditionally, prime numbers are used in…
As predictive algorithms grow in popularity, using the same dataset to both train and test a new model has become routine across research, policy, and industry. Sample-splitting attains valid inference on model properties by using separate…