Mathematics is important to the modern world. All quantitative science, including both physical and social sciences, is based on it. It provides the theoretical framework for physical science, statistics and data analysis as well as computer science. Our programmes reflect this diversity and the excitement generated by new discoveries within mathematics.

## Overview

The programmes share a common core of Mathematics at Stage 1, and then move on to cover abstract, analytical and computational techniques that give you the opportunity to specialise in areas such as non-linear differential equations, computational algebra and geometry, financial mathematics, forecasting, design and analysis of experiments, inference and stochastic processes.

#### Independent rankings

Mathematics at Kent was ranked 19th for course satisfaction in *The Guardian University Guide 2017*. For graduate prospects, Mathematics was ranked 19th in *The Complete University Guide 2017.*

## Course structure

The following modules are indicative of those offered on this programme. This listing is based on the current curriculum and may change year to year in response to new curriculum developments and innovation.

On most programmes, you study a combination of compulsory and optional modules. You may also be able to take ‘wild’ modules from other programmes so you can customise your programme and explore other subjects that interest you.

### Stage 1

Possible modules may include | Credits | |
---|---|---|

MA306 - Statistics | 15 | |

Increasingly data are collected to inform future decisions, varying from which websites people access on a regular basis to how patients respond to new drugs, to how the stock market responds to global events, or to how animals move around their local habitat. Therefore, most professionals will need to extract useful information from data and to manage and present data in their working lives. This module explores some of the basic concepts of statistics, from data summarisation to the main methods of statistical inference. The techniques that are discussed can be used in their own right for simple statistical analyses, but serve as an important foundation for later, more advanced, modules. The statistical computing package R is used throughout the module for data analysis. The syllabus includes: an introduction to R and investigating data sets, sampling and sampling distributions, point and interval estimation, hypothesis testing, association between variables. |
||

MA343 - Algebraic Methods | 15 | |

This module serves as an introduction to algebraic methods. These methods are central in modern mathematics and have found applications in many other sciences, but also in our everyday life. In this module, students will also gain an appreciation of the concept of proof in mathematics. |
||

MA344 - Application of Mathematics | 15 | |

This module introduces mathematical modelling and Newtonian mechanics. Tutorials and Maple worksheets will be used to support taught material. The modelling cycle: General description with examples; Newton's law of cooling; population growth (Malthusian and logistic models); simple reaction kinetics (unimolecular and bimolecular reactions); dimensional consistency Motion of a body: frames of reference; a particle's position vector and its time derivatives (velocity and acceleration) in Cartesian coordinates; mass, momentum and centre of mass; Newton's laws of motion; linear springs; gravitational acceleration and the pendulum; projectile motion Orbital motion: Newton's law of gravitation; position, velocity and acceleration in plane polar coordinates; planetary motion and Kepler's laws. |
||

MA346 - Linear Algebra | 15 | |

This module is a sequel to Algebraic Methods. It considers the abstract theory of linear spaces together with applications to matrix algebra and other areas of Mathematics (and its applications). Since linear spaces are of fundamental importance in almost every area of mathematics, the ideas and techniques discussed in this module lie at the heart of mathematics. Topics covered will include: 1 Vector Spaces: definition, examples, linearly independent and spanning sets, bases, dimension, subspaces. 2 Linear transformations: definition, examples, matrix of a linear transformation, change of basis, similar matrices. 3 Determinant of a linear transformation. 4 Eigenvalues/eigenvectors and diagonalisation: characteristic polynomial, invariant subspaces and upper triangular forms. Cayley-Hamilton Theorem. 5 Bilinear forms: inner products, norms, Cauchy-Schwarz inequality. 6 Orthonormal systems, the Gram-Schmidt process. 7 Symmetric Matrices. Every real symmetric matrix is diagonalisable. 8 Quadratic forms: Sylvester's Law of Inertia; signature of a quadratic form; application to conics (and quadrics if time permits). |
||

MA348 - Mathematical Methods 1 | 15 | |

