mersenneforum.org pari-algorithm for finding Gaussian integer bases
 Register FAQ Search Today's Posts Mark Forums Read

 2017-10-05, 04:54 #1 devarajkandadai     May 2004 22·79 Posts pari-algorithm for finding Gaussian integer bases For finding rational integer bases for Fermat pseudoprimality of composite (square-free) composite numbers we need the following program in pari: {is(n)=Mod(n,N)^(N-1)==1} Next select(is,[1..1000]) However for finding Gaussian integer bases for the same we do not need pari. Let N= m.r.p , say, where m, r and p are all prime. Then one of the combinations of m,r and p,one at a time or two at a time, or definitely three at a time plus I works.Example - 105 = 3*5*7 Here 15+ 7*i , or 21 + 5*I will work; in any case 105 + I will work. Of course you need pari to verify.

 Similar Threads Thread Thread Starter Forum Replies Last Post Stargate38 Aliquot Sequences 40 2019-11-30 11:14 devarajkandadai Software 0 2017-07-11 05:42 T.Rex Miscellaneous Math 13 2015-09-01 13:09 Alexander Math 32 2012-05-09 13:09 meknowsnothing Math 7 2008-12-02 12:41

All times are UTC. The time now is 08:55.

Sun Dec 4 08:55:13 UTC 2022 up 108 days, 6:23, 0 users, load averages: 1.06, 0.89, 0.85