Category:PARI/GP: Difference between revisions
Content added Content deleted
(cleanup and comments) |
|||
| Line 1: | Line 1: | ||
{{language|PARI/GP |
{{language|PARI/GP |
||
|exec=interpreted |
|exec=interpreted or compiled<!-- with gp2c --> |
||
|site=http://pari.math.u-bordeaux.fr/ |
|site=http://pari.math.u-bordeaux.fr/ |
||
|gc=yes<!-- GP is garbage-collected; PARI does this manually using an internal heap --> |
|||
|gc=yes |
|||
|parampass=both<!-- by reference is limited in GP but the limits do not apply in PARI --> |
|||
|parampass=both |
|||
|strength=weak |
|strength=weak |
||
|checking=dynamic |
|checking=dynamic |
||
| Line 10: | Line 10: | ||
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 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/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 |
There are other interfaces to PARI beside gp, for example [http://math.univ-lille1.fr/~ramare/ServeurPerso/GP-PARI/ PariEmacs], [http://go.helms-net.de/sw/paritty/pari_tty_einf_en.html Pari-tty], and [http://www.skalatan.de/pariguide/ pariGUIde]. Similarly, there are other libraries that extend PARI: [http://code.google.com/p/pari-python/ pari-python], [http://www.sagemath.org/ SAGE] (Python), [http://search.cpan.org/dist/Math-Pari/ Math::Pari] (Perl), and [http://clisp.sourceforge.net/impnotes/pari.html Pari] (CLISP). |
||
== |
== See also == |
||
*[[wp:PARI/GP|Wikipedia:PARI/GP]] |
*[[wp:PARI/GP|Wikipedia:PARI/GP]] |
||
*[http://www.math.utah.edu/faq/pari/pari.html PARI/GP FAQ] |
*[http://www.math.utah.edu/faq/pari/pari.html PARI/GP FAQ] |
||
Revision as of 17:12, 7 May 2011
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Execution method: | |
|---|---|
| Garbage collected: | Yes |
| Parameter passing methods: | By reference, By value |
| Type strength: | Weak |
| Type checking: | Dynamic |
| See Also: |
|
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
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- PARI/GP Implementations (empty)
- PARI/GP User (12 P)
Pages in category "PARI/GP"
The following 200 pages are in this category, out of 606 total.
(previous page) (next page)2
A
- A+B
- ABC problem
- Abstract type
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Ackermann function
- Address of a variable
- AKS test for primes
- Aliquot sequence classifications
- Almost prime
- Amb
- Amicable pairs
- Anagrams/Deranged anagrams
- Angle difference between two bearings
- Anonymous recursion
- Anti-primes
- Apply a callback to an array
- Apéry's constant
- Arbitrary-precision integers (included)
- Archimedean spiral
- Arena storage pool
- Arithmetic-geometric mean
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Complex
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Atomic updates
- Average loop length
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
B
C
- Caesar cipher
- Calkin-Wilf sequence
- Call a foreign-language function
- Call a function
- Call a function in a shared library
- Calmo numbers
- Card shuffles
- Carmichael 3 strong pseudoprimes
- Case-sensitivity of identifiers
- Casting out nines
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Chaos game
- Character codes
- Check Machin-like formulas
- Check that file exists
- Chernick's Carmichael numbers
- Chinese remainder theorem
- Cholesky decomposition
- Chowla numbers
- Circles of given radius through two points
- Closest-pair problem
- Closures/Value capture
- Code segment unload
- Collections
- Combinations
- Combinations and permutations
- Combinations with repetitions
- Comma quibbling
- Comments
- Compare a list of strings
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Compound data type
- Concurrent computing
- Conditional structures
- Conjugate transpose
- Constrained random points on a circle
- Continued fraction
- Continued fraction/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Convert seconds to compound duration
- Conway's Game of Life
- Copy a string
- Count in factors
- Count in octal
- Count occurrences of a substring
- Count the coins
- Cramer's rule
- CRC-32
- Create a file
- Create a two-dimensional array at runtime
- Create an HTML table
- CSV data manipulation
- Cuban primes
- Cullen and Woodall numbers
- Cumulative standard deviation
- Currying
- Curzon numbers
- Cyclotomic polynomial
D
- Day of the week
- Deal cards for FreeCell
- Deceptive numbers
- Deepcopy
- Delete a file
- Deming's funnel
- Department numbers
- Detect division by zero
- Determinant and permanent
- Determine if a string is numeric
- Digit fifth powers
- Digital root
- Digital root/Multiplicative digital root
- Dijkstra's algorithm
- Distance and Bearing
- Documentation
- Dot product
- Dragon curve
- Draw a cuboid
- Duffinian numbers
- Dutch national flag problem
- Dynamic variable names
E
- Egyptian division
- Element-wise operations
- Elliptic curve arithmetic
- Emirp primes
- Empty directory
- Empty program
- Empty string
- Enforced immutability
- Entropy
- Entropy/Narcissist
- Environment variables
- Equilibrium index
- Ethiopian multiplication
- Euclid-Mullin sequence
- Euler's constant 0.5772...
- Euler's sum of powers conjecture
- Evaluate binomial coefficients
- Even or odd
- Evolutionary algorithm
- Exceptions
- Exceptions/Catch an exception thrown in a nested call
- Executable library
- Execute a system command
- Execute Brain****
- Execute HQ9+
- Exponentiation operator
- Exponentiation order
- Extend your language
- Extensible prime generator
- Extreme floating point values
F
- Factorial
- Factors of a Mersenne number
- Factors of an integer
- Farey sequence
- Fast Fourier transform
- Faulhaber's formula
- Fermat numbers
- Fibonacci n-step number sequences
- Fibonacci sequence
- Fibonacci word
- Fibonacci word/fractal
- File extension is in extensions list
- File input/output
- Filter
- Find adjacent primes which differ by a square integer
- Find common directory path
- Find first and last set bit of a long integer
- Find largest left truncatable prime in a given base
- Find limit of recursion
- Find palindromic numbers in both binary and ternary bases
- Find prime numbers of the form n*n*n+2
- Find squares n where n+1 is prime
- Find the last Sunday of each month
- Find the missing permutation
- First-class functions
- First-class functions/Use numbers analogously
- Five weekends