Explore >> Select a destination
|
You are here 
|
statisticaloddsandends.wordpress.com | ||
| | | | |
juliawolffenotes.home.blog
|
|
| | | | | Recently Terry Tao posted to the arXiv his paper Almost all Collatz orbits attain almost bounded values, which caused quite the stir on social media. For instance, this Reddit post about it is only a day old and already has nearly a thousand upvotes; Twitter is abuzz with tweets like Tim Gowers': (this sentiment seems... | |
| | | | |
hbfs.wordpress.com
|
|
| | | | | $latex n!$ (and its logarithm) keep showing up in the analysis of algorithm. Unfortunately, it's very often unwieldy, and we use approximations of $latex n!$ (or $latex \log n!$) to simplify things. Let's examine a few! First, we have the most known of these approximations, the famous "Stirling formula": $latex \displaystyle n!=\sqrt{2\pi{}n}\left(\frac{n}{e}\right)^n\left(1+\frac{1}{12n}+\frac{1}{288n^2}-\frac{139}{51840n^3}-\cdots\right)$, Where the terms... | |
| | | | |
nickhar.wordpress.com
|
|
| | | | | The algorithm for probabilistically embedding metric spaces into trees has numerous theoretical applications. It is a key tool in the design of many approximation algorithms and online algorithms. Today we will illustrate the usefulness of these trees in designing an algorithm for the online Steiner tree problem. 1. Online Steiner Tree Let $latex {G=(V,E)}&fg=000000$ be... | |
| | | | |
jaketae.github.io
|
|
| | | "I think that's very unlikely." "No, you're probably right." | ||
