My Math Forum  

Go Back   My Math Forum > College Math Forum > Number Theory

Number Theory Number Theory Math Forum

LinkBack Thread Tools Display Modes
April 26th, 2014, 11:08 AM   #1
Joined: Apr 2014
From: USA

Posts: 11
Thanks: 0

Bad "Proof" of Fermat's Last explained (in 3-5 minutes)

I had to comment on the error in a closed post.

The argument boiled down to:

$\displaystyle z = (C^n - B^n)/(A^{n-2})$

where z is an integer. The post claimed this is an immediate contradiction as the GCD of A, B, and C are 1. I can find many examples of (A, B, C, z) that work for n = 3.

Simply let A = C - B where gcd(B, C) = 1

$\displaystyle 9^3 - 4^3$ is divisible by $\displaystyle 5^1$.
$\displaystyle 23^3 - 7^3$ is divisible by $\displaystyle 16^1$.

Suppose you want a counterexample for n > 3. If n = 11, we see that:

$\displaystyle (A = 2^9, B = 1001, C = 1001 + 2^9, z = (C^{11} - B^{11})/(2^9))$

is a perfectly good counterexample.

-- MMG

Last edited by mobilemathguy; April 26th, 2014 at 11:11 AM.
mobilemathguy is offline  

  My Math Forum > College Math Forum > Number Theory

bad, explained, fermat, minutes, proof

Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
Book/article describing the process of "creating" the proof honzik Math Books 3 June 11th, 2012 01:49 PM
A "simple" application of dirac delta "shift theorem" SedaKhold Calculus 0 February 13th, 2012 12:45 PM
"separate and integrate" or "Orangutang method" The Chaz Calculus 1 August 5th, 2011 10:03 PM
"Mathematical Logic" by Cori and Lascar: Incomplete proof? omoplata Applied Math 4 June 3rd, 2011 03:53 PM
sample exeriment-need help finding "statistic" and "result" katie0127 Advanced Statistics 0 December 3rd, 2008 02:54 PM

Copyright © 2019 My Math Forum. All rights reserved.