Majid Fouladpour

less info
69 reputation
10
bio website about.me/majid_fouladpour
location Iran
age 48
visits member for 3 years, 7 months
seen Feb 16 at 22:54

Email: majid4466@gmail.com
Skype: custom.apps


Jan
31
comment Detecting resource allocation conflict
Apologies to your inner Boba Fett for delay in releasing the bounty ;) I thought when the answer is accepted the bounty is also paid at the same time.
Jan
31
awarded  Benefactor
Jan
30
accepted Detecting resource allocation conflict
Jan
28
comment Detecting resource allocation conflict
@Casteels, correct. Using what we know about the data like as you pointed interest/redundancy.
Jan
27
awarded  Promoter
Jan
27
comment $n$ balls of $2^{n}-1$ colors, order not significant, how many combinations?
Thank you for both this bright and geeky answer, and the suggestion to grab a textbook for exploring this area -- I am beginning to love this combinatorics, and I have picked Mathematics for Informatics and Computer Science.
Jan
27
accepted $n$ balls of $2^{n}-1$ colors, order not significant, how many combinations?
Jan
27
comment How find the “how many good dyeing” method
Humm, you've made all points look red regardless... was that all you could do to make the problem harder ;-)
Jan
27
comment $n$ balls of $2^{n}-1$ colors, order not significant, how many combinations?
For n=3, we have 7 colors, if I understand your notation correctly, then a sample draw would be shown as e.g. 10111010111, right? Meaning the 1s are walls providing a pidgin-hole like container for the balls, and since here we have 7 colors, we need 8 walls?
Jan
27
comment $n$ balls of $2^{n}-1$ colors, order not significant, how many combinations?
I tried to follow the reasoning, but didn't come out not feeling dizzy ;) The formula does give 6 for n=2 however, which is right.
Jan
27
awarded  Commentator
Jan
27
awarded  Custodian
Jan
27
revised $n$ balls of $2^{n}-1$ colors, order not significant, how many combinations?
edited title
Jan
27
reviewed Approve suggested edit on $n$ balls of $2^{n}-1$ colors, order not significant, how many combinations?
Jan
27
comment $n$ balls of $2^{n}-1$ colors, order not significant, how many combinations?
Actually, this did begin with numbers rather than balls. The original problem is: How many ways can we select n non-zero binary numbers of order n - the order of picks in each group does not matter.
Jan
27
comment $n$ balls of $2^{n}-1$ colors, order not significant, how many combinations?
I did try to go up to 3, but that is too many combinations (343).
Jan
27
comment $n$ balls of $2^{n}-1$ colors, order not significant, how many combinations?
@Mr.Wizard Yes, exactly. Since {1,2}={2,1}, {1,3}={3,1}, and {2,3}={3,2} we are left with 6 distinct combinations out of the 9 if order did matter.
Jan
27
comment $n$ balls of $2^{n}-1$ colors, order not significant, how many combinations?
@Mr.Wizard I edited my comment above, if the goal is still unclear I could provide more details.
Jan
27
comment $n$ balls of $2^{n}-1$ colors, order not significant, how many combinations?
I used the probability tag as I was at a loss for a better tag. This is not about how probable an event is, it is about how many different triplets are possible to form.
Jan
27
comment $n$ balls of $2^{n}-1$ colors, order not significant, how many combinations?
Sorry, didn't know there were two SE sites for math -- yes please.