|March 25th, 2017, 05:50 AM||#1|
Joined: Aug 2016
From: Used to be Earth
Is this part of combinatorics?
I need your help to figure the following out. Thanks in advance.
So, let’s say I’m given 10 elements (numbers, for example) and I need to select 3 of these elements (the order doesn’t matter, and I can select the same element more than once) to obtain a fixed result.
So for example, among 10 numbers, I have to pick 3 numbers, then add them together (so the first number + the second one + the third one) to obtain a given constant K. The question then becomes, how many combinations of 3 numbers can I make to obtain the constant K?
How do I model this problem? And is there a straightforward way of generalizing the problem to any number of total elements and any number of selected elements?
|March 25th, 2017, 12:38 PM||#2|
Joined: Sep 2015
The subset sum problem is essentially what you have here. You are using multisets rather than sets in that elements can be repeated.
I'm not seeing any closed form solution for the problem, just algorithms.
|Thread||Thread Starter||Forum||Replies||Last Post|
|New concept - part quantum part surface across the world - for data and nanotech||BenFRayfield||Physics||0||March 14th, 2015 06:20 PM|
|help with combinatorics||zengjinlian||Advanced Statistics||1||October 6th, 2012 09:24 AM|
|combinatorics||atif||Number Theory||4||September 16th, 2011 03:06 AM|
|Combinatorics||proglote||Algebra||4||August 9th, 2011 02:34 AM|