286,093 research outputs found
Every sufficiently large even number is the sum of two primes
The binary Goldbach conjecture asserts that every even integer greater than
is the sum of two primes. In this paper, we prove that there exists an
integer such that every even integer can be expressed as
the sum of two primes, where is the th prime number and . To prove this statement, we begin by introducing a type of double
sieve of Eratosthenes as follows. Given a positive even integer , we
sift from all those elements that are congruents to modulo or
congruents to modulo , where is a prime less than .
Therefore, any integer in the interval that remains unsifted is
a prime for which either or is also a prime. Then, we
introduce a new way of formulating a sieve, which we call the sequence of
-tuples of remainders. By means of this tool, we prove that there exists an
integer such that is a lower bound for the sifting
function of this sieve, for every even number that satisfies , where , which implies that can be expressed as the sum of two primes.Comment: 32 pages. The manuscript was edited for proper English language by
one editor at American Journal Experts (Certificate Verification Key:
C0C3-5251-4504-E14D-BE84). However, afterwards some changes have been made in
sections 1, 6, 7 and
A bijection between noncrossing and nonnesting partitions of types A and B
The total number of noncrossing partitions of type is the th
Catalan number when , and the
binomial when , and these numbers coincide with the
correspondent number of nonnesting partitions. For type A, there are several
bijective proofs of this equality, being the intuitive map that locally
converts each crossing to a nesting one of them. In this paper we present a
bijection between nonnesting and noncrossing partitions of types A and B that
generalizes the type A bijection that locally converts each crossing to a
nesting.Comment: 11 pages, 11 figures. Inverse map described. Minor changes to correct
typos and clarify conten
- …