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.independent

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:43 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Tuesday, July 15, 2014 12:35:33 AM UTC-4, quasi wrote:
> robersi730 wrote:
>

> >
>
> >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
>
>
>
> No, I don't accept that.
>
>
>
> Your proof of the above only works if n _doesn't_ divide abc.
>
>
>
> quasi



a^p = -b^p mod (p^p)

if p divides c

a=-b mod p by F Little T

a = -b + pq

and not

a = -b + p^2q'

*note p does not divide q

binomial expansion yield from the former

a^p = -b^p mod (p^2 not p^3)

contradiction. therefore

a + b = 0 mod p^2

and

a^p + b^p = a + b mod p^2

when p|c

(p doesn't divide ab *said w.o.l.o.g.)


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.