Explore >> Select a destination
|
You are here 
|
rjlipton.com | ||
| | | | |
njwildberger.com
|
|
| | | | | This semester I have been on Long Service Leave, so I am off the hook for teaching, and can spend more time with my graduate students Ali Alkhaldi and Nguyen Le, do some investigations into hyperbolic geometry and related issues, make more videos, and do some travelling. Ali is in his fourth year of the... | |
| | | | |
anuragbishnoi.wordpress.com
|
|
| | | | | The Ramsey number $latex R(s, t)$ is the smallest $latex n$ such that every graph on $latex \geq n$ vertices either contains a clique of size $latex s$ or an independent set of size $latex t$. Ramsey's theorem implies that these numbers always exist, and determining them (precisely or asymptotically) has been a major challenge... | |
| | | | |
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$. | |
| | | | |
hackmd.io
|
|
| | | |||
