Explore >> Select a destination
|
You are here 
|
7stones.com | ||
| | | | |
rjlipton.com
|
|
| | | | | How to convince someone your proof is really a proof Roger Apéry was a mathematician who solved a beautiful problem that had been open for hundreds of years. He was not an amateur in any sense, but because his result was so surprising there was initial doubt about its correctness. Even professional mathematicians have some... | |
| | | | |
mattbaker.blog
|
|
| | | | | Today is the 10th anniversary of the death of Martin Gardner. His books on mathematics had a huge influence on me as a teenager, and I'm a fan of his writing on magic as well, but it was only last year that I branched out into reading some of his essays on philosophy, economics, religion,... | |
| | | | |
www.jeremykun.com
|
|
| | | | | Problem: Prove there are infinitely many prime numbers. Solution: First recall that an arithmetic progression with difference $ d$ is a sequence of integers $ a_n \subset \mathbb{Z}$ so that for every pair $ a_k, a_{k+1}$ the difference $ a_{k+1} - a_k = d$. We proceed be defining a topology on the set of integers by defining a basis $ B$ of unbounded (in both directions) arithmetic progressions. That is, an open set in this topology is an arbitrary union of arithmetic progressions from $ -\infty$ to $ \infty$. | |
| | | | |
qualiacomputing.com
|
|
| | | "It seems plain and self-evident, yet it needs to be said: the isolated knowledge obtained by a group of specialists in a narrow field has in itself no value whatsoever, but only in its synthesis with all the rest of knowledge and only inasmuch as it really contributes in this synthesis toward answering the demand,... | ||