This module introduces widely-used mathematical methods for functions of a single variable. The emphasis is on the practical use of these methods; key theorems are stated but not proved at this stage. Tutorials and Maple worksheets will be used to support taught material. Complex numbers: Complex arithmetic, the complex conjugate, the Argand diagram, de Moivre's Theorem, modulus-argument form; elementary functions Polynomials: Fundamental Theorem of Algebra (statement only), roots, factorization, rational functions, partial fractions Single variable calculus: Differentiation, including product and chain rules; Fundamental Theorem of Calculus (statement only), elementary integrals, change of variables, integration by parts, differentiation of integrals with variable limits Scalar ordinary differential equations (ODEs): definition; methods for first-order ODEs; principle of superposition for linear ODEs; particular integrals; second-order linear ODEs with constant coefficients; initial-value problems Curve sketching: graphs of elementary functions, maxima, minima and points of inflection, asymptotes |
||

MA349 - Mathematical Methods 2 | 15 | |

This module introduces widely-used mathematical methods for vectors and functions of two or more variables. The emphasis is on the practical use of these methods; key theorems are stated but not proved at this stage. Tutorials and Maple worksheets will be used to support taught material. Vectors: Cartesian coordinates; vector algebra; scalar, vector and triple products (and geometric interpretation); straight lines and planes expressed as vector equations; parametrized curves; differentiation of vector-valued functions of a scalar variable; tangent vectors; vector fields (with everyday examples) Partial differentiation: Functions of two variables; partial differentiation (including the chain rule and change of variables); maxima, minima and saddle points; Lagrange multipliers Integration in two dimensions: Double integrals in Cartesian coordinates; plane polar coordinates; change of variables for double integrals; line integrals; Green's theorem (statement justification on rectangular domains only) |
||

MA351 - Probability | 15 | |

Introduction to Probability. Concepts of events and sample space. Set theoretic description of probability, axioms of probability, interpretations of probability (objective and subjective probability). Theory for unstructured sample spaces. Addition law for mutually exclusive events. Conditional probability. Independence. Law of total probability. Bayes' theorem. Permutations and combinations. Inclusion-Exclusion formula. Discrete random variables. Concept of random variable (r.v.) and their distribution. Discrete r.v.: Probability function (p.f.). (Cumulative) distribution function (c.d.f.). Mean and variance of a discrete r.v. Examples: Binomial, Poisson, Geometric. Continuous random variables. Probability density function; mean and variance; exponential, uniform and normal distributions; normal approximations: standardisation of the normal and use of tables. Transformation of a single r.v. Joint distributions. Discrete r.v.'s; independent random variables; expectation and its application. Generating functions. Idea of generating functions. Probability generating functions (pgfs) and moment generating functions (mgfs). Finding moments from pgfs and mgfs. Sums of independent random variables. Laws of Large Numbers. Weak law of large numbers. Central Limit Theorem. |
||

MA352 - Real Analysis 1 | 15 | |

Topics covered will include: Real Numbers: Rational and real numbers, absolute value and metric structure on the real numbers, induction, countability and uncountability, infimum and supremum. Limits of Sequences: Sequences, definition of convergence, epsilon terminology, uniqueness, algebra of limits, comparison principles, standard limits, subsequences and non-existence of limits, convergence to infinity. Completeness Properties: Cantor's Intersection Theorem, limit points, Bolzano-Weierstrass theorem, Cauchy sequences. Continuity of Functions: Functions and basic definitions, limits of functions, continuity and epsilon terminology, sequential continuity, Intermediate Value Theorem. Differentiation: Definition of the derivative, product rule, quotient rule and chain rule, derivatives and local properties, Mean Value Theorem, L'Hospital's Rule. Taylor Approximation: Taylor's Theorem, remainder term, Taylor series, standard examples, O and o notation, limits using Taylor series. |

### Stage 2

Possible modules may include | Credits | |
---|---|---|

MA5503 - Groups and Symmetries | 15 | |

The concept of symmetry is one of the most fruitful ideas through which mankind has tried to understand order and beauty in nature and art. This module first develops the concept of symmetry in geometry. It subsequently discusses links with the fundamental notion of a group in algebra. Outline syllabus includes: Groups from geometry; Permutations; Basic group theory; Action of groups and applications to (i) isometries of regular polyhedra; (ii) counting colouring problems; Matrix groups. |
||

MA5514 - Rings and Fields | 15 | |

Can we square a circle? Can we trisect an angle? These two questions were studied by the Ancient Greeks and were only solved in the 19th century using algebraic structures such as rings, fields and polynomials. In this module, we introduce these ideas and concepts and show how they generalise well-known objects such as integers, rational numbers, prime numbers, etc. The theory is then applied to solve problems in Geometry and Number Theory. This part of algebra has many applications in electronic communication, in particular in coding theory and cryptography. |
||

