Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7057935
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 28, 20262026-05-28T04:03:10+00:00 2026-05-28T04:03:10+00:00

Given k positive integer numbers a 1 < a 2 < a 3 <

  • 0

Given k positive integer numbers a1 < a2 < a3 < … < ak, and all integers greater than ak, we want to check whether the set A = {ai : i ∈ [1,k]} ∪ {n : n > ak, n ∈ ℕ } = {a1, a2, a3, … , ak, ak+1, ak+2, …} is closed under addition. This means that:

∑1 ≤ i ≤ k ai*bi ∈ A, for any non-negative integers bi.

For example, {2,4,6,7,8,….} is closed under addition.

Is there any easy way to do this? Any functions that we could use in Mathematica or Matlab?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-28T04:03:10+00:00Added an answer on May 28, 2026 at 4:03 am

    If the discontinuous portion less than k of the sets are not large I believe you can approach it directly like this:

    a = {2, 4, 6};
    Tr /@ Subsets[a, {2}];
    TakeWhile[%, # < Last@a &];
    Complement[%, a] === {}
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a set of positive numbers. Given a number not in the set,
Let A be an array of n positive integers, and k a given integer.
I had this question: Given an unsorted array of positive integers and an integer
Consider this problem: You are given an array containing positive integers. All the integers
Given a positive integer sequence of numbers in an array with common difference 2
For a given integer, n , I need to print all the lists of
Given an array of positive integer, we need to exchange each element with first
I have an optimization problem as follows. Given an array of positive integers, e.g.
Given a positive integer X , how can one partition it into N parts,
Question: Given an unsorted array of positive integers, is it possible to find a

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.