Related papers: Recurrence Divisibility Tests

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

The issue addressed in this paper is that of testing for common breaks across or within equations of a multivariate system. Our framework is very general and allows integrated regressors and trends as well as stationary regressors. The null…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

We provide new, elementary proofs that Robin's inequality and the Lagarias inequality hold for almost every number, including all numbers not divisible by one of the prime numbers $2$, $3$, $5$; all primorials; given $k$ a natural number,…

We establish necessary and sufficient conditions for a polynomial to be divisible by a cyclotomic polynomials and derive new formulas involving Ramanujan sums as an application of our results. Additionally, we provide new insights into the…

We give some results and conjectures about recurrence relations for certain sequences of binomial sums.

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

Let $n$ be a positive integer and $f(x) := x^{2^n}+1$. In this paper, we study orders of primes dividing products of the form $P_{m,n}:=f(1)f(2)\cdots f(m)$. We prove that if $m > \max\{10^{12},4^{n+1}\}$, then there exists a prime divisor…

Statistical distribution of the primes in an arithmetic progression is considered. The estimation of prime numbers is given and combinatorial methods are used to calculate the twin primes on the available interval. The distribution and…

We continue our recent work on averages for ternary additive problems with powers of prime numbers.

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

We consider the capability of $p$-groups of class two and odd prime exponent. The question of capability is shown to be equivalent to a statement about vector spaces and linear transformations, and using the equivalence we give proofs of…

We use Experimental Mathematics and Symbolic Computation (with Maple), to search for lots and lots of Perrin- and Lucas- style primality tests, and try to sort the wheat from the chaff. More impressively, we find quite a few such primality…

Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…

We explicitly describe the splitting of odd integral primes in the radical extension $\mathbb{Q}(\sqrt[n]{a})$, where $x^n-a$ is an irreducible polynomial in $\mathbb{Z}[x]$. Our motivation is to classify common index divisors, the primes…

The main result is a generalization of Keller's recursion equation for finding a prime number given the previous primes. We also examine the convergence of the limit in Keller's equation and the convergence of the limit in the general…

For large classes of group testing problems, we derive lower bounds for the probability that all significant items are uniquely identified using specially constructed random designs. These bounds allow us to optimize parameters of the…

We investigate replicable learning algorithms. Ideally, we would like to design algorithms that output the same canonical model over multiple runs, even when different runs observe a different set of samples from the unknown data…

Reliable probabilistic primality tests are fundamental in public-key cryptography. In adversarial scenarios, a composite with a high probability of passing a specific primality test could be chosen. In such cases, we need worst-case error…