Explore >> Select a destination
|
You are here 
|
algorithmsoup.wordpress.com | ||
| | | | |
ckrao.wordpress.com
|
|
| | | | | In this post I would like to prove the following identity, motivated by this tweet. $latex \displaystyle n! \prod_{k=0}^n \frac{1}{x+k} = \frac{1}{x\binom{x+n}{n}} = \sum_{k=0}^n \frac{(-1)^k \binom{n}{k}}{x+k}$ The first of these equalities is straightforward by the definition of binomial coefficients. To prove the second, we make use of partial fractions. We write the expansion $latex \displaystyle... | |
| | | | |
mathematicaloddsandends.wordpress.com
|
|
| | | | | I recently came across this theorem on John Cook's blog that I wanted to keep for myself for future reference: Theorem. Let $latex f$ be a function so that $latex f^{(n+1)}$ is continuous on $latex [a,b]$ and satisfies $latex |f^{(n+1)}(x)| \leq M$. Let $latex p$ be a polynomial of degree $latex \leq n$ that interpolates... | |
| | | | |
mikespivey.wordpress.com
|
|
| | | | | A few months ago Mathematics Magazine published a paper of mine, "A Combinatorial View of Sums of Powers." In it I give a combinatorial interpretation for the power sum $latex \sum_{k=1}^n k^m$, together with combinatorial proofs of two formulas for this power sum. (An earlier version of some of the results in this paper actually... | |
| | | | |
rapuran.wordpress.com
|
|
| | | More on Weekly Travel Theme | ||
