Explore >> Select a destination
|
You are here 
|
mikespivey.wordpress.com | ||
| | | | |
mkatkov.wordpress.com
|
|
| | | | | Edit 6.6.2016. Premature optimization is a source for errors. The following is completely wrong. Would like to smoke the same thing again. Linear algebra does not work here. We need characterization of quotient space. What I do not understand is why fast methods are working modulo number itself, but not other prime numbers. Suppose we... | |
| | | | |
rhubbarb.wordpress.com
|
|
| | | | | My previous post was written with the help of a few very useful tools: LaTeX mathematical typesetting Gummi LaTeX editor Python programming language PyX Python / LaTeX graphics package my own PyPyX wrapper around PyX LaTeX2WP script for easy conversion from LaTeX to WordPress HTML | |
| | | | |
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... | |
| | | | |
moviezime.wordpress.com
|
|
| | | Depressing and faintly terrifying days for the C standard [pdf] 2 by signa11 | 0 comments on Hacker News. | ||
