Explore >> Select a destination
|
You are here 
|
algorithmsoup.wordpress.com | ||
| | | | |
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... | |
| | | | |
blog.georgeshakan.com
|
|
| | | | | I recently uploaded "On the largest sum-free subset problem in the integers," to the arXiv. Let $latex A \subset \mathbb{Z}$ be a finite subset of the integers. We say $latex A$ is sum-free if there are no solutions to $latex a + b = c,$ with $latex a,b,c \in A$. We define $latex S(A)$ to... | |
| | | | |
thehighergeometer.wordpress.com
|
|
| | | | | Here's a fun thing: if you want to generate a random finite $latex T_0$ space, instead select a random subset from $latex \mathbb{S}^n$, the $latex n$-fold power of the Sierpinski space $latex \mathbb{S}$, since every $latex T_0$ space embeds into some (arbitrary) product of copies of the Sierpinski space. (Recall that $latex \mathbb{S}$ has underlying... | |
| | | | |
rapuran.wordpress.com
|
|
| | | More on Weekly Travel Theme | ||
