[seqfan] Re: 3, 5

israel at math.ubc.ca israel at math.ubc.ca
Wed Dec 5 13:41:59 CET 2018


 It's always true mod 2. Mod prime p > 3, using Fermat's little theorem it 
reduces to 3^(-1) - 3^3 == 0, i.e. -80/3 == 0, and since the only odd prime 
factor of 80 is 5 there are no other prime solutions.

Cheers,
Robert 
 


On Dec 5 2018, юрий герасимов wrote:

> Dear SeqFans, that are the other prime solutions to 
> (3^(2*p-3)+(2*p-3)^3)==0 mod (2p)? Thanks you.юрий герасимов P.S. 
> Composite solutions are 4, 2123, 29158, 31903, 35003, 550243...
>
>--
>Seqfan Mailing list - http://list.seqfan.eu/
>
>



More information about the SeqFan mailing list