Abstract
Goldbach's conjecture is an unsolved legendary problem. In this paper, we investigate an optimization problem as an attempt to discuss potential applications of the conjecture. In an optimization perspective, the research question, modelled from design of base components, is to select a minimum number of primes to span a given set of target even integers. We formally define the problem, propose integer programming formulations, and develop solution procedures, which are then tested through a computational study.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
