/explore
|
You are here 
|
jiggerwit.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... | |
| | | | |
mathematicaloddsandends.wordpress.com
|
|
| | | | | I recently came across this theorem on John Cook's blog that I wanted to keep for myself for future reference: Theorem. Let $latex f$ be a function so that $latex f^{(n+1)}$ is continuous on $latex [a,b]$ and satisfies $latex |f^{(n+1)}(x)| \leq M$. Let $latex p$ be a polynomial of degree $latex \leq n$ that interpolates... | |
| | | | |
polyfree.wordpress.com
|
|
| | | | | A method using flow networks with costs to realize logical gates. This would suggest a polynomial time approach to solve 3-SAT and 3-DIM-Matching instances. Probability is high that there is some flaw... [my goal with this is having fun exploring interesting questions with the limited tools I have at my disposal, and hopefully gain some... | |
| | | | |
www.3blue1brown.com
|
|
| | | An overview of gradient descent in the context of neural networks. This is a method used widely throughout machine learning for optimizing how a computer performs on certain tasks. | ||
