Explore >> Select a destination
|
You are here 
|
awwalker.com | ||
| | | | |
mattbaker.blog
|
|
| | | | | On Pi Day 2016, I wrote inthis post about the remarkable fact, discovered by Euler, thatthe probability that two randomly chosen integers have no prime factors in common is $latex \frac{6}{\pi^2}$. The proof makes use of the famous identity $latex \sum_{n=1}^\infty \frac{1}{n^2} = \frac{\pi^2}{6}$, often referred to as the "Basel problem", which is also due... | |
| | | | |
www.jeremykun.com
|
|
| | | | | Problem: Prove there are infinitely many primes Solution: Denote by $ \pi(n)$ the number of primes less than or equal to $ n$. We will give a lower bound on $ \pi(n)$ which increases without bound as $ n \to \infty$. Note that every number $ n$ can be factored as the product of a square free number $ r$ (a number which no square divides) and a square $ s^2$. | |
| | | | |
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) =... | |
| | | | |
iamirmasoud.com
|
|
| | | Amir Masoud Sefidian | ||
