Coefficients involved in the Binomial Theorem. $\binom{n}{k}$ counts the subsets of size $k$ of a set of size $n$.

learn more… | top users | synonyms (1)

2
votes
3answers
64 views

Show that $ \sum_{k=0}^{r} \binom{r-k}{m} \binom{s+k}{n} = \binom{r+s+1}{m+n+1} $?

I can't resolve this exercise and I need a tip. $$ \sum_{k=0}^{r} \binom{r-k}{m} \binom{s+k}{n} = \binom{r+s+1}{m+n+1} $$ where $ n \geq s $.
1
vote
1answer
46 views

Finding the coefficient of $x^{46}$ in an expression

In this problem, I found that the answer is the coefficient of $x^{46}$ in $\left(\displaystyle\sum_{r=0}^{3} x^r \right)^6\left(\displaystyle\sum_{r=0}^{8} x^r \right)^4$ Is there possibly a way to ...
1
vote
3answers
56 views

Find $a_1$ given that $(1+x)^{100} = \sum_{i=0}^{100} a_ix^i$

If $(1+x)^{100} = \sum_{i=0}^{100} a_ix^i$, then $a_1$ is .. The options are $1$, $2$, $99$ or $100$. I'm sure the problem is trivial, but I just don't understand what is meant.
5
votes
2answers
82 views

Challenge: How to prove this identity between bi- and trinomial coefficients?

This question is the continuation of its predecessor. Using the convention that trinomial coefficients $$ \binom{n}{k_1,k_2,k_3}=\frac{n!}{k_1! k_2! k_3!} $$ are zero if $k_i<0$ or $\sum_i k_i\neq ...
2
votes
0answers
28 views

Evaluate $ \sum\limits_{j \in \mathbb{Z}_{\geq 0}} {n \choose r+kj}$ where $n,k$ are fixed