MA566 - Number Theory | 15 | |

The security of our phone calls, bank transfers, etc. all rely on one area of Mathematics: Number Theory. This module is an elementary introduction to this wide area and focuses on solving Diophantine equations. In particular, we discuss (without proof) Fermat's Last Theorem, arguably one of the most spectacular mathematical achievements of the twentieth century. Outline syllabus includes: Modular Arithmetic; Prime Numbers; Introduction to Cryptography; Quadratic Residues; Diophantine Equations. |
||

MA5504 - Lagrangian and Hamiltonian Dynamics | 15 | |

This module will present a new perspective on Newton's familiar laws of motion. First we introduce variational calculus with applications such as finding the paths of shortest distance. This will lead us to the principle of least action from which we can derive Newton's law for conservative forces. We will also learn how symmetries lead to constants of motion. We then derive Hamilton's equations and discuss their underlying structures. The formalisms we introduce in this module form the basis for all of fundamental modern physics, from electromagnetism and general relativity, to the standard model of particle physics and string theory. |
||

MA5507 - Mathematical Statistics | 15 | |

This module is a pre-requisite for many of the other statistics modules at Stages 2, 3 and 4, but it can equally well be studied as a module in its own right, extending the ideas of probability and statistics met at Stage 1 and providing practice with the mathematical skills learned in MA348 and MA349. It starts by revising the idea of a probability distribution for one or more random variables and looks at different methods to derive the distribution of a function of random variables. These techniques are then used to prove some of the results underpinning the hypothesis test and confidence interval calculations met at Stage 1, such as for the t-test or the F-test. With these tools to hand, the module moves on to look at how to fit models (probability distributions) to sets of data. A standard technique, the method of maximum likelihood, is used to fit the model to the data to obtain point estimates of the model parameters and to construct hypothesis tests and confidence intervals for these parameters. Outline Syllabus includes: Joint, marginal and conditional distributions of discrete and continuous random variables; Transformations of random variables; Sampling distributions; Point and interval estimation; Properties of estimators; Maximum likelihood; Hypothesis testing; Neyman-Pearson lemma; Maximum likelihood ratio test. |
||

MA5509 - Numerical Methods | 15 | |

This module is an introduction to the methods, tools and ideas of numerical computation. In mathematics, one often encounters standard problems for which there are no easily obtainable explicit solutions, given by a closed formula. Examples might be the task of determining the value of a particular integral, finding the roots of a certain non-linear equation or approximating the solution of a given differential equation. Different methods are presented for solving such problems on a modern computer, together with their applicability and error analysis. A significant part of the module is devoted to programming these methods and running them in MATLAB. |
||

MA5512 - Ordinary Differential Equations | 15 | |

This module introduces the basic ideas to solve certain ordinary differential equations, like first order scalar equations, second order linear equations and systems of linear equations. It mainly considers their qualitative and analytical aspects. Outline syllabus includes: First-order scalar ODEs; Second-order scalar linear ODEs; Existence and Uniqueness of Solutions; Autonomous systems of two linear first-order ODEs. |
||

MA5501 - Applied Statistical Modelling 1 | 15 | |

Constructing suitable models for data is a key part of statistics. For example, we might want to model the yield of a chemical process in terms of the temperature and pressure of the process. Even if the temperature and pressure are fixed, there will be variation in the yield which motivates the use of a statistical model which includes a random component. In this module, we study how suitable models can be constructed, how to fit them to data and how suitable conclusions can be drawn. Both theoretical and practical aspects are covered, including the use of R. |
||

MA5502 - Curves and Surfaces | 15 | |

The main aim of this module is to give an introduction to the basics of differential geometry, keeping in mind the recent applications in mathematical physics and the analysis of pattern recognition. Outline syllabus includes: Curves and parameterization; Curvature of curves; Surfaces in Euclidean space; The first fundamental form; Curvature of surfaces; Geodesics. |

### Stage 3

Possible modules may include | Credits | |
---|---|---|

CB600 - Games and Networks | 15 | |

The module is divided into three main topics, namely Combinatorial Optimisation, Dynamic Programming and Game Theory. A more detailed listing of content is given below. Combinatorial Optimisation: The Shortest Path Problem The Minimal Spanning Tree Problem Flows in Networks Scheduling Theory Computational Complexity Theory of Games: Matrix Games Pure Strategies Matrix Games Mixed Strategies Bimatrix Games N-person Games Multi-criteria Decision Theory |
||

