Explore >> Select a destination
|
You are here 
|
xenaproject.wordpress.com | ||
| | | | |
algorithmsoup.wordpress.com
|
|
| | | | | The ``probabilistic method'' is the art of applying probabilistic thinking to non-probabilistic problems. Applications of the probabilistic method often feel like magic. Here is my favorite example: Theorem (Erdös, 1965). Call a set $latex {X}&fg=000000$ sum-free if for all $latex {a, b \in X}&fg=000000$, we have $latex {a + b \not\in X}&fg=000000$. For any finite... | |
| | | | |
jiggerwit.wordpress.com
|
|
| | | | | What follows are the opening paragraphs of a pdf document giving an argument for controlled natural languages in mathematics. At the recent Big Proof 2 conference in Edinburgh, I realized that a case must be made for developing a controlled natural language for mathematics. There is little consensus on this issue, and mathematicians and computer... | |
| | | | |
micromath.wordpress.com
|
|
| | | | | Continuing the theme of alternative approaches to teaching calculus, I take the liberty of posting a letter sent by Donald Knuth to to the Notices of the American Mathematical Society in March, 1998 (TeX file). Professor Anthony W. Knapp P O Box 333 East Setauket, NY 11733 Dear editor, I am pleased to see so... | |
| | | | |
nhigham.com
|
|
| | | The pseudoinverse is an extension of the concept of the inverse of a nonsingular square matrix to singular matrices and rectangular matrices. It is one of many generalized inverses, but the one most useful in practice as it has a number of special properties. The pseudoinverse of a matrix $latex A\in\mathbb{C}^{m\times n}$ is an $latex... | ||
