Programming for Mathematicians

Programming for Mathematicians

by Seroul, Raymond

Type Book
Rate 0.0 /5

The aim of this book is to teach mathematics students how to program using their knowledge of mathematics. For this they require only to know how to construct a proof. The entire book's emphasis is on "how to think" when programming. Three methods for constructing an algorithm or a program are used: a) manipulation and enrichment of existing code; b) use of recurrent sequences; c) deferral of code writing, in order to deal with one difficulty at a time. Many theorems are mathematically proved a…

Read More ↓

Title Statements

  • Full title :Programming for Mathematicians / by Raymond Séroul.

Summary

The aim of this book is to teach mathematics students how to program using their knowledge of mathematics. For this they require only to know how to construct a proof. The entire book's emphasis is on "how to think" when programming. Three methods for constructing an algorithm or a program are used: a) manipulation and enrichment of existing code; b) use of recurrent sequences; c) deferral of code writing, in order to deal with one difficulty at a time. Many theorems are mathematically proved and programmed. The last chapter explains how a compiler works and shows how to compile "by hand" little (but not trivial--even recursive) programs. The book is intended for anyone who thinks mathematically and wants to program and play with mathematics.

Read More ↓

Edition Statements

  • Publication Date:2000.

Publication Statements

The Physical Object

  • Description:1 online resource (xv, 429 pages 40 illustrations)

Edition Identifiers

  • ISBN:9783642571299, 3642571298
  • oclc:ocn851775401
  • LC Classification:QA71-90
  • Dewey Decimal:518

Table of Contents

Programming Proverbs -- Review of Arithmetic -- An Algorithmic Description Language -- How to Create an Algorithm -- Algorithms and Classical Constructions -- The Pascal Language -- How to Write a Program -- The Integers -- The Comlex Numbers -- Polynomials -- Matrices -- Recursion -- Elements of Compiler Theory.

Read More ↓

Subjects

Writers

More from this Series

  • Finite Möbius groups, minimal immersions of spheres, and moduli

    ©2002.
    more →
    Finite Möbius groups, minimal immersions of spheres, and moduli
  • Finite Möbius groups, minimal immersions of spheres, and moduli

    ©2002.
    more →
    Finite Möbius groups, minimal immersions of spheres, and moduli
  • Finite Möbius groups, minimal immersions of spheres, and moduli

    ©2002.
    more →
    Finite Möbius groups, minimal immersions of spheres, and moduli
  • Finite Möbius groups, minimal immersions of spheres, and moduli

    2002
    more →
    Finite Möbius groups, minimal immersions of spheres, and moduli
  • Finite Möbius groups, minimal immersions of spheres, and moduli

    c2002.
    more →
    Finite Möbius groups, minimal immersions of spheres, and moduli

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

  • Programming for mathematicians -- (.djvu)

    DJVU · 2.3 MB · updated
  • Programming for Mathematicians -- (.djvu)

    DJVU · 2.9 MB · updated
  • Programming for Mathematicians -- (.pdf)

    PDF · 31.1 MB · updated
  • Programming for Mathematicians -- (.pdf)

    PDF · 4.6 MB · updated
  • Programming for Mathematicians -- (.pdf)

    PDF · 4.4 MB · updated