Waste less time on Facebook — follow Brilliant.
×

A nice combinatorics proof!

There are \(n\) numbers,\(x_1,x_2,x_3,...x_{n-1},x_n\),\(r\) numbers out of these \(n\) are chosen,each number,\(x_i;i\in [1,n]\) occurs in how many of these sets of numbers?\[\] I have posted mine below.\[\] Post yours too!

Note by Adarsh Kumar
2 years, 1 month ago

No vote yet
1 vote

  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 \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

Let us check how many times,\(x_i\) can come in a set of \(r\) numbers,it will come whenever the rest of the \(r-1\) numbers can be chosen differently.And the number of ways the \(r-1\) numbers can be chosen out of the \(n-1\) numbers,excluding\(x_i\)is,\((n-1)_{\huge{C}_{\huge{r-1}}}\).And done!

Adarsh Kumar - 2 years, 1 month ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...