
Number Theory Number Theory Math Forum 
 LinkBack  Thread Tools  Display Modes 
June 26th, 2015, 01:21 AM  #1 
Newbie Joined: Jun 2015 From: Arizona (hot) Posts: 1 Thanks: 0  Proving FLT with Congruences?
New member, happy to be here. Greetings to everyone, including Greathouse and our friend Stefano. I think I've got just such a proof ready. Yet there are rumors that it can't be done with congruences. Some sort of algebraic structure that always balances the congruences, perhaps? I figure I've gotten around that by introducing another variable and choosing the right modulus. Any comments on the general issue of congruences at this point? I'll soon post what I believe to be a valid proof for all odd prime n. Last edited by jrcummings; June 26th, 2015 at 01:54 AM. Reason: Edited for Clarity 

Tags 
congruences, flt, proving 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
congruences  Leonhard Euler  Number Theory  0  October 22nd, 2014 03:09 AM 
Induction and congruences...  john616  Number Theory  1  March 25th, 2012 02:44 PM 
Congruences II  john616  Number Theory  6  March 16th, 2012 01:32 PM 
Congruences  john616  Number Theory  7  March 6th, 2012 07:58 PM 
Congruences  h05  Number Theory  2  October 15th, 2008 02:15 PM 