? ?
Help topics:
0: list of user-defined identifiers (variable, alias, function)
1: Standard monadic or dyadic OPERATORS
2: CONVERSIONS and similar elementary functions
3: TRANSCENDENTAL functions
4: NUMBER THEORETICAL functions
5: Functions related to ELLIPTIC CURVES
6: Functions related to general NUMBER FIELDS
7: POLYNOMIALS and power series
8: Vectors, matrices, LINEAR ALGEBRA and sets
9: SUMS, products, integrals and similar functions
10: GRAPHIC functions
11: PROGRAMMING under GP
12: The PARI community
Further help (list of relevant functions): ?n (1<=n<=11).
Also:
? functionname (short on-line help)
?\ (keyboard shortcuts)
?. (member functions)
Extended help looks available:
?? (opens the full user's manual in a dvi previewer)
?? tutorial (same with the GP tutorial)
?? refcard (same with the GP reference card)
?? keyword (long help text about "keyword" from the user's manual)
??? keyword (a propos: list of related functions).
? ?4
addprimes bestappr bezout bezoutres bigomega
binomial chinese content contfrac contfracpnqn
core coredisc dirdiv direuler dirmul
divisors eulerphi factor factorback factorcantor
factorff factorial factorint factormod ffinit
fibonacci gcd hilbert isfundamental isprime
ispseudoprime issquare issquarefree kronecker lcm
moebius nextprime numdiv omega precprime
prime primes qfbclassno qfbcompraw qfbhclassno
qfbnucomp qfbnupow qfbpowraw qfbprimeform qfbred
quadclassunit quaddisc quadgen quadhilbert quadpoly
quadray quadregulator quadunit removeprimes sigma
sqrtint znlog znorder znprimroot znstar
? ?gcd
gcd(x,y,{flag=0}): greatest common divisor of x and y. flag is optional, and
can be 0: default, 1: use the modular gcd algorithm (x and y must be
polynomials), 2 use the subresultant algorithm (x and y must be polynomials).
? ??gcd
\\ if set up correctly, brings up the typeset section from the manual on gcd
We will discuss writing more complicated PARI programs on October 10.