Category:PARI/GP: Difference between revisions

From Rosetta Code
Content added Content deleted
(no HOPL, but LCT)
(reorganize resources and add paper)
Line 18: Line 18:
== See also ==
== See also ==
*[[wp:PARI/GP|Wikipedia:PARI/GP]]
*[[wp:PARI/GP|Wikipedia:PARI/GP]]

== Resources ==
=== General ===
*[http://www.math.utah.edu/faq/pari/pari.html PARI/GP FAQ]
*[http://www.math.utah.edu/faq/pari/pari.html PARI/GP FAQ]
*[http://www.math.u-bordeaux1.fr/~belabas/pari/ Resources for PARI/GP]
*[http://www.math.u-bordeaux1.fr/~belabas/pari/ Resources for PARI/GP]

*[http://www.loria.fr/~zimmerma/talks/henri.pdf The Ups and Downs of PARI/GP in the last 20 years] by Paul Zimmermann
=== Tutorials ===
*[http://mvngu.wordpress.com/2008/08/01/parigp-programming-for-basic-cryptography/ PARI/GP programming for basic cryptography]
*[http://mvngu.wordpress.com/2008/08/01/parigp-programming-for-basic-cryptography/ PARI/GP programming for basic cryptography]
*[http://www.exploringbinary.com/exploring-binary-numbers-with-parigp-calculator/ Exploring Binary Numbers With PARI/GP Calculator]
*[http://www.exploringbinary.com/exploring-binary-numbers-with-parigp-calculator/ Exploring Binary Numbers With PARI/GP Calculator]

=== Papers on PARI/GP ===
* Bill Alombert, [http://www.math.u-bordeaux.fr/~allomber/darkpaper.pdf A new interpretor for PARI/GP], ''Journal de Théorie des Nombres de Bordeaux'' '''20''':3 (2008), pp. 531–541. (English)
* Paul Zimmermann, [http://www.loria.fr/~zimmerma/talks/henri.pdf The Ups and Downs of PARI/GP in the last 20 years], Explicit Methods in Number Theory, October 15th-19th 2007

[[Category:Mathematics]]
[[Category:Mathematics]]

Revision as of 06:33, 11 June 2011

Language
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:
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

Resources

General

Tutorials

Papers on PARI/GP

Subcategories

This category has the following 3 subcategories, out of 3 total.

Pages in category "PARI/GP"

The following 200 pages are in this category, out of 606 total.

(previous page) (next page)
(previous page) (next page)