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
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.)

There are other interfaces to PARI beside gp, for example PariEmacs, Pari-tty, and pariGUIde. Similarly, there are other libraries that extend PARI: pari-python, SAGE (Python), Math::Pari (Perl), and Pari (CLISP).

See also

• Wikipedia:PARI/GP

Resources

General

• PARI/GP FAQ
• Resources for PARI/GP

Tutorials

• Official tutorial by C. Batut, K. Belabas, D. Bernardi, H. Cohen, M. Olivier (52 pp., 2010)
• Tutorial by Robert B. Ash (20 pp., 2007)
• Tutorial by Siman Wong (6 pp., 2009)
• PARI/GP programming for basic cryptography by Minh Van Nguyen (appx. 3 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)

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