Explore >> Select a destination
|
You are here 
|
thehighergeometer.wordpress.com | ||
| | | | |
dominiczypen.wordpress.com
|
|
| | | | | The starting point of this blog post is a slight reformulation of the $latex T_0$ separation axiom: A topological space $latex (X,\tau)$ is $latex T_0$ if for all $latex x\neq y\in X$ there is a set $latex U\in \tau$ such that $latex \{x,y\}\cap U \neq \emptyset \text{ and } \{x,y\}\not\subseteq U.$ Given a cardinal $latex... | |
| | | | |
mikespivey.wordpress.com
|
|
| | | | | Equations of the form $latex x^3 = y^2 + k$ are called Mordell equations. In this post we're going to prove that the equation $latex x^3 = y^2 -7$ has no integer solutions, using (with one exception) nothing more complicated than congruences. Theorem: There are no integer solutions to the equation $latex x^3 = y^2... | |
| | | | |
algorithmsoup.wordpress.com
|
|
| | | | | The ``probabilistic method'' is the art of applying probabilistic thinking to non-probabilistic problems. Applications of the probabilistic method often feel like magic. Here is my favorite example: Theorem (Erdös, 1965). Call a set $latex {X}&fg=000000$ sum-free if for all $latex {a, b \in X}&fg=000000$, we have $latex {a + b \not\in X}&fg=000000$. For any finite... | |
| | | | |
allfaff.wordpress.com
|
|
| | | Visit the post for more. | ||
