𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sets of Prime Numbers Satisfying a Divisibility Condition

✍ Scribed by Paul Erdős; Anthony B. Evans

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
270 KB
Volume
61
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis

We study sets P of k primes that satisfy the condition gcd(> A&> B, > P)=1 whenever A and B are disjoint non-empty subsets of P. It is known that such sets of primes exist for all positive integers k. It is of interest to know the asymptotic behavior of n k , the smallest natural number that is the product of k such primes. In this paper we derive asymptotic bounds for n k .

📜 SIMILAR VOLUMES

A characterization of panconnected graph
A characterization of panconnected graphs satisfying a local ore-type condition
✍ Asratian, A. S.; H�ggkvist, R.; Sarkisian, G. V. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

It is well known that a graph G of orderp 2 3 is Hamilton-connected if d(u) +d(v) 2 p + 1 for each pair of nonadjacent vertices u and w. In this paper we consider connected graphs G of order at least 3 for which where N ( z ) denote the neighborhood of a vertex z. We prove that a graph G satisfying

A Note on the Divisibility of Class Numb
A Note on the Divisibility of Class Numbers of Real Quadratic Fields
✍ Gang Yu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Suppose g > 2 is an odd integer. For real number X > 2, define S g ðX Þ the number of squarefree integers d4X with the class number of the real quadratic field Qð ffiffiffi d p Þ being divisible by g. By constructing the discriminants based on the work of Yamamoto, we prove that a lower bound S g ðX

The Exceptional Set for the Number of Pr
The Exceptional Set for the Number of Primes in Short Intervals
✍ D Bazzanella; A Perelli 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 137 KB

We investigate the exceptional set E $ (X, h) associated with the asymptotic formula for the number of primes in short intervals; see Section 1 for the definition. We first obtain two results about the basic structure of this set, proving the inertia and decrease properties; see Theorem 1. Then we t

A 2-factor with two components of a grap
A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition
✍ Atsushi Kaneko; Kiyoshi Yoshimoto 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

## Abstract Chvátal and Erdös showed that a __k__‐connected graph with independence number at most __k__ and order at least three is hamiltonian. In this paper, we show that a graph contains a 2‐factor with two components, i.e., the graph can be divided into two cycles if the graph is __k__(≥ 4)‐co