Recent content by Altermeris

I am still unsure about how to determine the formula by observation. I'll try describing the problem differently. If you have a bag of n-Coins that contain (n/2) black coins and (n/2) white coins, how many ways can you place the white and black coins in a line of n?

I wrote a brute force program to solve the problem. By punching in the output of the brute forcing algorithm into WolframAlpha, I was able to find the sequence formula to solve this problem. An=C(2n,n) public class BruteForcePermutation { public static boolean countUniqueChar(int...

I'm loosely familiar with the formulas for combinations and permutations. However, I don't know how to use the formula with restraints. Here is the specific issue I am having: Number of Objects: 16 Number of States: 2 Number of Black Objects 8 Number of White Objects: 8 How many unique...