Strings of Consecutive Primes in Function Fields
نویسنده
چکیده
In a recent paper, Thorne [5] proved the existence of arbitrarily long strings of consecutive primes in arithmetic progressions in the polynomial ring Fq[t]. Here we extend this result to show that given any k there exists a string of k consecutive primes of degree D in arithmetic progression for all sufficiently large D.
منابع مشابه
Bubbles of Congruent Primes
In [15], Shiu proved that if a and q are arbitrary coprime integers, then there exist arbitrarily long strings of consecutive primes which are all congruent to a modulo q. We generalize Shiu’s theorem to imaginary quadratic fields, where we prove the existence of “bubbles” containing arbitrarily many primes which are all, up to units, congruent to a modulo q.
متن کاملStrings of Special Primes in Arithmetic Progressions
The Green-Tao Theorem, one of the most celebrated theorems in modern number theory, states that there exist arbitrarily long arithmetic progressions of prime numbers. In a related but different direction, a recent theorem of Shiu proves that there exist arbitrarily long strings of consecutive primes that lie in any arithmetic progression that contains infinitely many primes. Using the technique...
متن کاملBounded gaps between primes with a given primitive root, II
Let m be a natural number, and let Q be a set containing at least exp(Cm) primes. We show that one can find infinitely many strings of m consecutive primes each of which has some q ∈ Q as a primitive root, all lying in an interval of length OQ(exp(C ′m)). This is a bounded gaps variant of a theorem of Gupta and Ram Murty. We also prove a result on an elliptic analogue of Artin’s conjecture. Let...
متن کاملThe power digraphs of safe primes
A power digraph, denoted by $G(n,k)$, is a directed graph with $Z_{n}={0,1,..., n-1}$ as the set of vertices and $L={(x,y):x^{k}equiv y~(bmod , n)}$ as the edge set, where $n$ and $k$ are any positive integers. In this paper, the structure of $G(2q+1,k)$, where $q$ is a Sophie Germain prime is investigated. The primality tests for the integers of the form $n=2q+1$ are established in terms of th...
متن کاملPermuting Operations on Strings — Their Permutations and Their Primes
We study some length-preserving operations on strings that only permute the symbol positions in strings. These operations include some well-known examples (reversal, circular or cyclic shift, shuffle, twist) and some new ones based on the Archimedes spiral and on the Josephus problem. Such a permuting operation X gives rise to a family {Xn}n≥2 of similar permutations. We investigate the structu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007