MA549 - Discrete Mathematics | 15 | |

Recently some quite novel applications have been found for "Discrete Mathematics", as opposed to the Continuous Mathematics based on the Differential and Integral Calculus. Thus methods for the encoding of information in order to safeguard against eavesdropping or distortion by noise, for example in online banking and digital television, have involved using some basic results from abstract algebra. This module will provide a self-contained introduction to this general area and will cover most of the following topics: (a) Modular arithmetic, polynomials and finite fields: Applications to orthogonal Latin squares, cryptography, coin-tossing over a telephone, linear feedback shift registers and m-sequences. (b) Error correcting codes: Binary block, linear and cyclic codes including repetition, parity-check, Hamming, simplex, Reed-Muller, BCH, Golay codes; channel capacity; Maximum likelihood, nearest neighbour, syndrome and algebraic decoding. |
||

MA567 - Topology | 15 | |

This module is an introduction to point-set topology, a topic that is relevant to many other areas of mathematics. In it, we will be looking at the concept of topological spaces and related constructions. In an Euclidean space, an "open set" is defined as a (possibly infinite) union of open "epsilon-balls". A topological space generalises the notion of "open set" axiomatically, leading to some interesting and sometimes surprising geometric consequences. For example, we will encounter spaces where every sequence of points converges to every point in the space, see why for topologists a doughnut is the same as a coffee cup, and have a look at famous objects such as the Moebius strip or the Klein bottle. |
||

MA568 - Orthogonal Polynomials and Special Functions | 15 | |

This module provides an introduction to the study of orthogonal polynomials and special functions. They are essentially useful mathematical functions with remarkable properties and applications in mathematical physics and other branches of mathematics. Closely related to many branches of analysis, orthogonal polynomials and special functions are related to important problems in approximation theory of functions, the theory of differential, difference and integral equations, whilst having important applications to recent problems in quantum mechanics, mathematical statistics, combinatorics and number theory. The emphasis will be on developing an understanding of the structural, analytical and geometrical properties of orthogonal polynomials and special functions. The module will utilise physical, combinatorial and number theory problems to illustrate the theory and give an insight into a plank of applications, whilst including some recent developments in this field. The development will bring aspects of mathematics as well as computation through the use of MAPLE. The topics covered will include: The hypergeometric functions, the parabolic cylinder functions, the confluent hypergeometric functions (Kummer and Whittaker) explored from their series expansions, analytical and geometrical properties, functional and differential equations; sequences of orthogonal polynomials and their weight functions; study of the classical polynomials and their applications as well as other hypergeometric type polynomials. |
||

MA572 - Complex Analysis | 15 | |

This module is concerned with complex functions, that is functions which are both defined for and assume complex values. Their theory follows a quite different development from that of real functions, is remarkable in its directness and elegance, and leads to many useful applications.Topics covered will include: Complex numbers. Domains and simple connectivity. Cauchy-Riemann equations. Integration and Cauchy's theorem. Singularities and residues. Applications. |
||

MA574 - Polynomials in Several Variables | 15 | |

Systems of polynomial equations arise naturally in many applications of mathematics. This module focuses on methods for solving such systems and understanding the solutions sets. The key abstract concept is an ideal in a commutative ring and the fundamental computational concept is Buchberger's algorithm for computing a Groebner basis for an ideal in a polynomial ring. The syllabus includes: multivariate polynomials, Hilbert's Basis Theorem, monomial orders, division algorithms, Groebner bases, Hilbert's Nullstellensatz, elimination theory, linear equations over systems of polynomials, and syzygies. |
||

MA587 - Numerical Solution of Differential Equations | 15 | |

Most differential equations which arise from physical systems cannot be solved explicitly in closed form, and thus numerical solutions are an invaluable way to obtain information about the underlying physical system. The first half of the module is concerned with ordinary differential equations. Several different numerical methods are introduced and error growth is studied. Both initial value and boundary value problems are investigated. The second half of the module deals with the numerical solution of partial differential equations. The syllabus includes: initial value problems for ordinary differential equations; Taylor methods; Runge-Kutta methods; multistep methods; error bounds and stability; boundary value problems for ordinary differential equations; finite difference schemes; difference schemes for partial differential equations; iterative methods; stability analysis. |
||

MA595 - Graphs and Combinatorics | 15 | |

