Abstract
We show that the number of maximal sum-free subsets of { 1 , 2 , … , n } is at most 2 3 n / 8 + o ( n ) . We also show that 2 0.406 n + o ( n ) is an upper bound on the number of maximal product-free subsets of any group of order n .
Sign-in/Register to access full text options 
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.
