Numerical semigroups generated by primes

Publication date 16 December 2020

Abstract: Let

p_{1} = 2, p_{2} = 3, p_{3} = 5, l d o t s

be the consecutive prime numbers,

S_{n}

the numerical semigroup generated by the primes not less than

p_{n}

and

u_{n}

the largest irredundant generator of

S_{n}

. We will show, that

u_{n} s i m 3 p_{n}

. Similarly, for the largest integer

f_{n}

not contained in

S_{n}

, by computational evidence we suspect that

f_{n}

is an odd number for

n g e q 5

and

f_{n} s i m 3 p_{n}

; further

4 p_{n} > f_{n + 1}

for

n g e q 1

. If

f_{n}

is odd for large

n

, then

f_{n} s i m 3 p_{n}

. In case

f_{n} s i m 3 p_{n}

every large even integer

x

is the sum of two primes. If

4 p_{n} > f_{n + 1}

for

n g e q 1

, then the Goldbach conjecture holds true. Further, Wilf's question in [12] has a positive answer for the semigroups

S_{n}

.

Recommendations

Cites work

Cited in

(3)

Describes a project that uses

Uses Software

This page was built for publication: Numerical semigroups generated by primes