Given number n, how to find the largest number of distinct sets of numbers to choose from a list of numbers where all numbers are larger than 1 and their total product <= n? For example, there are 3x2x2=12 ways to choose from the list 2, 2, 3, 4. I encounter this problem quite a lot in calculating time complexities, but every time I just estimate the answer, never really figuring it out.
#Interesting problem 2
silver axle
floral kindleBOT
Given number n, how to find the largest number of distinct sets of numbers to ch...
- Do not ping the Moderators, unless someone is breaking the rules.
- Do not ping the Helper Moderators, unless there is a conflict between helpers.
- Do not ping other members randomly for help.
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:
+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:
silver axle
@meager merlin Sorry, I didn't check the old thread and it's closed. The problem with choosing all 2s is that the number of ways to choose distinct set of numbers from it becomes (number of 2s + 1)
Also, this might be too much to ask but it would be nice if you could ping me when you answer. Thx!
tribal canopy