Hello, and welcome to Wikipedia! We welcome and appreciate your contributions, such as those in Number theory, but we regretfully cannot accept original research. Please be prepared to cite a reliable source for all of your information. Thanks for your efforts, and happy editing! -GTBacchus(talk) 15:32, 26 May 2006 (UTC)Reply

Please refrain from adding your original research to the page Number theory. Please familiarize yourself with our policy: Wikipedia:No original research. Thank you for understanding. -GTBacchus(talk) 15:54, 26 May 2006 (UTC)Reply


simple and elementary proof of fermats last theorem is possible.

like , like , ,here when "a" is an odd natural number,"b" is any natural number other then "a" and "n" is any prime number or the factors of "n" are the same prime (here the multiples of 5 like 25,125 etc are excluded but the case of 5 is included)then "k" will always be prime. From this information we can prove very easily that it is impossible to write

                                      
                                                  or
                                      
                                                  for n>2. Bhowmickr 13:54, 31 August 2006 (UTC)Reply