English
Related papers

Related papers: Close encounters among the primes

200 papers

We provide a writeup of a resolution of Erd\H{o}s Problem #728; this is the first Erd\H{o}s problem (a problem proposed by Paul Erd\H{o}s which has been collected in the Erd\H{o}s Problems website) regarded as fully resolved autonomously by…

Number Theory · Mathematics 2026-01-27 Nat Sothanaphan

Today, prime numbers attained exceptional situation in the area of numbers theory and cryptography. As we know, the trend for accessing to the largest prime numbers due to using Mersenne theorem, although resulted in vast development of…

Number Theory · Mathematics 2015-04-28 A. Zalnezhad , G. Shabani , H. Zalnezhad , M. Zalnezhad

Order of magnitude reasoning - reasoning by rough comparisons of the sizes of quantities - is often called 'back of the envelope calculation', with the implication that the calculations are quick though approximate. This paper exhibits an…

Artificial Intelligence · Computer Science 2011-05-30 E. Davis

Since its introduction by P.L. Lions in his lectures and seminars at the College de France, see [9], and also the very helpful notes of Cardialaguet [4] on Lions' lectures, the Master Equation has attracted a lot of interest, and various…

Optimization and Control · Mathematics 2015-03-27 Alain Bensoussan , Jens Frehse , Phillip Yam

The way science is currently practiced shows conclusions but hides how they were reached. Researchers work privately, polish their results, publish a finished paper, and defend it. Errors are punished by retraction rather than corrected by…

Digital Libraries · Computer Science 2026-04-14 Sergey V. Samsonau

Given n=p*q with p and q prim and y in Z_{p*q}^*. Shor's Algorithm computes the order r of y, i.e. y^r=1 (mod n). If r=2k is even and y^k \ne -1 (mod n) we can easily compute a non trivial factor of n: gcd(y^k-1,n). In the original paper it…

Quantum Physics · Physics 2007-05-23 Gregor Leander

On the basis of the existing trace distance result, we present a simple and efficient method to tighten the upper bound of the guessing probability. The guessing probability of the final key k can be upper bounded by the guessing…

Quantum Physics · Physics 2020-07-17 Xiang-Bin Wang , Jing-Tao Wang , Ji-Qian Qin , Cong Jiang , Zong-Wen Yu

We give new proofs for the hardness amplification of efficiently samplable predicates and of weakly verifiable puzzles which generalize to new settings. More concretely, in the first part of the paper, we give a new proof of Yao's XOR-Lemma…

Cryptography and Security · Computer Science 2010-12-30 Thomas Holenstein , Grant Schoenebeck

We give yet another example of the usefulness of working with marginals of multivariate Gibbs distributions (Cerquetti, 2013) in deriving Bayesian nonparametric estimators under Gibbs priors in species sampling problems. Here in particular…

Methodology · Statistics 2013-12-23 Annalisa Cerquetti

The Circularity Principle was successfully applied for developing a coinductive proving technique, known as circular coinduction. In this paper, we show that the same principle can be used to develop an inductive proving technique. A main…

Logic in Computer Science · Computer Science 2026-05-26 Dorel Lucanu , Grigore Rosu , Eugen Goriac , Georgiana Caltais

We develop foundations for computing Craig interpolants and similar intermediates of two given formulas with first-order theorem provers that construct clausal tableaux. Provers that can be understood in this way include efficient…

Logic in Computer Science · Computer Science 2018-10-19 Christoph Wernhard

This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…

Number Theory · Mathematics 2023-03-10 Steven Brown

The cyclicity and Koblitz conjectures ask about the distribution of primes of cyclic and prime-order reduction, respectively, for elliptic curves over $\mathbb{Q}$. In 1976, Serre gave a conditional proof of the cyclicity conjecture, but…

Number Theory · Mathematics 2025-06-25 Sung Min Lee , Jacob Mayle , Tian Wang

{\bf In the fourth extended version of this article, we provide a comprehensive historical survey of 200 different proofs of famous Euclid's theorem on the infinitude of prime numbers (300 {\small B.C.}--2022)}. The author is trying to…

History and Overview · Mathematics 2023-07-26 Romeo Meštrović

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

Number Theory · Mathematics 2022-08-17 Michael Drmota , Clemens Müllner , Lukas Spiegelhofer

Under two assumptions, we determine the distribution of the difference between two functions each counting the numbers < x that are in a given arithmetic progression modulo q and the product of two primes. The two assumptions are (i) the…

Number Theory · Mathematics 2012-08-28 Kevin Ford , Jason Sneed

A consequence of Bertrand's postulate, proved by L. Greenfield and S. Greenfield in 1998, assures that the set of integers $\{1,2,\cdots, 2n\}$ can be partitioned into pairs so that the sum of each pair is a prime number for any positive…

Combinatorics · Mathematics 2018-04-20 Hong-Bin Chen , Hung-Lin Fu , Jun-Yi Guo

These lectures discuss recent advances on syzygies on algebraic curves, especially concerning the Green, the Prym-Green and the Green-Lazarsfeld Secant Conjectures. The methods used are largely geometric and variational, with a special…

Algebraic Geometry · Mathematics 2017-04-12 Gavril Farkas

Gaussian approximations are routinely employed in Bayesian statistics to ease inference when the target posterior is intractable. Although these approximations are asymptotically justified by Bernstein-von Mises type results, in practice…

Statistics Theory · Mathematics 2024-04-09 Daniele Durante , Francesco Pozza , Botond Szabo

The $\alpha$-Bernstein operators were initially introduced in the paper by Chen, X., Tan, J., Liu, Z., Xie, J. (2017) titled "Approximation of Functions by a New Family of Generalized Bernstein Operators" (Journal of Mathematical Analysis…

Classical Analysis and ODEs · Mathematics 2025-09-22 Jamshid Saeidian , Bahareh Nouri