|Look up fees
Modern computers have developed far beyond being great devices for numerical simulations or tedious but straightforward algebra; and in 1990 the first mathematical research paper was published whose sole author was a thinking machine known as Shalosh B Ekhad. This course will discuss some of the great advances made in using computers to purely algorithmically discover (and prove!) nontrivial mathematical theorems in for example Number Theory and Algebraic Combinatorics. Topics include: Automated hypergeometric summation, Groebner basis, Chaos theory, Number guessing, Recurrence relations, BBP formulas.
Intended learning outcomes
After completing this subject, students will:
- have been introduced to non-numerical symbolic computation packages used in modern research in the areas of discrete mathematics and number theory;
- acquire insight into the use of computers for discovering and formally proving mathematical theorems;
- gain the ability to pursue further studies in this and related areas.
In addition to learning specific skills that will assist students in their future careers in science, they will have the opportunity to develop generic skills that will assist them in any future career path. These include:
- problem-solving skills: the ability to engage with unfamiliar problems and identify relevant solution strategies;
- analytical skills: the ability to construct and express logical arguments and to work in abstract or general terms to increase the clarity and efficiency of analysis;
- collaborative skills: the ability to work in a team;
- time-management skills: the ability to meet regular deadlines while balancing competing commitments.
Last updated: 3 November 2022