I will reduce the number of examples or patterns by V-merge.
Erase all colours on the map, pull and drag C,h together by extending the lines to C,h, that will merge C,h to form a node called V1, the same reason, merge V1 and D to form V2, right now there are two nodes less, so after putting...
I had forgot to tell you that this is just a first part of my proof. You are almost right, I try to construct 5 colors map, and try to find the rules of degree on a node, and at last no map can match that node.d. But I was not sure you can read my english, but you can guess some of my mind. I...
line-node-map is formed by lines and nodes, commonly used by the one (including me) who reseaches four colour theorem.
Smallest five colours map is the one with fewest number of nodes and couldn't be coloured less than five colours, and also, it can be a complete map by adding lines not nodes...
I think I know what the difference between us. You are focusing on the proof, I know I referred Fermat's in my observation. I focus on the result (after proving) which I think others ignored 300 years.
Even if they/you own the enough knowledge to prove it, it doesn't mean you notice how to prove it. All of our words learning from parents/books/films etc which are full in the proof, so there wouldn't "proof" existed?
There is no link out there saying human beings except AndrewWiles, improve the number of n to 1000, unless visiting this page, then "everyone" can see it is not my proof including you.
N=3,4,5 has been proved hundreds of years ago, if let them mix and mix in my proof can get N more dense, but far away from complete dense. Only Andrew Wiles has the full proof.
Have I proved Fermat last theorem?
X^4 + Y^4 != Z^4 has been proved by Fermat that if X,Y,Z = integer numbers, the formular is fine. Set x=X^2, y=Y^2, z=Z^2, so x, y, z are (some) integer numbers based on X,Y,Z.
x^4 + y^4 != z^4 //x, y, z are still integer, would be obey to Fermat's Fermat...