Oct 8, 2008, 12:38 PM
|
#1 |
|
How to solve a math problem
... at least I think this is a math problem
 Anyway, I have x numbers to put in 7 slots, where x is always odd, repetitions are allowed, not all of the available numbers need be used, the ordering of the numbers matters, and the numbers have to be put into the slots in such a way that the sum of all the slots is 0. For example: Code:
1: 0 2: 1 3: 2 4: 0 5: 0 6: -2 7: -1 What I want to know is how many unique orderings are possible, given the value of x and the conditions above.
__________________
iMac Intel (Rev H, 27"), 1TB HDD, 16GB RAM, Ubuntu |
|
|
0
|
 |
|
«
Previous Thread
|
Next Thread
»
| Thread Tools | Search this Thread |
| Display Modes | |
Linear Mode
|
|
Similar Threads
|
||||
| thread | Thread Starter | Forum | Replies | Last Post |
| TUTORIAL: How to get PCSX2 to run on Mac(without Bootcamp) | Mirrors | Mac Applications and Mac App Store | 21 | Mar 14, 2013 03:34 PM |
| How to convinc my parents to let me buy a 17" MacBook pro | Ulf1103 | Buying Tips and Advice | 55 | Feb 20, 2012 08:11 AM |
| How to solve line spacing problem of apps? | shin02hk | Mac Basics and Help | 0 | Sep 16, 2011 10:49 AM |
All times are GMT -5. The time now is 07:29 PM.
