2

What is your background? I did my undergraduate degree at Oxford University before working as a programmer for an Investment Bank for a year. I made a rapid exit from the city world and returned to academia, where I completed my PhD in Computational Linguistics (a blend of Statistics and Linguistics) in 2012. I was extensively involved in the departmental/college teaching there along with interviewing prospective Maths and Computer Science undergraduates. My love of teaching there led me to taking a week’s holiday to spend at my old school, Tiffin, who kindly let me teach a number of lessons to get a proper feel of the profession. The rest is history, and I have taught at Tiffin School since. I have a few awards including:  Oxford University Teaching Prize 2012: Awarded to 4 academics within the Mathematical, Physical and Life Sciences Division.  Microsoft Research Prize 2008: Awarded for Best Undergraduate Dissertation in the Oxford University Computer Science faculty.  My department has been shortlisted for ‘Times Educational Supplement Maths Department of the Year 2016’, in part due to the exceptional progress of students in maths competitions, where the number of students qualifying annually for UKMT Maths Olympiads rose from 15 to 42 in a space of three years. I regularly speak at the ‘Maths in Action’ events for The Training Partnership held at the Institute of Education. Each event usually comprises of around 900 A Level students and teachers. What is the new homework system you are developing? The new system will allow students to take online assessments on topics across the national curriculum (and beyond), either as homework set by a teacher or for more informal practice. Teachers can manage students’ accounts and monitor their progress. There will also be tools for teachers to build their own homeworks and add to a user-contributed library. The currently planned types of questions are:  Textual (simple keywords).  Numeric (allowing accuracy to be specified).  Multiple choice.  Ordering existing items (e.g. ordering decimals or parts of a proof).  Numeric or algebraic expressions. I have developed an algorithm to determine if two algebraic expressions are equivalent, whether ‘structurally equivalent’ (where the expressions are equivalent if the operands of commutative operators can be reordered, e.g. (𝑎 − 𝑏) × ð‘ would be equivalent to 𝑐(−𝑏 + 𝑎)) or ‘value equivalent’, where the expressions are equivalent if they are equal for all possible values of the variables, e.g.