TL;DR
This paper discusses the upper bound for the number of primes expressible as sums of three distinct primes from a set of n primes, questioning whether this bound is optimal.
Contribution
It investigates the sharpness of the upper bound for prime sums in OEIS sequence A111384, providing insights into its accuracy and potential improvements.
Findings
The bound's sharpness remains uncertain.
Evidence suggests the bound may not be tight.
Further research needed to confirm the bound's optimality.
Abstract
is an upper bound for the number of primes that can be written as a sum of three distinct primes selected from a set of primes. Is this bound sharp?
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · graph theory and CDMA systems · Algorithms and Data Compression