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

 2017-07-11, 05:42 #1 devarajkandadai     May 2004 22·79 Posts pari-algorithm for finding Gaussian integer bases For purpose of this illustration I use the composite number 105=3*5*7 Algorithm for finding suitable bases in the ring of Gaussian integers. a) In pari run the programme { is(n)=Mod(n,105)^104==1} b) select(is,[1..100]); we now get several rational integer bases for pseudoprimality of 104. For purpose of this illustration I have selected 3 viz 8, 22 and 29. split 8 into two parts one real and the other imaginary such that each has two or three of the factors of 105- hence we get (15-6*I). Thisis a suitable base for pseudoprimality of 105. Similarly we can split 22 into (15+7*I) and 29 into (14+15Î).

 Similar Threads Thread Thread Starter Forum Replies Last Post Stargate38 Aliquot Sequences 40 2019-11-30 11:14 devarajkandadai Software 0 2017-10-05 04:54 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 21:29.

Fri Jan 15 21:29:04 UTC 2021 up 43 days, 17:40, 0 users, load averages: 2.39, 2.66, 2.63