mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math > Number Theory Discussion Group

Reply
 
Thread Tools
Old 2017-11-08, 03:45   #1
devarajkandadai
 
devarajkandadai's Avatar
 
May 2004

1001111002 Posts
Default Modified Fermat's theorem

Works when the base is a Gausian integer as well as Z + Z*I*sqroot(7). Members may recall that Modified Fermat's theorem as a^(p^2-1) = = 1 (mod p) where p is
prime of shape 3m + 1 or 4m+3.
devarajkandadai is offline   Reply With Quote
Old 2017-11-10, 03:58   #2
devarajkandadai
 
devarajkandadai's Avatar
 
May 2004

22·79 Posts
Default

Quote:
Originally Posted by devarajkandadai View Post
Works when the base is a Gausian integer as well as Z + Z*I*sqroot(7). Members may recall that Modified Fermat's theorem as a^(p^2-1) = = 1 (mod p) where p is
prime of shape 3m + 1 or 4m+3.
Of course a and p have to be coprime.
devarajkandadai is offline   Reply With Quote
Old 2017-11-10, 11:33   #3
devarajkandadai
 
devarajkandadai's Avatar
 
May 2004

22×79 Posts
Default Modified Fermat's theorem

This has been practically proved for Gaussian integer and bases a + b*sqrt(5).
see (Hardy's intro to number theory and Pollard's intro to algebraic number theory.For the rest of quadratic algebraic integers I do not know about proofs.However I can, with the help of pari, say what it works for. In my next post
will give a few for which this conjecture seems to be valid.
devarajkandadai is offline   Reply With Quote
Old 2017-11-12, 03:47   #4
devarajkandadai
 
devarajkandadai's Avatar
 
May 2004

22·79 Posts
Default

Quote:
Originally Posted by devarajkandadai View Post
This has been practically proved for Gaussian integer and bases a + b*sqrt(5).
see (Hardy's intro to number theory and Pollard's intro to algebraic number theory.For the rest of quadratic algebraic integers I do not know about proofs.However I can, with the help of pari, say what it works for. In my next post
will give a few for which this conjecture seems to be valid.
Mft works up to p = 89.Above this beyond pari(my version's capability ).
devarajkandadai is offline   Reply With Quote
Old 2017-11-12, 04:26   #5
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3·52·79 Posts
Default

Quote:
Originally Posted by devarajkandadai View Post
Mft works up to p = 89.Above this beyond pari(my version's capability ).
Really? Could you give an example of a calculation just beyond its ability?
CRGreathouse is offline   Reply With Quote
Old 2017-11-12, 10:07   #6
bhelmes
 
bhelmes's Avatar
 
Mar 2016

2×33×5 Posts
Default

Perhaps this might be helpful for you:
http://devalco.de/#104

Greetings from the primes
Bernhard
bhelmes is offline   Reply With Quote
Old 2017-11-12, 11:23   #7
devarajkandadai
 
devarajkandadai's Avatar
 
May 2004

31610 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
Really? Could you give an example of a calculation just beyond its ability?
Sure: consider Mod(x,x^2+97). Let this be %1. You have to calculate ((2+%1)^(101^2-1)/101.
Thank you.

Last fiddled with by devarajkandadai on 2017-11-12 at 11:30 Reason: Typo
devarajkandadai is offline   Reply With Quote
Old 2017-11-12, 11:34   #8
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by devarajkandadai View Post
Sure: consider Mod(x,x^2+97). Let this be %1. You have to calculate ((2+%1)^(101^2-1)/101.
Thank you.
no second ending parentheses on the other side of things ??
science_man_88 is offline   Reply With Quote
Old 2017-11-12, 15:39   #9
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

3·5·233 Posts
Default

The obvious "generalization of Fermat's theorem" is the generalization of Euler's theorem to number fields. This, in turn, is a special case of the result that, if G is a finite group, g is an element of G, and |G| the number of elements in G, then g|G| = 1, the identity of G. This is a consequence of Lagrange's theorem, applied to the cyclic group generated by g. The application to number fields is, R is the ring of algebraic integers of a number field K, I is a non-zero ideal of R, and G = (R/I)x the multiplicative group of invertible elements mod I (which is finite).
Dr Sardonicus is offline   Reply With Quote
Old 2017-11-12, 16:50   #10
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

9,127 Posts
Default

Quote:
Originally Posted by bhelmes View Post
Perhaps this might be helpful for you:
http://devalco.de/#104

Greetings from the primes
Bernhard
Mod warning: Another irrelevant plug for your webpages and you will receive a ban.

What the heck does it even have to do with the topic of this thread, huh?!
You just go from thread to thread and spam with "your website".

Greetings from the composites!
Have a nice day!
Batalov is offline   Reply With Quote
Old 2017-11-12, 17:09   #11
bhelmes
 
bhelmes's Avatar
 
Mar 2016

2·33·5 Posts
Default

Quote:
Originally Posted by Batalov View Post
Mod warning: Another irrelevant plug for your webpages and you will receive a ban.

What the heck does it even have to do with the topic of this thread, huh?!
You just go from thread to thread and spam with "your website".

As far as i understood the OP has tried to deal with a+bI ( a complex number) and a+b*sqrt (A) and the cycle construction concerning the primes

In the given link you find a detailled version to the different cycle construction.
This was a gentle and completely correct mathematic link.
Besides you will not find this detailled information some where else.

The link i have given is a part of nice mathematic and programmed skill.

It is not nice to shoot with big guns, without any reason.

By the way, i have dealt since some times with primes,
and i have spent a lot of work to give a clear information about some prime topics on my website.

You do not seem to appriciate my own work.

Primes are very beautiful flowers
Greetings from the primes
Bernhard
bhelmes is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Conjecture pertaining to modified Fermat's theorem devarajkandadai Number Theory Discussion Group 12 2017-12-25 05:43
modified Euler's generalisation of Fermat's theorem devarajkandadai Number Theory Discussion Group 1 2017-07-07 13:56
Modified Fermat pseudoprime devarajkandadai Number Theory Discussion Group 0 2017-06-24 12:11
Modified Fermat's theorem devarajkandadai Number Theory Discussion Group 2 2017-06-23 04:39
Modified fermat's last theorem Citrix Math 24 2007-05-17 21:08

All times are UTC. The time now is 05:25.

Thu Oct 1 05:25:33 UTC 2020 up 21 days, 2:36, 0 users, load averages: 1.49, 1.58, 1.62

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.