Ahmad Kamal on Wed, 11 Jul 2012 11:34:20 +0200

 Hello

• To: pari-users@pari.math.u-bordeaux1.fr
• Subject: Hello
• Date: Wed, 11 Jul 2012 12:34:12 +0300
• Delivery-date: Wed, 11 Jul 2012 11:34:25 +0200
• Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:date:message-id:subject:from:to:content-type; bh=taUtmGAm7VQaX1mY324yGKY8/gvdGUL7ZGwtCCj9fO0=; b=Ap71FgtuSHj/e6iKxLBiAb1AmmXatI5sKY0enoL4HxYxw/iu3Na/ecYUDDdopcC82k 06oc2dyTjdzTnMHdbuhmKUx1cL1JSg5cxOrcQI8/ZZQRoafelr6qcpttwf8TlACA346E rfIf+C4iUmvMxpVM5R1laTKrbGWp7jWRpV5LbntK17Qj/Ypq3ay5PMF1jEoYRHiRKlpk clHvkCWqgTcjIJ8mo5IvUcRaNVMODchCqVm94SvZulsu2K2EfXrNMIrAC4zgRixoJRkv qDIH9HXzhJ3TR8OITsrJ6AInrB7tkFgcMbBzwl76mklYVukRgJs1OOuIYuUCQthhsVc+ aVtQ==

what if i want to be sure that x has an inverse Mod p .

cause in the following program it always give an error :

n=5;
p=281040463189842761944876463095882573657425678131112457182259869008082819;
X=listcreate(n);
for(x=1,n,listput(X,random(p),x)) ;

invX=listcreate(n);
for(x=1,n,listput(invX,lift(Mod(X[x],p)^-1),x)) ;

• Follow-Ups:
• Re: Hello