✦ LIBER ✦

The binary Goldbach problem with one prime of the form

✍ Scribed by Kaisa Matomäki

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

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that almost all integers n ≡ 0 or 4 (mod 6) can be written in the form n = p 1 + p 2 , where

The proof is an application of the half-dimensional and linear sieves with arithmetic information coming from the circle method and the Bombieri-Vinogradov prime number theorem.

📜 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.

On the Poincaré series of the invariants

On the Poincaré series of the invariants of binary forms

✍ P Littelmann; C Procesi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 487 KB

Concise RLT forms of binary programs: A

Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem

✍ Richard J. Forrester; Warren P. Adams; Paul T. Hadavas 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restriction

The isomorphism problem for Cayley digra

The isomorphism problem for Cayley digraphs on groups of prime-squared order

✍ Anne Joseph 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 514 KB

Given any prime p, there are two non-isomorphic groups of order p2. We determine precisely when a Cayley digraph on one of these groups is isomorphic to a Cayley digraph on the other group, Namely, let X = Cay(G: T) be a Cayley digraph on a group G of order p2 with generating set T. We prove that X

On the generating functions associated t

On the generating functions associated to a system of binary forms

✍ Bram Broer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 642 KB

The Embedding Problem and Representation

The Embedding Problem and Representation of Prime Powers by Ambiguous Classes of Quadratic Forms of Discriminant −22sqr

✍ Giorgos Siligardos 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Representation of numbers by quadratic forms is closely related to the splitting character of their prime divisors in certain subfields of ring class fields. Knowing the generators of these subfields is thus very helpful. In this paper we relate the representation problem of prime powers by ambiguou