document.write( "Question 1024915: I have four numbers: 2, 92, 79, and 71. Without using any number twice, and always using the four numbers, I need to come up with a list of every possible combination. I know that is going to add up to a very large amount of combinations, but so far, every other place I checked failed miserably. I guess it's up to you to save the day now. Good luck, and thank you! \n" ); document.write( "

Algebra.Com's Answer #640282 by mathmate(429) $\"\"$ $\"About$

You can put this solution on YOUR website!

\n" ); document.write( "Question:
\n" ); document.write( "I have four numbers: 2, 92, 79, and 71. Without using any number twice, and always using the four numbers, I need to come up with a list of every possible combination. I know that is going to add up to a very large amount of combinations, but so far, every other place I checked failed miserably. I guess it's up to you to save the day now. Good luck, and thank you!
\n" ); document.write( "
\n" ); document.write( "Solution:
\n" ); document.write( "The number of combinations for taking any number of object (without repetition) from a pool of n is $\"2%5En\"$ ( equal to the size of the power set).
\n" ); document.write( "It seems from the context that at least one must be used, which reduces the number of combination by 1.
\n" ); document.write( "So the number of combinations is $\"2%5En-1=2%5E4-1=15\"$ .
\n" ); document.write( "
\n" ); document.write( "However, if you say there is a very large number of combinations, then you might mean doing operations between the numbers. In that case, more rules are required, for example: the permissible operators (+,-,*,/ or more), the presence of parentheses, and how many levels of nesting parentheses, etc.
\n" ); document.write( "If these rules are provided, please make a new post so everyone can have a chance to help you. \n" ); document.write( "

\n" );