Related papers: Extending Babbage's (Non-)Primality Tests

Proposed derivations of the Born rule for Everettian theory are controversial. I argue that they are unnecessary but may provide justification for a simplified version of the Principal Principle. It's also unnecessary to replace Everett's…

The designation ``Bernstein-von Mises theorem'' is apparently due to Lucien Le Cam. Roughly, the assertion of this theorem states that the posterior distribution of a parameter, conditioned on a large sample, is approximately normal,…

The multinomial model is one of the simplest statistical models. When constraints are placed on the possible values for the probabilities, however, it becomes much more difficult to deal with. Model checking and checking for prior-data…

In this paper we obtained an original integer sequence based on the properties of the multinomial coefficient. We investigated a property of the sequence that shows connection with a primality testing. For any prime n the n-th term in the…

This work has been prompted by the surprising lack of mathematical coherence in the common usage of some of the fundamental entities in the theory of probability, with an inherent risk of contradiction. While disentangling the intricacies,…

In 1982, Courcelle and Franchi-Zannettacci showed that the equivalence problem of separated non-nested attribute systems can be reduced to the equivalence problem of total deterministic separated basic macro tree transducers. They also gave…

We prove a $q$-analog of a classical binomial congruence due to Ljunggren which states that \[ \binom{a p}{b p} \equiv \binom{a}{b} \] modulo $p^3$ for primes $p\ge5$. This congruence subsumes and builds on earlier congruences by Babbage,…

Starting from the Riemann-Liouville derivative, many authors have built their own notion of fractional derivative in order to avoid some classical difficulties like a non zero derivative for a constant function or a rather complicated…

Let $\Omega(n)$ denote the number of prime factors of $n$. We show that for any bounded $f\colon\mathbb{N}\to\mathbb{C}$ one has \[ \frac{1}{N}\sum_{n=1}^N\, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N\, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1).…

We address the Uniform Boundedness Conjecture of Morton and Silverman in the case of unicritical polynomials, assuming a generalization of the $abc$-conjecture. For unicritical polynomials of degree at least five, we require only the…

In a recent article entitled "A simple explanation of the quantum violation of a fundamental inequality," Cabello proposes a condition on a class of probabilistic models that, he claims, gives the same bound on contextuality for the KCBS…

We combine transcendental methods and the modular approaches to the $ABC$ conjecture to show that the largest prime factor of $n^2+1$ is at least of size $(\log_2 n)^2/\log_3n$ where $\log_k$ is the $k$-th iterate of the logarithm. This…

Alpoge and Granville (separately) gave novel proofs that the primes are infinite that use Ramsey Theory. In particular, they use Van der Waerden's Theorem and some number theory. We prove the primes are infinite using an easier theorem from…

The probabilistic rule that links the formalism of Quantum Mechanics (QM) to the real world was stated by Born in 1926. Since then, there were many attempts to derive the Born postulate as a theorem, Gleason's being the most prominent. The…

There are many tests for determining the convergence or divergence of series. The test of Raabe and the test of Betrand are relatively unknown and do not appear in most classical courses of analysis. Also, the link between these tests and…

An alternative form of Fermats equation[1] is proposed. It represents a portion of the identity that includes three terms of Fermats original equation. This alternative form permits an elementary and compact proof of the first case of…

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…

In a 2006 paper, Damg{\aa}rd and Frandsen designed a faster version of the Quadratic Frobenius Test. This test assumes the Extended Riemann Hypothesis in order to find small nonresidues, which allow construction of quadratic extensions with…

We introduce a simple diagnostic test for assessing the overall or partial goodness of fit of a linear causal model with errors being independent of the covariates. In particular, we consider situations where hidden confounding is…

In this note, we are going to introduce some recurrence divisibility tests for all primes except than 2 and 5.