Category:PARI/GP: Difference between revisions

PARI/GP
This programming language may be used to instruct a computer to perform a task.

Official website

Execution method:	Interpreted or compiled
Garbage collected:	Yes
Parameter passing methods:	By reference, By value
Type strength:	Weak
Type checking:	Dynamic
Lang tag(s):	parigp, c
See Also:	PARI/GP compared to other languages

Listed below are all of the tasks on Rosetta Code which have been solved using PARI/GP.

PARI/GP is a widely used computer algebra system designed for fast computations in number theory (factorizations, algebraic number theory, elliptic curves...), but also contains a large number of other useful functions to compute with mathematical entities such as matrices, polynomials, power series, algebraic numbers etc., and a lot of transcendental functions.

PARI/GP is composed of two parts: a C library called PARI and an interface, gp, to this library. GP scripts are concise, easy to write, and resemble mathematical language. (Terminology: the scripting language of gp is called GP.)

PARI was written by Henri Cohen and others at Université de Bordeaux and is now maintained by Karim Belabas. gp was originally written by Dominique Bernardi, then maintained and enhanced by Karim Belabas and Ilya Zakharevich, and finally rewritten by Bill Allombert.

Getting PARI/GP

PARI/GP can be used in many different operating systems. For other systems, see the download page or the mailing lists.

Coding with PARI

The most common way to use PARI is through the gp calculator, using its own scripting language, GP. But there are other interfaces to PARI beside gp:

• PariGP on EmacsWiki, PariEmacs
• Pari-tty
• pariGUIde
• vim-notebook (see also the author's video on using gp from vim)
• Jupyter kernel

If you want to program with PARI, many languages are supported:

• C: PARI is written in C, so it's very easy to either write your own programs or extend gp using C. The gp2c utility converts GP scripts into executable C code.
  • For use with the Gnu Mpc library, there is also Pari-Gnump.
• C++: PARI can be used directly in C++. The code is intentionally written in a C++-compatible style. -fpermissive is sometimes useful when compiling with g++.
• Python:
  • SageMath (or SAGE) is a Python-based system that includes GP among others
  • pari-python
  • cypari is a fork of the GP component of SageMath
• Perl:
  • Math::Pari
  • GPP
• Common Lisp: Use Pari (CLISP).
• Mathematica: A quick tutorial using MathLink is available.

See also

• Wikipedia:PARI/GP

Resources

General

• PARI/GP FAQ
• Ateliers PARI/GP: Conference slides and other resources
• Comparison with Magma, GAP, and Singular

Tutorials

• Official tutorial by The PARI Group (52 pp., 2014)
• Tutorial on Elliptic Curves by Bill Allombert and Karim Belabas (5 pp., 2016)
• Beginning PARI Programming for CSE/MATH 467 by W. Dale Brownawell (7 pp., 2014)
• Tutorial by Robert B. Ash (20 pp., 2007)
• Tutorial by Siman Wong (6 pp., 2009)
• Introduction by Keith Conrad (7 pp., 2008)
• The Pari Package On Linux, by Klaus-Peter Nischke (3 pp., 1995)
• PARI/GP programming for basic cryptography by Minh Van Nguyen (appx. 3 pp., 2008); also appears in an extended version (9 pp., 2008)
• Exploring binary numbers with PARI/GP calculator by Rick Regan (appx. 4 pp., 2009)
• Video tutorials, parts 1 2 3 4 (appx. 20 minutes, 2011)
• Erste Schritte mit PARI/GP by Lars Fischer (13 pp., 2007; German)
• Class notes including PARI/GP tutorial and sample code by Masha Vlasenko (2013)
• Class notes, parts 12345sieve by Benjamin L. Levitt (41 pp., 2009; now offline?)
• Pari/GP Tutorial by Akinola Richard Olatokunbo
• Video demo of RSA in PARI/GP by Maren1955 (2014, 17:39)

Papers on PARI/GP

• Bill Alombert, A new interpretor for PARI/GP, Journal de Théorie des Nombres de Bordeaux 20:3 (2008), pp. 531–541. (English)
• Paul Zimmermann, The Ups and Downs of PARI/GP in the last 20 years, Explicit Methods in Number Theory, October 15th-19th 2007
• Robert H. Lewis and Michael Wester, Comparison of polynomial-oriented computer algebra systems, ACM SIGSAM Bulletin 33:4 (1999), pp. 5-13.