Related papers: Extending Babbage's (Non-)Primality Tests
In this paper, we study the properties of Carmichael numbers, false positives to several primality tests. We provide a classification for Carmichael numbers with a proportion of Fermat witnesses of less than 50%, based on if the smallest…
We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…
Testing convergence of infinite series is an important part of mathematics. A very basic test of convergence is to upper-bound a given series with a known series, term by term. In $19^{th}$ century, Kummer proposed a test of convergence for…
The aim of this paper is to compare various criteria leading to the central limit theorem and the weak invariance principle. These criteria are the martingale-coboundary decomposition developed by Gordin in Dokl. Akad. Nauk SSSR 188 (1969),…
Jakob Bernoulli, working in the late 17th century, identified a gap in contemporary probability theory. He cautioned that it was inadequate to specify force of proof (probability of provability) for some kinds of uncertain arguments. After…
In this paper, we propose extensions for the classical Kummer test, which is a very far-reaching criterion that provides sufficient and necessary conditions for convergence and divergence of series of positive terms. Furthermore, we present…
The Frobenius primality test is based on the properties of the Frobenius automorphism of the quadratic extension of the residue field. Although it is probabilistic, we show that is "very rarely wrong". To date there are no counterexamples…
Our interest is whether two binomial parameters differ, which parameter is larger, and by how much. This apparently simple problem was addressed by Fisher in the 1930's, and has been the subject of many review papers since then. Yet there…
How to form priors that do not seem artificial or arbitrary is a central question in Bayesian statistics. The case of forming a prior on the truth of a proposition for which there is no evidence, and the definte evidence that the event can…
We study new primality tests based on linear recurrent sequences of degree two exploiting a matricial approach. The classical Lucas test arises as a particular case and we see how it can be easily improved. Moreover, this approach shows…
The purpose of this article is to introduce the concept of invariance and its properties. These properties can be used to check the primality of a number. Combining these properties with the Euler theorem, it is possible to generalize this…
We present a new proof of a primality criterion first proved by Emmanuel Vantieghem.
In this paper, we provide a generalization of Proth's theorem for integers of the form $Kp^n+1$. In particular, a primality test that requires only one modular exponentiation similar to that of Fermat's test without the computation of any…
Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…
In 1845, Bertrand conjectured that twice any prime strictly exceeds the next prime. Tchebichef proved Bertrand's postulate in 1850. In 1934, Ishikawa proved a stronger result: the sum of any two consecutive primes strictly exceeds the next…
We show that for any fixed base $a$, a positive proportion of primes have the property that they become composite after altering any one of their digits in the base $a$ expansion; the case $a=2$ was already established by Cohen-Selfridge…
A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…
The classical uncertainty principles deal with functions on abelian groups. In this paper, we discuss the uncertainty principles for finite index subfactors which include the cases for finite groups and finite dimensional Kac algebras. We…
The use of Kolmogorov-Smirnov-type statistics for testing stochastic dominance goes back to McFadden (1989). In this paper we extend the approach of Barret and Donald (2003) to the bivariate case, without the assumption of absolute…
Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…