Select Page

Ultimate CTMUA / TMUA Bundle

£759.00 for 8 months

☚ Click here to go back to all currently-available Cambridge CTMUA courses.

☚ Click here to go back to all currently-available TMUA courses.

Combines our Live Zoom October CTMUA/TMUA Proof and Logic (Paper 2) Course with access to all the online CTMUA/TMUA resources from our Platinum CTMUA/TMUA Bundle for 1 year.

Live Zoom Courses:

CTMUA/TMUA Proof and Logic (Paper 2) Course

Details: October 10th – 11th, 10am – 4:30pm (9:30am first day)

Location: Live on Zoom

Following up our popular summer course on the rapid-fire short maths questions found in both TMUA papers, we present a similar course targeted at the unique proof- and logic-based questions in Paper 2 of the TMUA.
We know at this point in your preparation, you will probably have tackled the majority of the past papers, so this course will cover original questions that we have created especially. The style of question found in Paper 2 is unlike anything you will see at A-level and will require practice at logical reasoning, manipulating quantifiers, negations, and conditionals, and analysing proofs. These are also skills that are vital for a degree in Computer Science or Maths, so you may well be tested on them if you are invited to interview too.

PLUS 1 year of access to pre-recorded versions of our:

  • CTMUA/TMUA Paper 1 Course (pre-recorded version of 1-day course covering TMUA-style questions on: inequalities and estimates, polynomials, graph-sketching, combining functions, inferences)

to allow you to catch up on material you may have missed.

PLUS: all of the contents of our Platinum CTMUA/TMUA Bundle (usually £349).

See bottom of page for more information about the courses and what they contain.

Categories: , , ,

Description

A bundle comprising:

Live Courses:

CTMUA/TMUA Proof and Logic (Paper 2) Course

  • Details: October 10th – 11th, 10am – 4:30pm (9:30am first day)
  • Location: Live on Zoom
  • Content includes:
    • Necessary and sufficient conditions
    • Quantifiers, negations, and conditionals
    • Flaws in proofs
    • Counterexamples, consequences and assumptions
    • Common logical or mathematical pitfalls

 

Plus access to pre-recorded versions of our:

  • CTMUA/TMUA Paper 1 Course (pre-recorded version of 1-day course covering TMUA-style questions on: inequalities and estimates, polynomials, graph-sketching, combining functions, inferences)

to allow you to catch up on material you may have missed.

 

Plus the following online resources:

TMUA Past Paper Video Solutions

Detailed solution videos for the following TMUA papers:

  • TMUA specimen papers A and B
  • TMUA practice papers A and B
  • TMUA 2017 and 2018
  • 2019 coming soon!

 

TMUA Mock Papers

Two original TMUA mock papers by The Oxbridge Formula, including full solutions

 

At-Interview-Test Preparation from CSAT

The CSAT is excellent practice for the at-interview tests that you may have to sit if invited for interview at Cambridge. It tests algorithmic thinking and computational thinking, which will be tested at interview even if you don’t have an additional test.

Includes full sample paper video solutions, plus further questions on topics common in these tests, all with their own video solutions.

 

MAT Multiple Choice Video Solutions

Detailed solution videos for every multiple choice MAT question from:

  • All MAT papers 2007-2018 (2019 coming soon!)
  • MAT specimen papers A and B

 

Useful Maths Theory for Admissions Tests

Introducing and explaining maths material needed for admissions tests that you may not have seen at school yet:

  • Advanced differentiation and integration
  • Vectors and geometry
  • Algebraic expressions with arbitrary powers
  • Tricks to go faster, avoid errors, and spot clues

 

TMUA/MAT Warm-up Questions

Original practice questions on 9 common Maths topics by The Oxbridge Formula, with video solutions

 

Original Extra Maths Multiple Choice Questions

150+ original multiple choice questions by The Oxbridge Formula, with video solutions

 

Example video:

0