Sage is a free open-source mathematics software system licensed under the GPL. It combines the power of many existing open-source packages into a common Python-based interface. Mission: Creating a viable free open source alternative to Magma, Maple, Mathematica and Matlab.

Cantor is an application that lets you use your favorite mathematical applications from within a nice KDE-integrated Worksheet Interface. It offers assistant dialogs for common tasks and allows you to share your worksheets with others. Four backends are curently available: Sage, Maxima, R and KAlgebra.

Questo sito nasce dalla convinzione che giocando i bambini possano assimilare nozioni sempre più complesse e, contemporaneamente, interagire in allegria con genitori e amici. Ho voluto rendere alla portata dei bambini quei giochi enigmistici che troppo spesso sono rivolti solo ad un utente adulto; le immagini usate sono a loro famigliari e magari li aiuteranno a sorridere un po' di più. I giochi sono stampabili: l'esperienza con il mio bambino mi ha insegnato che è molto meglio divertirsi con lui mentre cerca di risolvere un puzzle di parole decorato con i suoi eroi preferiti piuttosto che presentargli uno schema al computer.

Compass and Ruler (C.a.R.) is a dynamic geometry software developed by Rene Grothmann since 1989.

This is the calculus text for Math 225. If you want to print out the text, you should probably download individual chapters; if you want to read the book on a computer screen, the "whole book" is a better choice, as it contains live links that let you easily jump from place to place in the book. The links "2 up" and "4 up" will give you versions with two or four book pages per printed page.

The Templeton Foundation today announced that the Polish mathematical physicist and former priest Michael Heller will receive the 2008 Templeton Prize. Heller, whose more than 40 year-long career has encompassed research in theology, philosophy, mathematics and cosmology, intends to use the £820,000 prize to found an inter-university institute in Poland that will investigate questions in science, theology and philosophy.

This short introductory text focuses mainly on integration and differentiation of functions of a single variable, although iterated integrals are discussed. Infinitesimals are used when appropriate, and are treated more rigorously than in old books like Thompson's Calculus Made Easy, but in less detail than in Keisler's Elementary Calculus: An Approach Using Infinitesimals. Numerical examples are given using the open-source computer algebra system Yacas, and Yacas is also used sometimes to cut down on the drudgery of symbolic techniques such as partial fractions. Proofs are given for all important results, but are often relegated to the back of the book, and the emphasis is on teaching the techniques of calculus rather than on abstract results.

Foreword This course1 studies computer algorithms, considering their construction, validation and effectiveness. After a general introduction to the subject a number of specific topics will be covered. These may include: the problem of sorting data sets into order, the theory of formal grammars and problems such as the parsing of arithmetic expressions, the construction and use of pseudorandom numbers.

This is the third book in the Lothaire's series, following the volumes ``Combinatorics on Words'' and ``Algebraic Combinatorics on Words'' already published. Available at Cambridge University Press since july, 2005 Its objective is to present in a unified manner the various applications of combinatorics on words. The application areas include core algorithms for text processing, natural language processing, speech processing, bioinformatics, and several areas of applied mathematics such as combinatorial enumeration and fractal analysis. The intended audience is the general scientific community. No special knowledge is needed, and familiarity with the application areas or with the material covered by the previous volumes is not required. In particular, the content, including problems and algorithms, is accessible to anyone working in the area of computer science.