Related papers: Cyclotomy Primality Proofs and their Certificates
In 1904, Dickson [5] stated a very important conjecture. Now people call it Dickson's conjecture. In 1958, Schinzel and Sierpinski [14] generalized Dickson's conjecture to the higher order integral polynomial case. However, they did not…
Robert Denomme and Gordan Savin made a primality test for Fermat numbers 2^(2^k)+1 using elliptic curves. We propose another primality test using elliptic curves for Fermat numbers and also give primality tests for integers of the form…
The primal-dual algorithm recently proposed by Chambolle & Pock (abbreviated as CPA) for structured convex optimization is very efficient and popular. It was shown by Chambolle & Pock in \cite{CP11} and also by Shefi & Teboulle in…
In a former paper it has been shown that the elliptic Gau{\ss} sums, whose use has been proposed in the context of counting points on elliptic curves and primality tests, can be computed by using modular functions. In this work we give…
In this paper, we are testing the symmetry in the distribution of data observed on a random variable. We proposed test statistics using cumulative past and residual extropy of record values based on the characterization developed by Gupta…
In the recent article arXiv:1606.03351, Apagodu and Zeilberger discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the end they…
In this paper, we present a method based on contour integration to investigate a class of cyclotomic parametric Ap\'ery-like series. The general term of such series involves a parametric central binomial coefficient, which is defined via…
Employing the ideas of non-linear preconditioning and testing of the classical proximal point method, we formalise common arguments in convergence rate and convergence proofs of optimisation methods to the verification of a simple…
The strong probable primality test is an important practical tool for discovering prime numbers. Its effectiveness derives from the following fact: for any odd composite number $n$, if a base $a$ is chosen at random, the algorithm is…
A type assignment system for lambda-calculus enjoys the principal typing property if every typable term M has a special typing, called principal, from which all typings for M can be obtained via suitable operations. The existence of…
Many optimization problems of interest are known to be intractable, and while there are often heuristics that are known to work on typical instances, it is usually not easy to determine a posteriori whether the optimal solution was found.…
Let $T$ be a random ergodic pseudometric over $\mathbb R^d$. This setting generalizes the classical \emph{first passage percolation} (FPP) over $\mathbb Z^d$. We provide simple conditions on $T$, the decay of instant one-arms and…
We present knot primality tests that are built from knot Floer homology. The most basic of these is a simply stated and elementary consequence of Heegaard Floer theory: if the two-variable knot Floer polynomial of a knot K is irreducible,…
This note is an observation that the LLL algorithm applied to prime powers can be used to find "good" examples for the ABC and Szpiro conjectures.
This paper introduces the Generalized Fractional Compound Poisson Process (GFCPP), which claims to be a unified fractional version of the compound Poisson process (CPP) that encompasses existing variations as special cases. We derive its…
In this paper we generalize the classical Proth's theorem for integers of the form $N=Kp^n+1$. For these families, we present a primality test whose computational complexity is $\widetilde{O}(\log^2(N))$ and, what is more important, that…
This note presents a formalisation done in Coq of Lucas-Lehmer test and Pocklington certificate for prime numbers. They both are direct consequences of Fermat little theorem. Fermat little theorem is proved using elementary group theory and…
{\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…
In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'ee Poussin's form: $$ \pi(x)=\operatorname{li}(x)+\mathcal O(xe^{-c\sqrt{\log x}}) $$ Instead of performing asymptotic expansion on Chebyshev…
In 1975 James Pickands III showed that the excesses over a high threshold are approximatly Generalized Pareto distributed. Since then, a variety of estimators for the parameters of this cdf have been studied, but always assuming the…