2017-10-05, 04:54 | #1 |
May 2004
2^{2}·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. |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Gaussian Aliquot Sequences? How to run in Pari/GP? | Stargate38 | Aliquot Sequences | 40 | 2019-11-30 11:14 |
pari-algorithm for finding Gaussian integer bases | devarajkandadai | Software | 0 | 2017-07-11 05:42 |
OEIS - 2^n-5 - LLT-like algorithm for finding PRPs | T.Rex | Miscellaneous Math | 13 | 2015-09-01 13:09 |
Finding a smooth integer in a given residue class | Alexander | Math | 32 | 2012-05-09 13:09 |
Big integer speed in bases. | meknowsnothing | Math | 7 | 2008-12-02 12:41 |