Is there a general way/technique to evaluate $ \sum\limits_{j \in \mathbb{Z}_{\geq 0}} {n \choose r+kj}$ in terms of $r$, where we consider $n$ and $k$ fixed natural numbers and $n > k$? (here, ...
2
votes
2answers
46 views

Proof of Pascal' identity

The identity $$\binom{x+1}{k}-\binom{x}{k}=\binom{x}{k-1}$$ is claimed to hold (using the binomial polynomials, considered as lying in $\mathbf{Q}[x]$) for $k$ at least $1$. Proof: by the usual ...
9
votes
1answer
97 views

Consecutive terms in Pascal's Triangle

is it known whether or not there are infinitely many pairs of consecutive terms in this sequence: http://oeis.org/A006987 ? The sequence is the list of numbers expressible in the form ...
1
vote
1answer
47 views

$\sum_{k+M = 0}^n {n \choose k} {n-k \choose m} = 3^n$ help with combinatorial reasoning

$\sum_{k+M = 0}^n {n \choose k} {n-k \choose m} = 3^n $ I have worked the cases for $n=2$, $n=3$, and $n=4$ by hand and it appears to be true. $n=2$: $${2\choose 0}{2\choose 0} + {2\choose ...
1
vote
0answers
25 views

Algorithm for determining whether certain numbers appear in Pascal's triangle

Is there any easy characterisation for the numbers which appear in Pascal's triangle that ARE NOT $\dbinom{n}{1}$, $\dbinom{n}{n-1}$? Is there a fast way to determine if some number (given its prime ...
1
vote
4answers
42 views

Why is $\sum\limits_{b=1}^{t-1} {t \choose b} 2^{t-b} = (3^t - 2^t - 1)$

Why is $$\sum\limits_{b=1}^{t-1} {t \choose b} 2^{t-b} = (3^t - 2^t - 1)$$ Thanks.
1
vote
3answers
176 views

Using Binomial Theorem to prove the following [duplicate]

$$\large\sum_{j=0}^n (-1)^j {n\choose j}={n\choose 0}-{n\choose 1}+.....+\pm{n\choose n}=0 $$ I'm confused by the last part of the equation $\pm$. it seems imply that the sum would be equal to 0 no ...
2
votes
2answers
61 views

Factorial as a sum. Insight appreciated

I recently posted an answer to a question about ways to express the factorial function as a sum. I posted the following formula, which I discovered several years ago and I haven't seen anywhere else: ...
2
votes
1answer
39 views

Find coefficient of $x^3$ in (2+x) ^(3/2)/(1-x)

I can expand $\dfrac{(2+x)^{3/2}}{1-x}=(1+x+x^2+\ldots)\left({3/2\choose0}+{3/2\choose1}(x+1)+{3/2\choose2}(x+1)^2+\ldots\right)$, but that doesn't seem to lead anywhere.
7
votes
3answers
128 views

How to prove the following limit: $\lim_{n \to +\infty} 4^n\left[\sum_{k=0}^n (-1)^k{n\choose k}\ln (n+k)\right]=0$?

How to prove the following limit: $$\lim_{n \to +\infty} 4^n\left[\sum_{k=0}^n (-1)^k{n\choose k}\ln (n+k)\right]=0?$$
3
votes
0answers
65 views

Generating functions to solve number of integer solution problem

If I have $x_1 + x_2 + x_3 =10$ with $1\leq x_1 \leq 5, \; 2 \leq x_2 \leq 6, \;3 \leq x_3 \leq 9$ I know that I compute $(t^1+\dots + t^5)(t^2 +\dots + t^6)(t^3+\dots +t^9)$ and look at the ...
1
vote
1answer
34 views

Meaning of coefficients when multiplying together $(1+x^a)(1+x^b)(1+x^c)\cdots$?

I know that when you multiply out $(1+x)^n$, the coefficient of $x^a$ tells you how many ways you can pick a of the brackets to use the x from to make $x^a$. I was wondering whether there is a meaning ...
3
votes
3answers
110 views

Evaluate the sum

I need to evaluate the following sum, which depends on $n \in \mathbb N$ (call it $S(n)$ if you will) $$ \sum_{i=0}^{n} (-1)^{n-i} \binom{n}{i} f(i)$$ where $f$ defined over $\mathbb N$ is ...
-2
votes
1answer
52 views

Number after binomial coefficient

What does the number 2 mean in this picture? link Thanks. Sorry I'm not a math expert. I need this to make a program in C to generate a trinomial triangle for a guy who asked it on StackOverflow ...
6
votes
2answers
487 views

How to solve 0.5 choose 4?

I was solving this problem for homework. It says, in the problem, that if n is positive you use the generalized definition of binomial coefficients. In my case, n is positive so I just plugged n= 0.5 ...
2
votes
1answer
53 views

How prove this sum $\sum\limits_{n=k}^{\infty}\dbinom{n}{k}\left(\dfrac{-z}{1-z}\right)^n$

prove or disprove $$\sum_{n=k}^{\infty}\binom{n}{k}\left(\dfrac{-z}{1-z}\right)^n= (1-z)(-z)^k$$ my try: since ...
1
vote
1answer
55 views

How to evaluate the finite sum $\sum_{k=0}^n{\alpha \choose k}^2\lambda^k$

Is there a close form expression for the series \begin{equation} \sum_{k=0}^n{\alpha \choose k}^2\lambda^k,\quad \alpha ~ \text{is non-integer} \end{equation} As far as I know, there is an identity ...
1
vote
1answer
51 views

Binomial Congruence (mod 5) Identity

I've got a (hard?) Putnam-style problem that I've been given to look at . . . I've never worked any problem even vaguely like this, but my director thinks I should be able to do it. I doubt it (100% ...
6
votes
3answers
140 views

Evaluation of $\sum_{k=0}^n{n\choose k}^2u^k$

I am trying to evaluate the finite sum \begin{equation} f(u)=\sum_{k=0}^n{n\choose k}^2u^k,\quad 0<u\le1 \end{equation} In an first attempt, I think of the generating function \begin{equation} ...
1
vote
2answers
106 views

Proof that $\dfrac{1}{e^x}=e^{-x}$ without converting it to $e^{x}e^{-x}=1$.

I want to show that $\dfrac{1}{e^x} = e^{-x}$ from the Taylor expansion of $e^x$. To express $\dfrac{1}{e^x}$ as a power series, I let: $$ \left(\dfrac{1}{0!}x^0 + \dfrac{1}{1!}x^1 + ...
0
votes
1answer
47 views

How to evaluate $\sum_{k=0}^{n} \alpha^k \binom{n}{k}$?

I am trying to show that the function that satisfies $f^\prime(x)=f(x)$ with $f(0)=1$ behaves in an exponential way (in other words, I want to justify writing it as $e^x$). I need to show that: $$ ...
2
votes
2answers
28 views

Appromixation of binomial coefficient for large numbers

In the context of writing a program for sortition, I would like to know if the entropy of my input random variable in large enough to potentially produce all outcome of my sortition problem. Let say ...
2
votes
1answer
30 views

Sum of combinations of the n by consecutive k

In a book, I found that the sum of combinations: $\binom{n}{k} + \binom{n}{k+1} +\cdots+ \binom{n}{n}$, where k starts from 0, equals $2^n$. It is possible to express this statement via sum: $2 + ...
2
votes
2answers
106 views

Alternating sum of binomial coefficients is equal to zero [duplicate]

Prove without using induction that the following formula:$$\sum_{k=0}^n (-1)^k\binom{n}{k}=0$$ is valid for every $n\ge1$. Progress For each odd $n$ we can use the ...
2
votes
2answers
88 views

How to prove $n! > n^a$ for all $a\in \mathbb{R}$ (for sufficiently large $n$)?

I've encountered a proof which claims $n! > n^2$ for sufficiently large $n$. I tried using induction to prove it for an arbitrary $a$: $n! > n^a$. Lets assume the claim is true for $n$: $n! ...
1
vote
1answer
39 views

Verification of binomial coefficient congruence $\binom{jp}{j}\equiv j\binom{p}{j}\pmod{p^2}$

Let $j\ge 1$ be an integer and $p$ prime. Is it true that $$\binom{jp}{j}\equiv j\binom{p}{j}\pmod{p^2}$$ My work No, take $j>p$, then the RHS is zero, while the LHS need not be $\equiv 0$. For ...
7
votes
4answers
151 views

How prove this inequality $(1+\frac{1}{16})^{16}<\frac{8}{3}$

show that $$(1+\dfrac{1}{16})^{16}<\dfrac{8}{3}$$ it's well know that $$(1+\dfrac{1}{n})^n<e$$ so $$(1+\dfrac{1}{16})^{16}<e$$ But I found this $e=2.718>\dfrac{8}{3}=2.6666\cdots$ ...
0
votes
0answers
25 views

is binomial congruence given in article true or false?

I'm just reading a paper which, on its page 3, Application 8, claims the following: $$\binom{k+sp}{j}\equiv\binom{k}{j}\pmod{p}$$ where $p\ge 1$, $s\ge 1$, $k\ge 1$ and $p\not\mid j$ (actually, it ...
1
vote
3answers
66 views

Showing that $\sum\limits_{k=2}^n {k\choose2} = {{n+1}\choose 3}$ for integers $n\geq 2$

I'm trying to prove that $\sum\limits_{k=2}^n {k\choose2} = {{n+1}\choose 3}$ for integers $n\geq 2$. I figured induction was the way to go, so I tried. This is what I've accomplished so far: Proved ...
-1
votes
2answers
58 views

Squared binomial paradox?

When you square this $$(5-2)^2$$ you will get 49 $$ 5^2 - 2 * 5 * (-2) + (-2)^2$$ $$25 + 20 + 4 = 49$$ but if you do it like this (5-2) * (5-2) you will get 9 $$ 5(5-2) - 2(5-2)$$ $$25-10-10+4$$ ...
1
vote
3answers
28 views

refactoring binomial with negative power

I am reading Calculus Made Easy where in Chapter IV: $$(x+dx)^{-2}$$ Is refactored as: $$x^{-2}\left(1+\frac{dx}x\right)^{-2}$$ Could someone give me an insight into this refactoring? I can see from ...
0
votes
1answer
41 views

The sum of the product of two binomial coefficients

This is really phsycics related question with mathematics behind it. In my physics book there's the following relation: ...
1
vote
2answers
50 views

Problem involving summation and binomial coefficient

I have been fighting with this but I'm really not getting anywhere. $$\sum_{0\leq2k\leq n}\binom{n}{2k}2^k\equiv0\pmod 3$$ $$iff$$ $$n\equiv2\pmod 4$$ Hint: Consider ...
2
votes
1answer
20 views

Relating Binomial Coefficients

This question popped up in my revision sheet, and was just wondering on how to do it (this is high-school math by the way, so nothing too complicated please) "Expand $(x+(1-x))^n$, and use this to ...
1
vote
0answers
25 views

The distribution of sum of two binomials with complement success probabilities

It is well-known that if $X$ and $Y$ are independent binomial random variables with parameters $(n_1,p)$ and $(n_2,p)$ respectively, $Z = X+Y$ has a binomial distribution with with parameters ...
3
votes
0answers
81 views

What's so special about binomial coefficients that someone decided to organize them in a triangle?

I know that binomial coefficients are related to figurate numbers (which were studied by Greeks a loooong time ago, because of its connections to geometry). I also understand how the Pascal's triangle ...
-1
votes
1answer
32 views

Binomial Coefficients (2,1) [closed]

What are binomial coefficients? Can someone explain. For example: (2,1). or what (2n,n) means
4
votes
0answers
81 views

Binomial triplets

Solutions to the equation $$\dbinom{a}{n}+\dbinom{b}{n}=\dbinom{c}{n}$$ I will refer to as 'Binomial triplets of order $n$'. These triplets describe simplicial $n$-polytopic numbers that can be ...
2
votes
2answers
80 views

Product rule for simplex numbers

The $n$th triangular number is defined as $T_2(n) = n(n+1)/2$, and there is an interesting product rule for triangular numbers: $$T_2(mn) = T_2(m)\,T_2(n) + T_2(m-1)\,T_2(n-1).$$ The tetrahedral ...
3
votes
3answers
160 views

Evaluation of a sum of $(-1)^{k} {n \choose k} {2n-2k \choose n+1}$

I have some question about the paper of which name is Spanning trees: Let me count the ways. The question concerns about $\sum_{k=0}^{\lfloor\frac{n-1}{2} \rfloor} (-1)^{k} {n \choose k} {2n-2k ...
3
votes
3answers
66 views

difficult problem about binomial coefficients

If $r,m,n\in \mathbb N$ so that $r\le \min \{n,m\}$, then $$\binom{n+m}{r} = \binom{n}{0}.\binom{m}{r}+\binom{n}{1}.\binom{m}{r-1}+...+\binom{n}{r}.\binom{m}{0}.$$ If $\min \{n,m\} < r$, then how ...
0
votes
0answers
42 views

Sum of independent discrete random variable

Here is my attempt of deriving the sum of independent random variable in the discrete case : $\underline{\textbf{Sum of independent random variables}}$ Let $\mathcal{C_1}, \mathcal{C_2}$ be ...
1
vote
1answer
18 views

Question concerning an example of higher derivatives and binomes

I got this exercise form OCW 18.03SC - problem 1G-5b: What is the solution of the following derivative?: $$\dfrac{d^{p+q}}{dx^{p+q}}x^p(1+x)^q$$ I used Leibniz' formula and the only non-zero term ...
2
votes
1answer
26 views

Order of Binomial addition

I was reading up a statement in probability which said that $nC_0 + nC_1 + nC_2 +\dots+ nCm$ is of order $n^m$ where $nCm$ is notation for number of combinations from a collection of $n$ taking $m$ ...
2
votes
1answer
87 views

Find the sum of all coefficients in expansion of $(x^2+2x)^{20}$.

Find the sum of all coefficients in expansion of $(x^2+2x)^{20}$. Is there a specific method or formula for this?
2
votes
2answers
95 views

Proof of equality $\sum_{k=0}^{m}k^n = \sum_{k=0}^{n}k!{m+1\choose k+1} \left\{^n_k \right\} $ by induction

I have a problem with following equality: $$\sum_{k=0}^{m}k^n = \sum_{k=0}^{n}k!{m+1\choose k+1} \left\{^n_k \right\} $$ And I would like to use induction in following way: Base: $$ m = n $$ And: $$ ...