Is fermat last theorem the new fizzbuzz? come on, if you can't solve it you are not gonna make it

is fermat last theorem the new fizzbuzz? come on, if you can't solve it you are not gonna make it

Attached: 1627675821639.jpg (750x517, 49.27K)

a, b=0
c=1

>0+0=1

Attached: 1623194317044.jpg (558x614, 27.18K)

please someone post a solution

Attached: uc82upz3yrw71.png (1467x1440, 160.44K)

The theorem is true, no such equation exists

Now prove it on this whiteboard in Python

It's simple
>enumerate all tuples (a, b, c, n) with n > 2
>stop when you find one that satisfies the equation
Then you just prove that the program won't halt. Easy. I could do it, but it wouldn't quite fit in this post.

Whoops, forgot the whiteboard. Here you go, let me just erase the last guys answer...

Attached: whiteboard.jpg (1000x1000, 130.19K)

>>enumerate all tuples
Will that itself not take forever

a=0
b=0
c=0

Read the statement, nigger
Positive integers

>0
>positive integer
single digit IQ

if a, b, c and n are {1..100}, then you will have 100^4 combinations which is 100 million

0 are positive

32 + 42 = 52

Fuck

3^2 + 4^2 = 5^2

another special education preschool group seems to browse Any Forums. sad

n>2 bro
Holy shit why is reading comprehension of Any Forums so shit

Hence the 'stop' condition.
Yes, and? It's about the proof, not about running the program.

Seriously, does no one even read anymore?

only Coq solutions accepted

whats the use case of this besides doing 1 python script in 1 obscure math class in universtiy?

Nice basic reading skills

I found a nice proof but unfortunately the character limit on Any Forums is too low to post it.

this

0 isn't positive, and even if it was, it would be all 0, why tf would c be 1.

if only there were exist a pythagorean triple where every integer is a quadratic number