Femat's Last Theorem in #StarTrek

#StarTrek out of Context #164
Star Trek: The Next Generation | The Royale (2x12)

[dudefromkansas]

Thanks for putting the update on it in the video. Seriously, thanks.

Ask the Enterprise computer to solve it.

[vincekissinger]

John Nash said in an interview he gave that this was already solved long ago.

[gnarkillgnarkill]

You would think that for the entire Star Trek universe even to exist this theorem would have to have been proven, the computer that runs the replicator could have solved it.😂

[Rikerish]

An Englishman takes on the mantle of a Frenchman, Trek predicts the future once again 😳

[gkpr]

I think a bigger mystery is how an English actor playing a French character in the future pronounces Zed incorrectly.

[DanielGronau-ff]

Fermat was very likely mistaken. The case n=4 was already solved, he probably found a proof of case n=3, and thought that it could be generalized (It actually could, but not to all primes).

[archindar]

This still holds true if you simply take it as an personal test, maybe people just try to proof this specific one because french romance!@

[robertpesche]

Such a shame that they found a proof not many years after this aired. Didn’t age well.

[dduff]

Similar to the Pythagorean Theorem, except in that, n IS 2.

[princessstokes]

X TO THE N + Y TO THE n = Z TO THE N, N>2 (MEANING IT'S HOW YOU LOOK @ IT)
=Zn, n>2... . NICE😊

[michaeloppenheimer]

I will give you the key to the solution is to rewrite the equation.

[andytomhall]

Zaid not zee, it's called English for a reason.

[michaeloppenheimer]

It's beautiful and yet we are unable to solve it even to this day.