| Computing desk | ||
|---|---|---|
| < May 22 | << Apr | May | Jun >> | May 24 > |
| Welcome to the Wikipedia Computing Reference Desk Archives |
|---|
| The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
I am trying to run the following in PARI/GP:
forprime(n=2, 1e6, (m=n && while(Mod((2^3510-1), m)==0, print1(n, ", ") && m=m*n)))
What I want to do is to find the prime factors of 23510-1 with repeated factors reported as often as the exponent in the highest power of that factor dividing 23510-1. It currently quits with an error saying Mod: impossible inverse in dvmdii: 0. Is this PARIs way of saying a division by 0 error occurs or what does this message mean? -- Toshio Yamaguchi 08:50, 23 May 2014 (UTC)
forprime(n=2, 1e6, m=n; while(Mod((2^3510-1), m)==0, print1(n, ", "); m=m*n))
forprime(n=2, 1e6, m=n; while(Mod(2,m)^3510-1==0, print1(n, ", "); m=m*n))
forprime(n=2, 1e6, m=n; while((2^3510-1)%m==0, print1(n, ", "); m=m*n))
I would guess at a minimum that the sender would know it is a valid address, but what else (wondering, of course, how I could be harmed)? --173.30.53.201 (talk) 18:47, 23 May 2014 (UTC)