PARI/GP scripts for miscellaneous math problems

[Max Alekseyev]

I've made available for download a number of my PARI/GP scripts that
other people may find useful:

http://www.cs.ucsd.edu/users/maxal/gpscripts/

Currently there are scripts for the following computational problems:

I. Number of Hamiltonial paths and cycles in graphs
II. Inversion of Euler Totient Function
III. Binomial Coefficients Modulo Primes
IV. Number of subgroups of an abelian group

and scripts for the following computational problems will be there soon:

V. Period of Linear Recurrent Sequences (e.g., Fibonacci Numbers) Modulo Primes
VI. Emperical Recurrent Formulas with Polynomial Coefficients
VII. Generation of Integer Partitions
VIII. Continued Fraction of Square Roots
IX. Number of Monic Irreducible Multivariate Polynomials over Finite Fields

Whenever appropriate I illustrate the usage of these scripts with
simple programs computing particular sequences in OEIS.

Your comments are welcome!

Regards,
Max




ma> From seqfan-owner at ext.jussieu.fr  Wed Feb  6 04:45:48 2008
ma> Date: Tue, 5 Feb 2008 19:45:24 -0800
ma> From: "Max Alekseyev" <maxale at gmail.com>
ma> To: SeqFan <seqfan at ext.jussieu.fr>, pari-users at list.cr.yp.to
ma> Subject: PARI/GP scripts for miscellaneous math problems
ma> 
ma> I've made available for download a number of my PARI/GP scripts that
ma> other people may find useful:
ma> 
ma> http://www.cs.ucsd.edu/users/maxal/gpscripts/
ma> ....
ma> VII. Generation of Integer Partitions
ma> ...

An implementation is also in
http://pari.math.u-bordeaux.fr/cgi-bin/bugreport.cgi?bug=671

Richard