Related papers: The great trinomial hunt

Given a polynomial with integral coefficients, one can inquire about the possible residues it can take in its image modulo a prime $p$. The sum over the distinct residues can sometimes be computed independent of the prime $p$; for example,…

Searching for mathematical results remains difficult: most existing tools retrieve entire papers, while mathematicians and theorem-proving agents often seek a specific theorem, lemma, or proposition that answers a query. While semantic…

Prime number multiplet classifications and patterns are extended to negative integers. The extension from prime numbers to single prime powers is also studied. Prime number septets at equal distance are given. It is also shown that each…

This paper presents the Quanta Prime Sequence (QPS) and its foundational theorem, showcasing a unique class of polynomials with substantial implications. The study uncovers profound connections between Quanta Prime numbers and essential…

Comparisons of arithmetic and geometric monodromy groups coupled with the Chebotarev density theorem enable to obtain families of trinomials defined over finite fields of even characteristic with high differential uniformity when the base…

Three-dimensional random tensor models are a natural generalization of the celebrated matrix models. The associated tensor graphs, or 3D maps, can be classified with respect to a particular integer or half-integer, the degree of the…

A Wilson prime is a prime p such that (p-1)! = -1 mod p^2. We report on a search for Wilson primes up to 2 * 10^13, and describe several new algorithms that were used in the search. In particular we give the first known algorithm that…

In this paper we introduce a simple method of searching for the prime pairs in the famous Goldbach Conjecture. The method, which is based on certain integer identities as well as an observation related to the remainder property, enables us…

In the proposed matrix primes, through which one can readily generate a sequence of primes. The paper also proposes a number of theorems proved by which an infinite number of prime numbers twins

Natural numbers which are nontrivial multiples of some permutation of their base-$b$ digit representations are called permutiples. Specific cases include numbers which are multiples of cyclic permutations (cyclic numbers) and reversals of…

We report extensive computational evidence that Gauss period equations are minimal discriminant polynomials for primitive elements representing Abelian (cyclic) polynomials of prime degrees $p$. By computing 200 period equations up to…

We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…

We describe the images of multilinear polynomials of arbitrary degree evaluated on the $3\times 3$ upper triangular matrix algebra over an infinite field.

Several aspects of the motivation for particle dark matter search are introduced. The experimental principles and present state of the most important experiments are presented. Direct searches for WIMPs are explained in some detail,…

Modulo a prime number, we define semi-primitive roots as the square of primitive roots. We present a method for calculating primitive roots from quadratic residues, including semi-primitive roots. We then present progressions that generate…

In this expository paper we describe four primality tests. The first test is very efficient, but is only capable of proving that a given number is either composite or 'very probably' prime. The second test is a deterministic polynomial time…

We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…

We extend the necessity part of Lucas Lehmer iteration for testing Mersenne prime to all base and uniformly for both generalized Mersenne and Wagstaff numbers(the later correspond to negative base). The role of the quadratic iteration $x…

We provide an explicit and algorithmic version of a theorem of Momose classifying isogenies of prime degree of elliptic curves over number fields, which we implement in Sage and PARI/GP. Combining this algorithm with recent work of…

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…