memoize*

Today I released a collection of number theory functions through PLaneT.The code began as an experiment. I grabbed a book on number theory from the shelve ( "Elementary Number Theory" by Gareth A. Jones and J. Mary Jones) and began illustrating each definition and each theorem with Scheme code. The first half of the source code is thus a well commented mix of definitions, theorems and code.The second half contains more sophisticated algorithms mostly from the excellent book "Modern Computer Algebra" by Joachim von zur Gathen and Jürgen Gerhard. The algorithms for factorizing large integers come from this book.Finally there are some definitions of special functions, mostly inspired by the problems of the Euler Project . The revival of the code is due to the Euler Project, which is a collection of small problems of very varying difficulty. The tools I have used to solve the problems (apart from the number theory library) are David Herman 's memoize package (don't forget to usewhen working with numbers) and the eager comprehensions from srfi 42 The documentation of the number theory library lists all the available functions.Please write with bugs, suggestions, and improvements.