Explore >> Select a destination
|
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... | |
| | | | |
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.jeremykun.com
|
|
| | | | | This proof assumes knowledge of complex analysis, specifically the notions of analytic functions and Liouville's Theorem (which we will state below). The fundamental theorem of algebra has quite a few number of proofs (enough to fill a book!). In fact, it seems a new tool in mathematics can prove its worth by being able to prove the fundamental theorem in a different way. This series of proofs of the fundamental theorem also highlights how in mathematics there are many many ways to prove a single theorem... | |
| | | | |
chava61photography.photo.blog
|
|
| | | Visit the post for more. | ||
