منابع مشابه
On Cunningham Chains
Let q be a prime with primitive root 2. We show that (a) if (pi) q−2 i=0 is a sequence of primes such that pi = 2pi−1 + 1 for all 1 ≤ i ≤ q − 2, then q divides p0 + 1 or p0 ∈ {2, 3, 5} and (b) if (pi) q−2 i=0 is a sequence of primes such that pi = 2pi−1 − 1 for all 1 ≤ i ≤ q − 2, then q divides p0 − 1 or p0 ∈ {2, 3}.
متن کاملPrime clusters and Cunningham chains
We discuss the methods and results of a search for certain types of prime clusters. In particular, we report specific examples of prime 16-tuplets and Cunningham chains of length 14.
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملon the tutte polynomial of benzenoid chains
the tutte polynomial of a graph g, t(g, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. in this paper a simple formula for computing tutte polynomial of a benzenoid chain is presented.
متن کاملPolynomial Functions on Bounded Chains
We are interested in representations and characterizations of lattice polynomial functions f : L → L, where L is a given bounded distributive lattice. In an earlier paper [4, 5], we investigated certain representations and provided various characterizations of these functions both as solutions of certain functional equations and in terms of necessary and sufficient conditions. In the present pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2011
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2011.05.012