Clarification in a problem

Hey Guys, I have this question but my friend and I are getting different answers, and I don't have the answer booklet with me. Could you guys help ?

So, here's the question.

Find the number of all possible k-tuples of non - negative integers (n(1),n(2),n(3).... n(k)) such that

sum_{i=1}^k n(i) = 100

So, this is the question. Now here's my solution.

Let there be 100 stars placed in a line. We have to divide these 100 stars into k groups such that no group equals 0 . So, let me do the division between stars by placing a bar between the stars. By this way, there are 99 possible ways in which I can set a bar (between any two stars) . But as I only have to create k groups, I need only place k-1 bars..

So I have 99 places and I need to choose any (k-1) places.. SO, I get the answer as

99 C (k-1)

Is it correct guys ? Because I have a friend who says the answer is (99+k)C(k-1).

Note by Adeetya Tantia
5 years, 1 month ago

No vote yet
1 vote

</code>...<code></code> ... <code>.">   Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in </span>...<span></span> ... <span> or </span>...<span></span> ... <span> to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Sort by:

Top Newest

Your friend is correct.

If the problem asked about positive integers, then your answer of (99k1)\dbinom{99}{k - 1} would be correct. But the nin_i are nonnegative, which means they can be 0. Your approach does not account for this.

Instead, consider any arrangement of 100 stars and k1k - 1 bars. (In particular, there could be two or more bars between consecutive stars.) Then you take n1n_1 as the number of stars before the first bar, n2n_2 as the number of stars between the first bar and second bar, and so on. This gives you solutions where the nin_i can be 0. Hence, the number of solutions is the number of ways of arranging 100 stars and k1k - 1 bars, which is (100+(k1)100)=(k+99100)=(k+99k1).\binom{100 + (k - 1)}{100} = \binom{k + 99}{100} = \binom{k + 99}{k - 1}.

Jon Haussmann - 5 years, 1 month ago

Log in to reply

Thanks.

Adeetya Tantia - 5 years, 1 month ago

Log in to reply

Use the Stars and Bars formula, it's the same thing. A standard result !

Aditya Raut - 4 years, 11 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...