Algorithmic Mathematics

Introduces the basic algorithms for computing and provides a constructive approach to abstract mathematics.

**Tag(s):**
Mathematics

**Publication date**: 01 Jan 2004

**ISBN-10**:
n/a

**ISBN-13**:
n/a

**Paperback**:
n/a

**Views**: 16,774

**Type**: N/A

**Publisher**:
n/a

**License**:
n/a

**Post time**: 09 Dec 2007 05:51:39

Algorithmic Mathematics

Introduces the basic algorithms for computing and provides a constructive approach to abstract mathematics.

Excerpts from the Preface:

This text contains sufficient material for a one-semester course in mathematical algorithms, for second year mathematics students. The course requires some exposure to the basic concepts of discrete mathematics, but no computing experience.

The aim of this course is twofold. Firstly, to introduce the basic algorithms for computing exactly with integers, polynomials and vector spaces. In doing so, the student is expected to learn how to think algorithmically and how to design and analyze algorithms.

Secondly, to provide a constructive approach to abstract mathematics, algebra in particular. When introducing the elements of ring and field theory, algorithms offer concrete tools, constructive proofs, and a crisp environment where the benefits of rigour and abstraction become tangible.

We shall write algorithms in a straightforward language, which incorporates freely standard mathematical notation. The specialized constructs are limited to the if-structure and the while-loop, which are universal.

Exercises are provided. They have a degree of difficulty comparable to that of examination questions. Some of the exercises consist of short essays; in this context, the notation [ ] indicates that mathematical symbols are not permitted in the essay. Starred sections contain optional material, which is not examinable.

This text contains sufficient material for a one-semester course in mathematical algorithms, for second year mathematics students. The course requires some exposure to the basic concepts of discrete mathematics, but no computing experience.

The aim of this course is twofold. Firstly, to introduce the basic algorithms for computing exactly with integers, polynomials and vector spaces. In doing so, the student is expected to learn how to think algorithmically and how to design and analyze algorithms.

Secondly, to provide a constructive approach to abstract mathematics, algebra in particular. When introducing the elements of ring and field theory, algorithms offer concrete tools, constructive proofs, and a crisp environment where the benefits of rigour and abstraction become tangible.

We shall write algorithms in a straightforward language, which incorporates freely standard mathematical notation. The specialized constructs are limited to the if-structure and the while-loop, which are universal.

Exercises are provided. They have a degree of difficulty comparable to that of examination questions. Some of the exercises consist of short essays; in this context, the notation [ ] indicates that mathematical symbols are not permitted in the essay. Starred sections contain optional material, which is not examinable.

Tweet

About The Author(s)

No information is available for this author.

No information is available for this author.

Book Categories

Computer Science
45
Introduction to Computer Science
44
Algorithms and Data Structures
23
Object Oriented Programming
23
Theory of Computation
19
Formal Methods
19
Functional Programming
10
Logic Programming
22
Artificial Intelligence
22
Computer Vision
13
Big Data
4
Neural Networks
19
Compiler Design and Construction
5
Computer Security
15
Computer Organization and Architecture
8
Data Science
9
Parallel Computing
3
Concurrent Programming
22
Operating Systems
22
Data Communication and Networks
34
Information Security
6
Information Theory
23
Digital Libraries
13
Information Systems
61
Software Engineering
17
Game Development and Multimedia
12
Data Mining
23
Machine Learning

Mathematics
68
Mathematics
2
Precalculus
10
Algebra
6
Calculus
5
Category Theory
25
Linear Algebra
16
Computer Aided Mathematics
6
Proofs
17
Discrete Mathematics
6
Numerical Methods
3
Number Theory
11
Graph Theory
12
Operations Research
1
Complex Analysis
5
Queueing Theory
34
Statistics
10
Probability

Supporting Fields
9
Electric Circuits
24
Signal Processing
14
Web Design and Development
2
Document-oriented Database
9
Relational Database
2
Cloud Computing
3
Network Science

Operating System
Programming/Scripting
6
Ada
12
Assembly
34
C / C++
8
Common Lisp
2
Forth
34
Java
11
JavaScript
1
Lua
15
Microsoft .NET
1
Rexx
12
Perl
5
PHP
60
Python
7
R
1
Rebol
13
Ruby
2
Scheme
3
Tcl/Tk

Miscellaneous