When we formulate an algorithm that allows us to prove the existence of a geometric object, can the algorithm be understood as non-constructive or constructive proof, given that the graphical representation of this object is necessarily constructive proof?
![พบรัก - INK WARUNTORN x FELLOW FELLOW [LIVE SESSION]](http://i.ytimg.com/vi/1VonHhP6_Y8/mqdefault.jpg)
When we formulate an algorithm that allows us to prove the existence of a geometric object, can the algorithm be understood as non-constructive or constructive proof, given that the graphical representation of this object is necessarily constructive proof?
This was so helpful, I almost started crying.
Much appriciated , thanks for your hardwork fellas
I love these videos, they're very good!
in the last example how do you know you have to take value of x y and z as 1 -1 and -1 , why not 1 1 and 1
Great video! Thanks
can you tell me when we use the exhaustion or existence proof?
How did you get the y for the first constructive proof?
There is formula that called discriminant. It helps you to find the roots of equation.
are you mathematician? or have any degree in mathematics?