/explore
|
You are here 
|
dominiczypen.wordpress.com | ||
| | | | |
mikespivey.wordpress.com
The Riemann zeta function $latex \zeta(s)$ can be expressed as $latex \zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s}$, for complex numbers s whose real part is greater than 1. By analytic continuation, $latex \zeta(s)$ can be extended to all complex numbers except where $latex s = 1$. The power sum $latex S_a(M)$ is given by $latex S_a(M) =... |
|
| | | | | ||
| | | | |
cuoichutdi.wordpress.com
Liverpool v?a vô ?ch Premier League, ?i?u này t?o nên m?t th?ng kê thú v?: s? cúp vô ?ch c?a các ?i bóng t?o thành m?t dãy s? Fibonacci. ?i?u này là ng?u nhiên hay có m?t cách lí gi?i toán h?c ?n sau nó? Tôi biên bài báo ng?n v? dãy Fibonacci c?ng nh?... |
|
| | | | | ||
| | | | |
algorithmsoup.wordpress.com
In this post, I want to tell you about what I think might be the world's simplest interesting algorithm. The vertex cover problem. Given a graph $latex {G = (V, E)}&fg=000000$, we want to find the smallest set of vertices $latex {S \subseteq V}&fg=000000$ such that every edge $latex {e \in E}&fg=000000$ is covered by... |
|
| | | | | ||
| | | | |
ropmann.wordpress.com
Visit the post for more. |
|
| | | |||
