Fermat's Last Theorem

Number Theory Level 3

How many solutions ( a , b , c , n ) (a,b,c,n) are there to the equation a n + b n = c n a^n+b^n=c^n for n > 2 n > 2 and a , b , c , n ∈ Z a,b,c,n\in \mathbb Z

0 Uncountably Infinitely Many Countably Infinitely Many Finitely Many

Logan Dymond by Logan Dymond , 25, USA

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Logan Dymond
Apr 2, 2014

Note that the set of all ( a , b , c , n ) (a,b,c,n) for n > 2 n>2 and a , b , c , n ∈ Z a,b,c,n \in \mathbb Z is countably infinite, so our solution set is at most countably infinite. Also note that all quadruples of the form ( 0 , 0 , 0 , n ) (0,0,0,n) satisfy the equation. Thus, our solution set is Countably Infinite.

5 Helpful 0 Interesting 0 Brilliant 0 Confused

April Fools again

Logan Dymond - 7 years, 2 months ago

Log in to reply

You suck!

Mardokay Mosazghi - 7 years, 2 months ago

1st April is long gone.

Anish Puthuraya - 7 years, 2 months ago

Log in to reply

Agreed...I accidentally chose the right option...his previous question sucked to the core...

Tanya Gupta - 7 years, 2 months ago

Ha Ha nice work...i really felt i am April Fooled after this question

Aabhas Mathur - 7 years, 2 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...