Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
Replies: 24   Last Post: Jul 15, 2014 2:04 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
robersi

Posts: 116
From: NYS
Registered: 8/18/09
Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
Posted: Jul 15, 2014 12:00 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Monday, July 14, 2014 11:48:21 PM UTC-4, quasi wrote:
> >robersi730 wrote:
>
> >>quasi wrote:
>
> >>robersi730 wrote:
>
> >>>
>
> >>>also I can prove n doesn't divide the product abc
>
> >>
>
> >>Not believable (unless you plan to invoke Wiles' Theorem).
>
> >
>
> >I can, I did, and I can.
>
>
>
> So let me get this straight ...
>
>
>
> Are you claiming that you have an elementary proof that the
>
> equation
>
>
>
> a^p + b^p = c^p
>
>
>
> where
>
>
>
> p is an odd prime
>
> a,b,c are pairwise coprime nonzero integers
>
> p divides abc
>
>
>
> has no solutions?
>
>
>
> In other words, you claim to have an elementary proof that
>
> case (2) of FLT is impossible?
>
>
>
> Your pdf article (from 2011) definitely fails to achieve that
>
> goal.
>
>
>
> If you think you have a proof, let's see it.
>
>
>
> quasi


I am only claiming I had the logic for

a + b = c mod n^2
a^n = a mod n^2
b^n = b mod n^2
c^n = c mod n^2

regardless of whether n divides abc or not

and then logic for the proof

n does not divide abc

and then showing {if

(u-1)^n = u^n -1

has at most only two solutions}

then this proves FLT unless 2^n = 2 mod n^3.





Date Subject Author
7/12/14
Read (u-1)^n = u^n -1 (mod n^3) more than two solutions?
robersi
7/12/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
Brian Q. Hutchings
7/12/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
robersi
7/12/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
quasi
7/12/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
robersi
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
robersi
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
quasi
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
robersi
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
quasi
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
quasi
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
robersi
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
robersi
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
quasi
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
quasi
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
robersi
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
quasi
7/15/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
robersi
7/15/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
quasi
7/15/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
robersi
7/15/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
quasi
7/15/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
quasi
7/13/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
quasi
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
Timothy Murphy
7/14/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
James Waldby
7/13/14
Read Re: (u-1)^n = u^n -1 (mod n^3) more than two solutions?
robersi

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.