Package: pari

Version: 2.9.1

Trying to find the 10,000,000,000th prime with GP, is extremely slow (takes more than several minutes).

Here is a transcript:

Reading GPRC: /home/swampyx/.gprc ...Done.

                   GP/PARI CALCULATOR Version 2.9.1 (released)

          amd64 running linux (x86-64/GMP-6.1.1 kernel) 64-bit version

             compiled: Dec  2 2016, gcc version 6.2.1 20160830 (GCC)

                            threading engine: pthread

                 (readline v7.0 enabled, extended help enabled)

                     Copyright (C) 2000-2016 The PARI Group

PARI/GP is free software, covered by the GNU General Public License, and comes

WITHOUT ANY WARRANTY WHATSOEVER.

Type ? for help, \q to quit.

Type ?15 for how to get moral (and possibly technical) support.

parisizemax = 1000001536, primelimit = 500000, nbthreads = 2

? prime(10000000000)

^C  ***   at top-level: prime(10000000000)

  ***                 ^------------------

  *** prime: user interrupt after 2min, 28,030 ms

  ***   Break loop: <Return> to continue; 'break' to go back to GP prompt

break>

?

Goodbye!

I am using Arch GNU/Linux, kernel 4.9.0-1-ARCH and glibc 2.24-2.