Arithmetic Progressions,Prime Numbers,and Squarefree Integers

In this paper we establish the distribution of prime numbers in a given arithmetic progression p l for which ap + b is squarefree.     

On the Representation of Primes by Cubic Polynomials in Two Variables

In an earlier paper (see Proc. London Math. Soc. (3) 84 (2002)257–288) we showed that an irreducible integral binarycubic form f(x, y) attains infinitely many prime values, providingthat it has no fixed prime divisor. We now extend this resultby showing that f(m, n) still attains infinitely many primevalues if m and n are restricted by arbitrary congruence conditions,providing that there is still no fixed prime divisor. Two immediate consequences for the solvability of diagonal cubicDiophantine equations are given. 2000 Mathematics Subject Classification11N32 (primary), 11N36, 11R44 (secondary).     

Finding prime pairs with particular gaps

By a prime gap of size , we mean that there are primes and such that the numbers between and are all composite. It is widely believed that infinitely many prime gaps of size exist for all even integers . However, it had not previously been known whether a prime gap of size existed. The objective of this article was to be the first to find a prime gap of size , by using a systematic method that would also apply to finding prime gaps of any size. By this method, we find prime gaps for all even integers from to , and some beyond. What we find are not necessarily the first occurrences of these gaps, but, being examples, they give an upper bound on the first such occurrences. The prime gaps of size listed in this article were first announced on the Number Theory Listing to the World Wide Web on Tuesday, April 8, 1997. Since then, others, including Sol Weintraub and A.O.L. Atkin, have found prime gaps of size with smaller integers, using more ad hoc methods. At the end of the article, related computations to find prime triples of the form , , and their application to divisibility of binomial coefficients by a square will also be discussed.

     

Matrix analysis for associated consistency in cooperative game theory

Hamiache axiomatized the Shapley value as the unique solution verifying the inessential game property, continuity and associated consistency. Driessen extended Hamiache’s axiomatization to the enlarged class of efficient, symmetric, and linear values. In this paper, we introduce the notion of row (resp. column)-coalitional matrix in the framework of cooperative game theory. The Shapley value as well as the associated game are represented algebraically by their coalitional matrices called the Shapley standard matrix M^Sh and the associated transformation matrix M_λ, respectively. We develop a matrix approach for Hamiache’s axiomatization of the Shapley value. The associated consistency for the Shapley value is formulated as the matrix equality M^Sh = M^Sh · M_λ. The diagonalization procedure of M_λ and the inessential property for coalitional matrices are fundamental tools to prove the convergence of the sequence of repeated associated games as well as its limit game to be inessential. In addition, a similar matrix approach is applicable to study Driessen’s axiomatization of a certain class of linear values. In summary, it is illustrated that matrix analysis is a new and powerful technique for research in the field of cooperative game theory.     

On Products of Shifted Primes

Any rational representable as a product of shifted primes p+1 or their reciprocals, has a representation with exactly 19 terms.     

On functions in p-adic BMO and the distribution of prime integers

We study the spaces BMOp of functions of bounded mean oscillation modeled on a p-adic martingale, and determine their relationship with the ordinary, continuous space BMO of functions of bounded mean oscillation. Somewhat surprisingly, these results are related to information about the distribution of primes.     

On the Residues of Binomial Coefficients and Their Products Modulo Prime Powers

In this paper, we show several arithmetic properties on the residues of binomial coefficients and their products modulo prime powers, e.g., for any distinct odd primes p and q. Meanwhile, we discuss the connections with the prime recognitions. Received November 5, 1998, Accepted December 7, 2000.     

Prime Quasientropy and Quasichaos

We construct a prime symmetry relation for integers that is equivalent to Goldbach's conjecture and show that numerical computations of this prime symmetry property strongly resemble a chaotic sequence. We define and examine the notions of global and local prime quasientropies. Finally, we employ the fact that the prime number sequence satisfies the property of deterministic randomness to consider its utility for the field of quantum computation.