In this report, prepared specially for the program of the XXVième Journées Arithmétiques, we describe how, in joint work with K. Soundararajan and Antal Balog, we have developed the notion of “pretentiousness” to help us better understand several key questions in analytic number theory.
We describe a primality test for with an odd prime p and a positive integer n, which are a particular type of generalized Fermat numbers. We also present special primality criteria for all odd prime numbers p not exceeding 19. All these primality tests run in deterministic polynomial time in the input size log₂M. A special 2pth power reciprocity law is used to deduce our result.
The primality of numbers, or of a number constellation, will be determined from residue solutions in the simultaneous congruence equations for binomial coefficients found in Pascal’s triangle. A prime constellation is a set of integers containing all prime numbers. By analyzing these congruences, we can verify the primality of any number. We present different arrangements of binomial coefficient elements for Pascal’s triangle, such as by the row shift method of Mann and Shanks and especially by...
Let be a linear integer recurrent sequence of order , and define as the set of primes that divide at least one term of . We give a heuristic approach to the problem whether has a natural density, and prove that part of our heuristics is correct. Under the assumption of a generalization of Artin’s primitive root conjecture, we find that has positive lower density for “generic” sequences . Some numerical examples are included.
We solve a 1985 challenge problem posed by Lagarias [5] by determining, under GRH, the density of the set of prime numbers that occur as divisor of some term of the sequence defined by the linear recurrence and the initial values and . This is the first example of a ænon-torsionÆ second order recurrent sequence with irreducible recurrence relation for which we can determine the associated density of prime divisors.
Representation of a non zero integer as a signed product of primes is unique similarly to its representations in various types of positional notations [4], [3]. The study focuses on counting the prime factors of integers in the form of sums or differences of two equal powers (thus being represented by 1 and a series of zeroes in respective digital bases). Although the introduced theorems are not particularly important, they provide a couple of shortcuts useful for integer factorization, which could...
Let be an odd prime, be a primitive root modulo and with . In 2007, R. Queme raised the question whether the -rank ( an odd prime ) of the ideal class group of the -th cyclotomic field is equal to the degree of the greatest common divisor over the finite field of and Kummer’s polynomial . In this paper, we shall give the complete answer for this question enumerating a counter-example.