Combinatorics is a field in mathematics that studies discrete, usually finite, structures, such as graphs. It not only plays an important role in numerous parts of mathematics, but also has real world applications. In particular, it underpins a variety of computational processes used in digital technologies and the design of computing hardware. Among other things, this module provides an introduction to graph theory. Graphs are discrete objects consisting of vertices that are connected by edges. We will discuss a variety of concepts and results in graph theory, and some fundamental graph algorithms. Topics may include, but are not restricted to: trees, shortest paths problems, walks on graphs, graph colourings and embeddings, flows and matchings, and matrices and graphs. In addition to graphs, the module may cover other topics in combinatorics such as: problems in extremal set theory, enumerative problems, Principle of Inclusion and Exclusion, and, for M-level students, Ramsey theory, computational complexity and the P versus NP problem. |
||

MA603 - Introduction to Lie Groups and Lie Algebras | 15 | |

Lie groups and their associated Lie algebras are studied by both pure and applied mathematicians and by physicists; this is a topic renowned for both its mathematical beauty and its immense utility. Lie groups include translation, rotation and scaling groups as well as unitary, symplectic and special linear matrix groups. We will study in detail the lower dimensional groups that arise in many applications, and more general theory such as the structure of their associated Lie algebras. Special topics include a look at the lowest dimensional exceptional Lie group G2, and Lie group actions and their invariants. |
||

MA605 - Symmetries, Groups and Invariants | 15 | |

In this module we will study certain configurations with symmetries as they arise in real world applications. Examples include knots described by "admissible diagrams" or chemical structures described by colouring patterns. Different diagrams and patterns can describe essentially the same structure, so the problem of classification up to equivalence arises. This will be solved by attaching invariants which are then put in normal form to distinguish them. The syllabus will be as follows: (a) Review of basic methods from linear algebra, group theory and discrete mathematics; (b) Permutation groups, transitivity, primitivity, Burnside formula; (c) Finitely generated Abelian groups; (d) Applications to knot theory, Reidemeister moves, the Abelian knot group; (e) Examples, observations, generalizations and proofs. |
||

MA617 - Asymptotics and Perturbation Methods | 15 | |

The lectures will introduce students to asymptotic and perturbation methods for the approximate evaluation of integrals and to obtain approximations for solutions of ordinary differential equations. These methods are widely used in the study of physically significant differential equations which arise in Applied Mathematics, Physics and Engineering. The material is chosen so as to demonstrate a range of mathematical techniques available and to illustrate some different applications which are amenable to such analysis. |
||

MA636 - Stochastic Processes | 15 | |

A stochastic process is a process developing in time according to probability rules, for example, models for reserves in insurance companies, queue formation, the behaviour of a population of bacteria, and the persistence (or otherwise) of an unusual surname through successive generations.The syllabus will include coverage of a wide variety of stochastic processes and their applications: Markov chains; processes in continuous-time such as the Poisson process, the birth and death process and queues. Marks on this module can count towards exemption from the professional examination CT4 of the Institute and Faculty of Actuaries. Please see http://www.kent.ac.uk/casri/Accreditation/index.html for further details. |
||

MA639 - Time Series Modelling and Simulation | 15 | |

A time series is a collection of observations made sequentially in time. Examples occur in a variety of fields, ranging from economics to engineering, and methods of analysing time series constitute an important area of statistics. This module focuses initially on various time series models, including some recent developments, and provides modern statistical tools for their analysis. The second part of the module covers extensively simulation methods. These methods are becoming increasingly important tools as simulation models can be easily designed and run on modern PCs. Various practical examples are considered to help students tackle the analysis of real data.The syllabus includes: Difference equations, Stationary Time Series: ARMA process. Nonstationary Processes: ARIMA Model Building and Testing: Estimation, Box Jenkins, Criteria for choosing between models, Diagnostic tests.Forecasting: Box-Jenkins, Prediction bounds. Testing for Trends and Unit Roots: Dickey-Fuller, ADF, Structural change, Trend-stationarity vs difference stationarity. Seasonality and Volatility: ARCH, GARCH, ML estimation. Multiequation Time Series Models: Spectral Analysis. Generation of pseudo random numbers, simulation methods: inverse transform and acceptance-rejection, design issues and sensitivity analysis. Marks on this module can count towards exemption from the professional examination CT6 of the Institute and Faculty of Actuaries. Please see http://www.kent.ac.uk/casri/Accreditation/index.html for further details. |
||

MA6503 - Communicating Mathematics | 15 | |

