1964
DOI: 10.14492/hokmj/1530691545
|View full text |Cite
|
Sign up to set email alerts
|

On the Representation of Large Even Integers as Sums of Two Almost Primes. I

Abstract: The classical Goldbach problem, which still survives unsolved, is to prove that every even integer $\geqq 6$ is a sum of two prime numbers. In 1948 A. R\'enyi [4] succeeded, by making use of his refinement of the large sieve of Yu. V. Linnik, in proving that every even integer $\geqq 6$ is a sum of a prime and of an almost prime. Here an almost prime is a positive integer $(>1)$ the total number of prime factors of which is bounded by a certain constant. Recently this result was sharpened in part by Ch.-D. P… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
3
0

Year Published

1964
1964
1980
1980

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 2 publications
0
3
0
Order By: Relevance
“…
In a previous paper [3] the writer has given with Miss A. Togashi an elementary proof for the fact that every sufficiently large even integer is representable as a sum of two almost primes, each of which has at most three prime factors, a result first obtained by A. I. Vinogradov. On the other hand, we are able to prove by a rather transcendental method that every large even integer is representable as a sum of a prime and an almost prime composed of at most four prime factors (see [4]).
…”
mentioning
confidence: 97%
See 2 more Smart Citations
“…
In a previous paper [3] the writer has given with Miss A. Togashi an elementary proof for the fact that every sufficiently large even integer is representable as a sum of two almost primes, each of which has at most three prime factors, a result first obtained by A. I. Vinogradov. On the other hand, we are able to prove by a rather transcendental method that every large even integer is representable as a sum of a prime and an almost prime composed of at most four prime factors (see [4]).
…”
mentioning
confidence: 97%
“…Let $q,$ $(q, N)=1$ , be a fixed prime number in the interval $z<q\leqq z_{1}$ , where $z=N^{\frac{1}{9}}$ , $z_{1}=N^{\frac{5}{9}}$ , and let $S(q)$ denote the number of those integers $a_{n}=n(N-n)(1\leqq n\leqq N$, $(n, N)=1)$ which are not divisible by any prime $p\leqq z$ and are divisible by the prime $q$ . Then we find as in [3] that…”
mentioning
confidence: 99%
See 1 more Smart Citation