✦ LIBER ✦

On the number of representations in the ternary Goldbach problem with one prime number in a given residue class

✍ Scribed by Karin Halupczok

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 128 KB
Volume: 117
Category: Article
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2005.06.003

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On the number of vertices of given degre

On the number of vertices of given degree in a random graph

✍ Zbigniew Palka 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor

On the Number of Conjugacy Classes of π-

On the Number of Conjugacy Classes of π-Elements in a Finite Group

✍ Burkhard Külshammer; Geoffrey R. Robinson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Let G be a finite group and a set of primes. In this note we will prove Ž . two results on the local control of k G, , the number of conjugacy w x classes of -elements in G. Our results will generalize earlier ones in 8 , w x w x 9 , and 3 . Ž . Ž . In the following, we denote by F F G the poset of

On the representation of−1 as a sum of t

On the representation of−1 as a sum of two squares in an algebraic number field

✍ Burton Fein; Basil Gordon; John H. Smith 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 301 KB

On the Density of Subgraphs in a Graph w

On the Density of Subgraphs in a Graph with Bounded Independence Number

✍ Pavel Valtr 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Let \_(n, m, k) be the largest number \_ # [0, 1] such that any graph on n vertices with independence number at most m has a subgraph on k vertices with at lest \_ } ( k 2 ) edges. Up to a constant multiplicative factor, we determine \_(n, m, k) for all n, m, k. For log n m=k n, our result gives \_(

The dependence of local Nusselt number o

The dependence of local Nusselt number on Prandtl number in the case of free convection along a vertical surface with uniform heat flux

✍ Fujii Tetsu; Fujii Motoo 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 214 KB

On the equivalence in complexity among t

On the equivalence in complexity among three computation problems on maximum number of edge-disjoint s−t paths in a probabilistic graph

✍ Pen Cheng; Shigeru Masuyama 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 396 KB