So 4 colours equals 10 pair combinations. A 4 colour sudoku problem converts to 10 grids with 2 1's in each of the rows subgrids and columns. So if you try and eliminate the possible 1's by doing sweeps checking each of the 1's for a conflict in any of the grids at least one of the possible 1's is in conflict gauranteed every sweep or the sudoku is unsolvable. P might equal np due to this find.
2:09...hmm...I know someone who has asked himself that question, lol...the problem with pictures is that they are, perhaps, less abstract, usually, they show one example...if a picture could encompass all examples, I suppose it would be possible, lol...I mean...I'm not sure I can think of a situation where it would...even if you draw a graph of a function, or a triangle with equal sides, etc, lol, when a problem is only dealing with that specific case, etc, then one can always say that it's not forcibly drawn to scale or something, I don't know, lol...if a picture encompasses all possible cases, then I guess it would be valid as a proof, lol...
I would like to believe that a proof for the Goldbach conjecture exists if the logistic map equation 4 x • x ( x - 1 ) is a stable rather than a chaotic system but my proof for this is lost in a storm that used to be in a teacup.
Blade Runner brought me here😂. Was watching the movie then thought about Growers great seminar at the College de France on Proofs and remembered Tao coming to Paris to tell us about computers assisting for proofs😅
this conversation is wonderful, such a pleasure to listen, thanks for posting it!
A very pleasurable listen.
I really enjoyed the room's reaction at 39:05😁
😂😂😂😂
Here from proof assistants SE :)
Looking forward to this conversation! What's the piano piece at the beginning?
저는 저차원 고차원에 살고 있는 존재가 제 지능을 이루고 있다고 체감상 느낍니다.
So 4 colours equals 10 pair combinations. A 4 colour sudoku problem converts to 10 grids with 2 1's in each of the rows subgrids and columns. So if you try and eliminate the possible 1's by doing sweeps checking each of the 1's for a conflict in any of the grids at least one of the possible 1's is in conflict gauranteed every sweep or the sudoku is unsolvable. P might equal np due to this find.
2:09...hmm...I know someone who has asked himself that question, lol...the problem with pictures is that they are, perhaps, less abstract, usually, they show one example...if a picture could encompass all examples, I suppose it would be possible, lol...I mean...I'm not sure I can think of a situation where it would...even if you draw a graph of a function, or a triangle with equal sides, etc, lol, when a problem is only dealing with that specific case, etc, then one can always say that it's not forcibly drawn to scale or something, I don't know, lol...if a picture encompasses all possible cases, then I guess it would be valid as a proof, lol...
I would like to believe that a proof for the Goldbach conjecture exists if the logistic map equation 4 x • x ( x - 1 ) is a stable rather than a chaotic system but my proof for this is lost in a storm that used to be in a teacup.
So, me je regarde la correction if i dont understand the problem
Blade Runner brought me here😂. Was watching the movie then thought about Growers great seminar at the College de France on Proofs and remembered Tao coming to Paris to tell us about computers assisting for proofs😅
Lol...
Las damas van primero.
Terry Tao is a great writer of mathematics but a horrible speaker. Every time I hear him talk I cringe.