Mathematics
Learn valuable analytical skills while exploring cutting-edge mathematical science.
Learn valuable analytical skills while exploring cutting-edge mathematical science.
Think you've found the right course? We still have spots available through Clearing. Apply now to secure your place and join our dynamic and welcoming community at Kent this September.
Apply nowWe know you care about your career. So we've got a maths course that will set you up for a well-paid one. We rapidly adapt what we teach to reflect the fast-moving graduate employment market, and our courses are built on the research expertise of our world-leading mathematicians.
When most people think of maths, they think of maths in theory alone, but we don't and neither do you. Maths at Kent is dual focused, so as much as theory is important, we care about application. Maths is astronomy, advertising, defense, logistics, media, sales and just about anything else you can think of.
If you bring us your talents in mathematics, we will give you the knowledge, skills and confidence to make it count. Maths is everywhere, and a degree in Mathematics from the University of Kent is your key to getting to wherever you want to go.
Graduates have gone on to a wide range of careers from medical statistics and software development to actuarial work and chartered accountancy.
Learn industry standard software like PROPHET, R and Python.
Take a placement year to boost your professional skills and get paid to do it.
You’ll benefit from free membership of the Kent Maths Society and Invicta Actuarial Society.
You'll learn skills that are highly valued by the best employers in business, finance, computing and engineering.
At Kent, you’re more than your grades. We look at each student’s circumstances as a whole before deciding whether to make an offer to study here. We also take this flexible approach when we receive your exam results. Some courses may prefer your qualifications to include specific subjects, which will be listed below if required.
Check our Clearing vacancy list or call us now +44 (0)1227 768896 to find out if we have a course that’s right for you. See our Clearing website for more details on how Clearing works at Kent.
The following modules are offered to our current students. This listing is based on the current curriculum and may change year to year in response to new curriculum developments and innovation.
To be confirmed.
To be confirmed.
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.
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 vector spaces, linear transformations, eigenvalues and eigenvectors, diagonalisation, orthogonality and applications including conics.
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).
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.
Real Numbers: Rational and real numbers, absolute value and metric structure on the real numbers, induction, 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, limits using Taylor series.”
MAST4011"
This module builds on the Stage 1 Real Analysis 1 module. We will extend our knowledge of functions of one real variable, look at series, and study functions of several real variables and their derivatives.
The outline syllabus includes: Continuity and uniform continuity of functions of one variable, series and power series, the Riemann integral, limits and continuity for functions of several variables, differentiation of functions of several variables, extrema, the Inverse and Implicit Function Theorems.
This module is designed to cover:
Type of optimisation problems.
Linear optimisation: Graphical method, Simplex method, Phase I method, Dual problems,
Transportation problem.
Non-linear optimisation: Unconstrained one dimensional problems, Unconstrained high dimensional problems, Constrained optimisation.
This module builds on MAST4014 Calculus and Differential Equations. The aim is to introduce the mathematical tools to perform calculations and apply these tools to interesting applications in physics. The syllabus is as follows:
Vectors: Introduction of vector algebra and products of vectors. Triple products of vectors. Vector geometry. Vector equations. Vector differentiation. Coordinate systems (Cartesian, plane polar, cylindrical polar and spherical polar coordinates).
Vector Calculus in 3D: Gradient, divergence, curl and the Laplacian. Applications and examples.
Integrals in 2D and 3D: Line integrals. Double and triple integrals. The Jacobian: geometrical interpretation and change of variables in multiple integrals. Green's theorem in the plane. Stokes’ theorem and Divergence theorem (statement and simple examples). Applications in physics.
Classical Mathematical Modelling: Newton’s laws for a single particle, linear momentum, kinetic energy, work, potential energy, conservation of total energy. Angular velocity, angular momentum, moment of a force. Various applications and examples including central forces and simple harmonic motion.
This module builds on MAST4014 Calculus and Differential Equations. We will cover advanced methods for solving ordinary differential equations and introduce, and learn to solve, partial differential equations. We will explore the properties of these differential equations and discuss the physical interpretation of certain equations and their solutions.
Introduction to ODEs: review of ordinary differentiation; what is an ODE; qualitative methods for ODEs; stationary points and stability.
Series methods for ODEs: solution methods for Cauchy-Euler equations; properties of power series; the Frobenius method.
Introduction to linear PDEs.
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.
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, students study linear regression models (including estimation from data and drawing of conclusions), the use of likelihood to estimate models and its application in simple stochastic models. Both theoretical and practical aspects are covered, including the use of R.
Probability: Joint distributions of two or more discrete or continuous random variables. Marginal and conditional distributions. Independence. Properties of expectation, variance, covariance and correlation. Poisson process and its application. Sums of random variables with a random number of terms.
Transformations of random variables: Various methods for obtaining the distribution of a function of a random variable —method of distribution functions, method of transformations, method of generating functions. Method of transformations for several variables. Convolutions. Approximate method for transformations.
Sampling distributions: Sampling distributions related to the Normal distribution — distribution of sample mean and sample variance; independence of sample mean and variance; the t distribution in one- and two-sample problems.
Statistical inference: Basic ideas of inference — point and interval estimation, hypothesis testing.
Point estimation: Methods of comparing estimators — bias, variance, mean square error, consistency, efficiency. Method of moments estimation. The likelihood and log-likelihood functions. Maximum likelihood estimation.
Hypothesis testing: Basic ideas of hypothesis testing — null and alternative hypotheses; simple and composite hypotheses; one and two-sided alternatives; critical regions; types of error; size and power. Neyman-Pearson lemma. Simple null hypothesis versus composite alternative. Power functions. Locally and uniformly most powerful tests.
Composite null hypotheses. The maximum likelihood ratio test.
Interval estimation: Confidence limits and intervals. Intervals related to sampling from the Normal distribution. The method of pivotal functions. Confidence intervals based on the large sample distribution of the maximum likelihood estimator – Fisher information, Cramer-Rao lower bound. Relationship with hypothesis tests. Likelihood-based intervals.
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.
Introduction: Importance of numerical methods; short description of flops, round-off error, conditioning
Solution of linear and non-linear equations: bisection, Newton-Raphson, fixed point iteration
Interpolation and polynomial approximation: Taylor polynomials, Lagrange interpolation, divided differences, splines
Numerical integration: Newton-Cotes rules, Gaussian rules
Numerical differentiation: finite differences
Introduction to initial value problems for ODEs: Euler methods, trapezoidal method, Runge-Kutta methods.
This module covers aspects of Statistics which are particularly relevant to insurance. Some topics (such as risk theory and credibility theory) have been developed specifically for actuarial use. Other areas (such as Bayesian Statistics) have been developed in other contexts but now find applications in actuarial fields. Indicative topics covered by the module include Bayesian Statistics; Loss Distributions; Reinsurance and Ruin; Credibility Theory; Risk Models; Ruin Theory; Generalised Linear Models; Extreme Value Theory. This module will cover a number of syllabus items set out in Subjects CS1 and CS2 – Actuarial Statistics published by the Institute and Faculty of Actuaries.
This module is designed to provide students with an introduction to the use of data analytics tools on large data sets including the analysis of text data. The module will begin by discussing the principles of text-mining and big data. The module will then discuss the techniques that can be used to explore large data sets (including pre-processing and cleaning) and the use of multivariate statistical techniques for supervised and unsupervised learning. The module will conclude by considering several data mining techniques.
Syllabus: What is "big data"? What is text mining? Exploratory data analysis for large datasets, and pre-processing and cleaning; Multivariate statistical analysis (both unsupervised, e.g. factor analysis or principle component analysis, and supervised, e.g. linear discriminant analysis); Data security; Data mining including techniques such as classification trees, neural networks, clustering, text analysis or network analysis.
In this module we study the fundamental concepts and results in game theory. We start by analysing combinatorial games, and discuss game trees, winning strategies, and the classification of positions in so called impartial combinatorial games. We then move on to discuss two-player zero-sum games and introduce security levels, pure and mixed strategies, and prove the famous von Neumann Minimax Theorem. We will see how to solve zero-sum two player games using domination and discuss a general method based on linear programming. Subsequently we analyse arbitrary sum two-player games and discuss utility, best responses, Nash equilibria, and the Nash Equilibrium Theorem. The final part of the module is devoted to multi-player games and cooperation; we analyse coalitions, the core of the game, and the Shapley value.
Revision of complex numbers, the complex plane, de Moivre's andEuler's theorems, roots of unity, triangle inequality
Sequencesand limits: Convergence of a sequence in the complex plane. Absoluteconvergence of complex series. Criteria for convergence. Power series, radiusof convergence
Complexfunctions: Domains, continuity, complex differentiation. Differentiation ofpower series. Complex exponential and logarithm, trigonometric, hyperbolicfunctions. Cauchy-Riemann equations
ComplexIntegration: Jordan curves, winding numbers. Cauchy's Theorem. Analytic functions.Liouville's Theorem, Maximum Modulus Theorem
Singularitiesof functions: poles, classification of singularities. Residues. Laurentexpansions. Applications of Cauchy's theorem. The residue theorem. Evaluationof real integrals.
Possibleadditional topics may include Rouche’s Theorem, other proofs of the FundamentalTheorem of Algebra, conformal mappings, Mobius mappings, elementary Riemannsurfaces, and harmonic functions.
There is no specific mathematical syllabus for this module.Students will study a topic in mathematics or statistics, either individuallyor within a small group, and produce an individual or group project on thetopic as well as individual coursework assignments. Projects will be chosenfrom published lists of individual and of group projects. The coursework andproject-work are supported by a series of workshops covering various forms ofwritten and oral communication and by supervision from an academic member ofstaff.
Theworkshops may include critically evaluating the following: a research articlein mathematics or statistics; a survey or magazine article aimed at ascientifically-literate but non-specialist audience; a mathematical biography;a poster presentation of a mathematical topic; a curriculum vitae; an oralpresentation with slides or board; a video or podcast on a mathematical topic.Guidance will be given on typesetting mathematics using LaTeX.”
This module looks into the training of modern deep neural networks: backpropagation, regularisation, automatic differentiation, computational graphs. Introduces different types of deep neural networks, such as, LSTM, convolutional networks, and autoencoders. Presents the theoretical underpinnings of deep learning and its mechanisms. Delves into selected recent advanced topics in deep learning. Examines applications of deep learning.
Discrete mathematics has found new applications in the encoding of information. Online banking requires the encoding of information to protect it from eavesdroppers. Digital television signals are subject to distortion by noise, so information must be encoded in a way that allows for the correction of this noise contamination. Different methods are used to encode information in these scenarios, but they are each based on results in abstract algebra. This module will provide a self-contained introduction to this general area of mathematics.
Syllabus: Modular arithmetic, polynomials and finite fields. Applications to
• orthogonal Latin squares,
• cryptography, including introduction to classical ciphers and public key ciphers such as RSA,
• "coin-tossing over a telephone",
• linear feedback shift registers and m-sequences,
• cyclic codes including Hamming,
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.
Quantum mechanics provides an accurate description of nature on a subatomic scale, where the standard rules of classical mechanics fail. It is an essential component of modern technology and has a wide range of fascinating applications. This module introduces some of the key concepts of quantum mechanics from a mathematical point of view.
The joint level 6/level 7 curriculum will consist of the following:
• The necessity for quantum mechanics. The wavefunction and Born's probabilistic interpretation.
• Solutions of the time-dependent and time-independent Schrödinger equation for a selection of simple potentials in one dimension.
• Reflection and transmission of particles incident onto a potential barrier. Probability flux. Tunnelling of particles.
• Wavefunctions and states, Hermitian operators, outcomes and collapse of the wavefunction.
• Heisenberg's uncertainty principle.
Additional topics may include applications of quantum theory to physical systems, quantum computing or recent developments in the quantum world.
This is a practical module to develop the skills required by a professional statistician (report writing, consultancy, presentation, wider appreciation of assumptions underlying methods, selection and application of analysis method, researching methods).
Software: R, SPSS and Excel (where appropriate/possible). Report writing in Word. PowerPoint for presentations.
• Presentation of data
• Report writing and presentation skills
• Hypothesis testing: formulating questions, converting to hypotheses, parametric and non-parametric methods and their assumptions, selection of appropriate method,
application and reporting. Use of resources to explore and apply additional tests. Parametric and non-parametric tests include, but are not limited to, t-tests, likelihood
ratio tests, score tests, Wald test, chi-squared tests, Mann Whitney U-test, Wilcoxon signed rank test, McNemar's test.
• Linear and Generalised Linear Models: simple linear and multiple regression, ANOVA and ANCOVA, understanding the limitations of linear regression, generalised linear
models, selecting the appropriate distribution for the data set, understanding the difference between fixed and random effects, fitting models with random effects, model
selection.
• Consultancy skills: group work exercise(s)
This module is designed to cover: Ethics and compliance of data science. Impact of international regulations. Appropriate handling of data. Simple random sampling. Sampling for proportions and percentages. Estimation of sample size. Stratified sampling. Systematic sampling. Cluster sampling. Data streams. Finding frequentist items. Estimating the number of distinct elements. Sparse recovery. Weight-based sampling. Real time analytics. Network data: Density, clustering coefficient, centrality and degree distribution.
Revision of complex numbers, the complex plane, de Moivre's and Euler's theorems, roots of unity, triangle inequality
Sequences and limits: Convergence of a sequence in the complex plane. Absolute convergence of complex series. Criteria for convergence. Power series, radius of convergence
Complex functions: Domains, continuity, complex differentiation. Differentiation of power series. Complex exponential and logarithm, trigonometric, hyperbolic functions. Cauchy-Riemann equations
Complex Integration: Jordan curves, winding numbers. Cauchy's Theorem. Analytic functions. Liouville's Theorem, Maximum Modulus Theorem
Singularities of functions: poles, classification of singularities. Residues. Laurent expansions. Applications of Cauchy's theorem. The residue theorem. Evaluation of real integrals.
Possible additional topics may include Rouche’s Theorem, other proofs of the Fundamental Theorem of Algebra, conformal mappings, Mobius mappings, elementary Riemann surfaces, and harmonic functions.
In this module we study the fundamental concepts and results in game theory. We start by analysing combinatorial games, and discuss game trees, winning strategies, and the classification of positions in so called impartial combinatorial games. We then move on to discuss two-player zero-sum games and introduce security levels, pure and mixed strategies, and prove the famous von Neumann Minimax Theorem. We will see how to solve zero-sum two player games using domination and discuss a general method based on linear programming. Subsequently we analyse arbitrary sum two-player games and discuss utility, best responses, Nash equilibria, and the Nash Equilibrium Theorem. The final part of the module is devoted to multi-player games and cooperation; we analyse coalitions, the core of the game, and the Shapley value.
• Scalar autonomous nonlinear first-order ODEs. Review of steady states and their stability; the slope fields and phase lines.
• Autonomous systems of two nonlinear first-order ODEs. The phase plane; Equilibra and nullclines; Linearisation about equilibra; Stability analysis; Constructing phase portraits; Applications. Nondimensionalisation.
• Stability, instability and limit cycles. Liapunov functions and Liapunov's theorem; periodic solutions and limit cycles; Bendixson's Negative Criterion; The Dulac criterion; the Poincare-Bendixson theorem; Examples.
• Dynamics of first order difference equations. Linear first order difference equations; Simple models and cobwebbing: a graphical procedure of solution; Equilibrium points and their stability; Periodic solutions and cycles. The discrete logistic model and bifurcations.
Statistical machine learning deals with the problem of finding a predictive function based on data, and focuses on the intersection of statistics and machine learning. It involves the development of algorithms that learn from observed data by constructing stochastic models, which can be used for making predictions and decisions. In this module, students study statistical machine learning methods and how they are implemented in R. Both theoretical and practical aspects are covered.
Indicative content: Classification and prediction; K-Nearest Neighbours; cross-validation and bootstrap; classification and regression trees; bagging; random forests; boosting; support vector classifiers; support vector machine (SVM); regression SVM; semisupervised learning.
This module provides an overview of analytical careers in finance and explores the mathematical techniques used by actuaries, accountants and financial analysts. Students will learn about different types of financials assets, such as shares and bonds and how to work out how much they are worth. They will also look at different types of debt and learn how mortgages and other loans are calculated. Developing these themes, the module will explain how to use maths to make financial decisions, such as how much an investor should pay for a financial asset or how a company can decide which projects to invest in or how much money to borrow. Risk management is a vital part of most mathematical careers in finance so the module will also cover different mathematical techniques for measuring and mitigating financial risk. Extension topics may include complex derivatives, economic theories of finance and the dangers of misusing mathematics. The module provides an opportunity to apply complex mathematical techniques to important real-world questions and is excellent preparation for those considering a financial career.
Introduction to financial mathematics: Key uses of mathematics in finance; key practitioners of financial mathematics.
Financial valuation and cash flow analysis: Discounting, Interest rates and time requirements, Future and Present value. Project Evaluation.
Characteristics and valuation of different financial securities: Debt capital, bonds and stocks, valuation of bonds and stocks.
Loans and interest rates: term structure of interest rates, spot and forward rates, types of loan, APR, loan schedules.
Additional topics that may be covered: arbitrage and forward contracts, efficient markets hypothesis, pricing and valuing forward contracts, option pricing and the Black Scholes model, credit derivatives and systemic risks, limitations of mathematical modelling.
Introduction: Principles and examples of stochastic modelling, types of stochastic process, Markov property and Markov processes, short-term and long-run properties. Applications in various research areas.
Random walks: The simple random walk. Walk with two absorbing barriers. First–step decomposition technique. Probabilities of absorption. Duration of walk. Application of results to other simple random walks. General random walks. Applications.
Discrete time Markov chains: n–step transition probabilities. Chapman-Kolmogorov equations. Classification of states. Equilibrium and stationary distribution. Mean recurrence times. Simple estimation of transition probabilities. Time inhomogeneous chains. Elementary renewal theory. Simulations. Applications.
Continuous time Markov chains: Transition probability functions. Generator matrix. Kolmogorov forward and backward equations. Poisson process. Birth and death processes. Time inhomogeneous chains. Renewal processes. Applications.
Queues and branching processes: Properties of queues - arrivals, service time, length of the queue, waiting times, busy periods. The single-server queue and its stationary behaviour. Queues with several servers. Branching processes. Applications.
In addition, level 7 students will study more complex queuing systems and continuous-time branching processes.
This module will cover a number of syllabus items set out in Subject CS2 published by the Institute and Faculty of Actuaries. This is a dynamic syllabus, changing regularly to reflect current practice.
Stationary Time Series: Stationarity, autocovariance and autocorrelation functions, partial autocorrelation functions, ARMA processes.
ARIMA Model Building and Testing: estimation, Box-Jenkins, criteria for choosing between models, diagnostic tests for residuals of a time series after estimation.
Forecasting: Holt-Winters, 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: transfer function models, vector autoregressive moving average (VARM(p,q)) models, impulse responses.
Spectral Analysis: spectral distribution and density functions, linear filters, estimation in the frequency domain, periodogram.
Simulation: generation of pseudo-random numbers, random variate generation by the inverse transform, acceptance rejection. Normal random variate generation: design issues and sensitivity analysis.
This module will cover a number of syllabus items set out in Subject CS2 published by the Institute and Faculty of Actuaries. This is a dynamic syllabus, changing regularly to reflect current practice.
There is no specific mathematical syllabus for this module; students will chose a topic in mathematics, statistics or financial mathematics from a published list on which to base their coursework assessments (different topics for levels 6 and 7). The coursework is supported by a series of workshops covering various forms of written and oral communication. These may include critically evaluating the following: a research article in mathematics, statistics or finance; a survey or magazine article aimed at a scientifically-literate but non-specialist audience; a mathematical biography; a poster presentation of a mathematical topic; a curriculum vitae; an oral presentation with slides or board; a video or podcast on a mathematical topic. Guidance will be given on typesetting mathematics using LaTeX.
There is no specific mathematical syllabus for this module. Students will study a topic in mathematics or statistics, either individually or within a small group, and produce an individual or group project on the topic as well as individual coursework assignments. Projects will be chosen from published lists of individual and of group projects. The coursework and project-work are supported by a series of workshops covering various forms of written and oral communication and by supervision from an academic member of staff.
The workshops may include critically evaluating the following: a research article in mathematics or statistics; a survey or magazine article aimed at a scientifically-literate but non-specialist audience; a mathematical biography; a poster presentation of a mathematical topic; a curriculum vitae; an oral presentation with slides or board; a video or podcast on a mathematical topic. Guidance will be given on typesetting mathematics using LaTeX.
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.
For a student studying full time, each academic year of the programme will comprise 1200 learning hours which include both direct contact hours and private study hours. The precise breakdown of hours will be subject dependent and will vary according to modules.
Methods of assessment will vary according to subject specialism and individual modules.
Please refer to the individual module details under Course Structure.
The programme aims to:
You gain knowledge and understanding of:
You develop your intellectual skills in the following areas:
You gain subject-specific skills in the following areas:
You gain transferable skills in the following areas:
A maths degree from Kent will set you up for a wide range of careers in areas including medical statistics, pharmaceuticals, aerospace, accounting and software development.
A highlight of my placement was presenting my final piece of independent work – a deep dive into ‘what makes a globally successful TV series’.
The 2024/25 annual tuition fees for this course are:
For details of when and how to pay fees and charges, please see our Student Finance Guide.
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.*
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.
Find out more about accommodation and living costs, plus general additional costs that you may pay when studying at Kent.
Kent offers generous financial support schemes to assist eligible undergraduate students during their studies. See our funding page for more details.
We have a range of subject-specific awards and scholarships for academic, sporting and musical achievement.
Student Life
In the QS World University Rankings 2024, Kent has been ranked 39th within the UK and is in the top 25% of Higher Education Institutions worldwide.
Kent Sport
Kent has risen 11 places in THE’s REF 2021 ranking, confirming us as a leading research university.
An unmissable part of your student experience.