๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the upper bound for the number of primes or almost primes in a given integer sequence

โœ Scribed by J. Kan

Publisher
Springer Netherlands
Year
1991
Tongue
English
Weight
327 KB
Volume
22
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the number of representations in the
On the number of representations in the ternary Goldbach problem with one prime number in a given residue class
โœ Karin Halupczok ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 128 KB

For J 3 (n) = p 1 +p 2 +p 3 =n p 1 โ‰กa 1 (mod q 1 ) log p 1 log p 2 log p 3 , it is shown that for any A and any < 1/2, what improves a work of Tolev; S 3 (n) is the corresponding singular series. A special form of a sieve of Montgomery is used.

A sharp upper bound for the number of st
A sharp upper bound for the number of stable sets in graphs with given number of cut edges
โœ Hongbo Hua ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 648 KB

Let G be a connected and simple graph, and let i(G) denote the number of stable sets in G. In this letter, we have presented a sharp upper bound for the i(G)-value among the set of graphs with k cut edges for all possible values of k, and characterized the corresponding extremal graphs as well.

Tight upper bound on the number of edges
Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application
โœ Zhi-Zhong Chen; Shiqing Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 68 KB

We show that an n-vertex bipartite K 3,3 -free graph with n 3 has at most 2n -4 edges and that an n-vertex bipartite K 5 -free graph with n 5 has at most 3n -9 edges. These bounds are also tight. We then use the bound on the number of edges in a K 3,3 -free graph to extend two known NC algorithms fo