Computer Algebra, Syllabus, Spring 2018.
Location: LOV 104.
Time: Monday, Wednesday, Friday 9:05 - 9:55
Instructor: Dr. Mark van Hoeij
What this course is about:
At first sight you might be inclined to believe that algebra
courses with topics like ideals, finite fields, or the Chinese remainder
theorem are far away from any practical application.
But this is not the case: There are algorithms to compute with almost everything you learn in
algebra courses, and these algorithms have many applications.
For example, finding exact solutions of differential equations, or finding an antiderivative
of a function, such algorithms
use the algebraic algorithms from this course in many places.
The topics covered in this course are:
Computer algebra is useful for applications, but at the same time it is also
a great way to learn pure math: concepts from pure math become clearer and much
easier to understand once you know how to compute with them.
Two courses computer algebra:
There are two courses computer algebra. The course taught this semester
treats the topics listed above. Some of the previous courses:
fall 2001, spring2002
(treated the integration
algorithm (finding a formula for the antiderivative in terms of elementary
functions whenever it exists)), and
No prior programming experience is required for this course. We will spend
the first two weeks on learning how to use Maple and how to implement
algorithms in Maple. Most assignments in this course consist of implementing.
This way the algorithms are learned from mathematical concepts all the way
down to an implementation.
You may be surprised to find that the distance between the two is often small,
because the Maple language is quite close to mathematical language.
In fact, programming in Maple much easier than programming in
most other languages: algorithms implemented in Maple are only a fraction of the size
of the same algorithm implemented in C, Java or Pascal.
Help with assignments:
If you need help with an assignment you can come to my office any time (also outside
of office hours). For most assignments I will be generous with help. The reason is the following:
finding the errors (the bugs) is difficult when you start programming.
But once you learn the tricks of the trade you will notice that
it becomes much easier. To help with this, you are welcome in my office any time.
There will be three tests during the semester, and one
Each of these four tests will account for 20% of the grade. The remaining 20% will be
determined by the turn in assignments.
For one or two of these tests, you will be given the option to do an assignment instead
of a test.
The ideas behind the algorithms taught in this course can be used in many
To show that you understand these ideas in sufficient detail, you have to
be able to use them on the computer;
you should be able implement short algorithms on your own,
and larger algorithms as group work.
Textbook: A textbook is not needed for this course, the necessary material will
be posted online. However, if you still want a book, then I recommend: "Modern Computer Algebra"
by J. von zur Gathen and J. Gerhard.
Software: The course documents are interactive Maple documents which you can download
through the web. These documents can be viewed or printed with Maple.
The math department has a license for Maple, so you should be
able to use Maple on most math computers, but the best thing to do is to install Maple
on your laptop; contact Mickey Boyd firstname.lastname@example.org to obtain a copy.
Prerequisites: The graduate algebra courses or the consent of the
instructor. If you are not sure, please contact me by e-mail.
University Attendance Policy:
Excused absences include documented illness, deaths in the family and other documented crises, call to active military duty or jury duty, religious holy days, and official University
activities. These absences will be accommodated in a way that does not arbitrarily penalize students who have a valid excuse. Consideration will also be given to students whose dependent
children experience serious illness.
Academic Honor Policy:
The Florida State University Academic Honor Policy outlines the Universitys expectations for the integrity of students academic work, the procedures for resolving alleged violations of those
expectations, and the rights and responsibilities of students and faculty members throughout the process. Students are responsible for reading the Academic Honor Policy and for living up to
their pledge to . . . be honest and truthful and . . . [to] strive for personal and institutional integrity at Florida State University. (Florida State University Academic Honor Policy, found
Americans With Disabilities Act:
Students with disabilities needing academic accommodation should:
(1) register with and provide documentation to the Student Disability Resource Center; and
(2) bring a letter to the instructor indicating the need for accommodation and what type. This should be done during the first week of class.
This syllabus and other class materials are available in alternative format upon request.
For more information about services available to FSU students with disabilities, contact the:
Student Disability Resource Center
874 Traditions Way
108 Student Services Building
Florida State University
Tallahassee, FL 32306-4167
(850) 644-9566 (voice)
(850) 644-8504 (TDD)
- 1. Introduction to Maple.
- 2. Modular Euclidean algorithm.
- 3. Computing with algebraic numbers.
- 4. Lattice reduction and applications.
- 5. Factorization of polynomials.