The aim of this module is to equip students with the skills needed to communicate mathematics effectively to the world. This module is supported by a series of workshops covering various forms of written and oral communication. Each student will choose a topic in mathematics, statistics or financial mathematics from a published list on which to base their three coursework assessments which include a scientific writing assessment and an oral presentation. |
||

MA771 - Applied Stochastic Modelling and Data Analysis | 15 | |

This applied statistics module focusses on problems that occur in the fields of ecology, biology, genetics and psychology. Motivated by real examples, you will learn how to define and fit stochastic models to the data. In more complex situations this will mean using optimisation routines in MATLAB to obtain maximum likelihood estimates for the parameters. You will also learn how construct, fit and evaluate such stochastic models. Outline Syllabus includes: Function optimisation. Basic likelihood tools. Fundamental features of modelling. Model selection. The EM algorithm. Simulation techniques. Generalised linear models. |
||

MA772 - Analysis of Variance | 15 | |

Analysis of variance is a fundamentally important method for the statistical analysis of data. It is used widely in biological, medical, psychological, sociological and industrial research when we wish to compare more than two treatments at once. In analysing experimental data, the appropriate form of analysis of variance is determined by the design of the experiment, and we shall therefore discuss some aspects of experimental design in this module. Lectures are supplemented by computing classes which explore the analysis of variance facilities of the statistical package R. Syllabus: One-way ANOVA (fixed effects model); alternative models; least squares estimation; expectations of mean squares; distributional results; ANOVA table; follow-up analysis; multiple comparisons; least significant difference; confidence intervals; contrasts; orthogonal polynomials; checking assumptions; residual plots; Bartlett's test; transformations; one-way ANOVA (random effects model); types of experiment; experimental and observational units; treatment structure; randomisation; replication; blocking; the size of an experiment; two-way ANOVA; the randomised complete block design; two-way layout with interaction; the general linear model; matrix formulation; models of full rank; constraints; motivations for using least squares; properties of estimators; model partitions; extra sum of squares principle; orthogonality; multiple regression; polynomial regression; comparison of regression lines; analysis of covariance; balanced incomplete block designs; Latin square designs; Youden rectangles; factorial experiments; main effects and interactions. |
||

MA781 - Practical Multivariate Analysis | 15 | |

This module considers statistical analysis when we observe multiple characteristics on an experimental unit. For example, a sample of students' marks on several exams or the genders, ages and blood pressures of a group of patients. We are particularly interested in understanding the relationships between the characteristics and differences between experimental units. Outline syllabus includes: measure of dependence, principal component analysis, factor analysis, canonical correlation analysis, hypothesis testing, discriminant analysis, clustering, scaling. |

## Teaching and assessment

Teaching amounts to approximately 16 hours of lectures and classes per week. Modules that involve programming or working with computer software packages usually include practical sessions.

The majority of Stage 1 modules are assessed by end-of-year examinations. Many Stage 2 and 3 modules include coursework which normally counts for 20% of the final assessment. Both Stage 2 and 3 marks count towards your final degree result.

### Programme aims

The programme aims to:

- equip students with the technical appreciation, skills and knowledge appropriate to a degree in mathematics
- develop students’ facilities of rigorous reasoning and precise expression
- develop students’ abilities to formulate and solve mathematical problems
- encourage an appreciation of recent developments in mathematics and of the links between the theory of mathematics and its practical application
- provide students with a logical, mathematical approach to solving problems
- provide students with an enhanced capacity for independent thought and work
- ensure students are competent in the use of information technology and are familiar with computers and the relevant software
- provide students with opportunities to study advanced topics in mathematics, engage in research at some level, and develop communication and personal skills

### Learning outcomes

#### Knowledge and understanding

You gain knowledge and understanding of:

- the core principles of calculus, algebra, mathematical methods, discrete mathematics, analysis and linear algebra
- statistics in the areas of probability and inference
- information technology as relevant to mathematicians
- methods and techniques of mathematics
- the role of logical mathematical argument and deductive reasoning.

#### Intellectual skills

You develop your intellectual skills in the following areas:

- the ability to demonstrate a reasonable understanding of mathematics
- the calculation and manipulation of the material written within the programme
- the ability to apply a range of concepts and principles in various contexts
- the ability to use logical argument
- the ability to solve mathematical problems by various methods
- the relevant computer skills
- the ability to work independently.

#### Subject-specific skills

