Related papers: On Primality Tests Grounded on Binomial Coefficien…
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…
We develop a simple $O((\log n)^2)$ test as an extension of Proth's test for the primality for $p2^n+1$, $p>2^n$. This allows for the determination of large, non-Sierpinski primes $p$ and the smallest $n$ such that $p2^n+1$ is prime. If $p$…
We consider expansion and property testing in the language of incidence geometry, covering both simplicial and cubical complexes in any dimension. We develop a general method for passing from an explicit description of the cohomology group,…
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…
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…
We use the arithmetic of the Kummer surface associated to the Jacobian of a hyperelliptic curve to study the primality of integers of the form $4m^2 5^n-1$. We provide an algorithm capable of proving the primality or compositeness of most…
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
Using a probabilistic approach, we derive some interesting combinatorial identities involving gamma and beta functions. These results generalize certain well-known combinatorial identities involving binomial coefficients and special…
We give a first-order definition of key polynomials, we show the links with previous definitions, that it is relevant to study key degrees, and to use a kind of valuations that we call partially multiplicative. We also prove or reprove…
We prove dual theorems to theorems proved by author in \cite {5}. Beginning with Section 10, we introduce and study so-called "twin numbers of the second kind" and a postulate for them. We give two proofs of the infinity of these numbers…
In this paper, we present several new congruences on the $q$-trinomial coefficients introduced by Andrews and Baxter. A new congruence on sums of central $q$-binomial coefficients is also established.
Starting with a novel definition of divided differences, this essay derives and discusses the basic properties of, and facts about, (univariate) divided differences.
We initiate the study of the cohomology of (strict polynomial) bifunctors by introducing the foundational formalism, establishing numerous properties in analogy with the cohomology of functors, and providing computational techniques. Since…
We recall Charles Babbage's 1819 criterion for primality, based on simultaneous congruences for binomial coefficients, and extend it to a least-prime-factor test. We also prove a partial converse of his non-primality test, based on a single…
In this paper we consider the notions of binomial thinning, binomial mixing, their generalizations, certain interplay between them, associated limit theorems and provide various examples.
We give a survey of some known and some new results about factors of different sorts of $q-$Fibonacci numbers.
We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial…
We believe we have made progress in the age-old problem of divisibility rules for integers. Universal divisibility rule is introduced for any divisor in any base number system. The divisibility criterion is written down explicitly as a…
We derive properties of powers of a function satisfying a second-order linear differential equation. In particular we prove that the n-th power of the function satisfies an (n+1)-th order differential equation and give a simple method for…