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,928

**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
15
Introduction to Computer Science
31
Introduction to Computer Programming
48
Algorithms and Data Structures
24
Artificial Intelligence
23
Computer Vision
25
Machine Learning
6
Neural Networks
20
Game Development and Multimedia
25
Data Communication and Networks
5
Coding Theory
15
Computer Security
8
Information Security
34
Cryptography
3
Information Theory
18
Computer Organization and Architecture
22
Operating Systems
1
Image Processing
10
Parallel Computing
4
Concurrent Programming
19
Relational Database
3
Document-oriented Database
13
Data Mining
16
Big Data
12
Data Science
23
Digital Libraries
21
Compiler Design and Construction
23
Functional Programming
10
Logic Programming
26
Object Oriented Programming
21
Formal Methods
68
Software Engineering
3
Agile Software Development
6
Information Systems
5
Geographic Information System (GIS)

Mathematics
67
Mathematics
10
Algebra
27
Linear Algebra
3
Number Theory
6
Numerical Methods
2
Precalculus
7
Calculus
5
Category Theory
7
Proofs
18
Discrete Mathematics
24
Theory of Computation
11
Graph Theory
1
Complex Analysis
10
Probability
39
Statistics
4
Game Theory
5
Queueing Theory
12
Operations Research
16
Computer Aided Mathematics

Supporting Fields
18
Web Design and Development
1
Mobile App Design and Development
28
System Administration
2
Cloud Computing
9
Electric Circuits
25
Signal Processing
3
Network Science
2
Project Management

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

Miscellaneous