You gain subject-specific skills in the following areas:

- the ability to demonstrate knowledge of key mathematical concepts and topics, both explicitly and by applying them to the solution of problems
- the ability to comprehend problems, abstract the essentials of problems and formulate them mathematically and in symbolic form so as to facilitate their analysis and solution
- the use of computational and more general IT facilities as an aid to mathematical processes
- the presentation of mathematical arguments and conclusions with clarity and accuracy.

#### Transferable skills

You gain transferable skills in the following areas:

- problem-solving skills, relating to qualitative and quantitative information
- communication skills
- numeracy and computational skills
- information-retrieval skills, in relation to primary and secondary information sources, including through online computer searches
- information technology skills such as word-processing, spreadsheet use and internet communication
- time-management and organisational skills, as shown by the ability to plan and implement effective modes of working
- study skills needed for continuing professional development.

## Careers

Through your studies, you acquire many transferable skills, including the ability to deal with challenging ideas, think critically, write well and present your ideas clearly, all of which are considered essential by graduate employers.

Recent graduates have gone into careers in medical statistics, the pharmaceutical industry, the aerospace industry, software development, teaching, actuarial work, Civil Service statistics, chartered accountancy, the oil industry and postgraduate research.

## Entry requirements

### Home/EU students

The University will consider applications from students offering a wide range of qualifications. Typical requirements are listed below. Students offering alternative qualifications should contact us for further advice.

It is not possible to offer places to all students who meet this typical offer/minimum requirement.

Qualification | Typical offer/minimum requirement |
---|---|

A level | AAB including Mathematics grade A (not Use of Mathematics) |

Access to HE Diploma | The University will not necessarily make conditional offers to all Access candidates but will continue to assess them on an individual basis. If we make you an offer, you will need to obtain/pass the overall Access to Higher Education Diploma and may also be required to obtain a proportion of the total level 3 credits and/or credits in particular subjects at merit grade or above. |

BTEC Level 3 Extended Diploma (formerly BTEC National Diploma) | The University will consider applicants holding BTEC National Diploma and Extended National Diploma Qualifications (QCF; NQF; OCR) on a case-by-case basis. Please contact us for further advice on your individual circumstances. |

International Baccalaureate | 34 points overall or 17 points at HL including Mathematics 6 at HL |

### International students

The University receives applications from over 140 different nationalities and consequently will consider applications from prospective students offering a wide range of international qualifications. Our International Development Office will be happy to advise prospective students on entry requirements. See our International Student website for further information about our country-specific requirements.

Please note that if you need to increase your level of qualification ready for undergraduate study, the School of Mathematics, Statistics and Actuarial Science offers a foundation year.

#### English Language Requirements

Please see our English language entry requirements web page.

Please note that if you are required to meet an English language condition, we offer a number of 'pre-sessional' courses in English for Academic Purposes. You attend these courses before starting your degree programme.

### General entry requirements

Please also see our general entry requirements.

## Fees

The 2018/19 entry tuition fees have not yet been set. As a guide only, the 2017/18 tuition fees for this programme are:

UK/EU | Overseas | |
---|---|---|

Full-time |
£9250 | £13810 |

For students continuing on this programme, fees will increase year on year by no more than RPI + 3% in each academic year of study except where regulated.*

### Your fee status

The University will assess your fee status as part of the application process. If you are uncertain about your fee status you may wish to seek advice from UKCISA before applying.

### General additional costs

Find out more about accommodation and living costs, plus general additional costs that you may pay when studying at Kent.

## Funding

#### University funding

Kent offers generous financial support schemes to assist eligible undergraduate students during their studies. See our funding page for more details.

#### Government funding

You may be eligible for government finance to help pay for the costs of studying. See the Government's student finance website.

### Scholarships

#### General scholarships

Scholarships are available for excellence in academic performance, sport and music and are awarded on merit. For further information on the range of awards available and to make an application see our scholarships website.

#### The Kent Scholarship for Academic Excellence

At Kent we recognise, encourage and reward excellence. We have created the Kent Scholarship for Academic Excellence.

For 2018/19 entry, the scholarship will be awarded to any applicant who achieves a minimum of AAA over three A levels, or the equivalent qualifications (including BTEC and IB) as specified on our scholarships pages.

The scholarship is also extended to those who achieve AAB at A level (or specified equivalents) where one of the subjects is either Mathematics or a Modern Foreign Language. Please review the eligibility criteria.