Background

I'm a current student at a Grammar School in the UK, studying Mathematics, Further Mathematics, Computer Science and Physics.
I'm applying for the Joint Honours Mathematics and Computer Science course at Oxford in 2026.
My UCAS predicted grades are 4 A*s.
I have sat only one MAT practice paper (2007) in exam conditions so far, getting 80/100. Keep in mind earlier papers are generally considered to be slightly easier.

Market only resolves yes if I get in next year, not if I reapply for the following year.
Ask any questions and I will answer.

I will not bet on this market

This is an AI-generated summary of things mentioned in my personal statement so far (removed the full version as I was told it's not recommended to post online):

• Used mathematics and computer science to explore interdisciplinary interests.

• Watched a video on Grover’s algorithm, learned Qiskit, and implemented Grover’s search, quantum teleportation, and other quantum circuit models in code.

• Deepened understanding of matrix unitarity, inner products, abstract vector spaces, state spaces, tensor products, and measurement operators through quantum computing projects.

• Visited the Diamond Light Source Synchrotron and saw AI algorithms determining protein structure.

• Studied 3Blue1Brown’s Deep Learning series and an article on building neural networks from scratch; derived and implemented backpropagation from first principles using chain and product rules and partial differentiation, then coded it in Python.

• Gave a five‑minute talk on AI risks (reward hacking, instrumental convergence, corrigibility) for Oxford’s Big Think competition.

• Explored encryption in depth: learned RSA key production, investigated modular arithmetic, and programmed the RSA algorithm in Python.

• Researched Shor’s algorithm and implemented the Quantum Fourier Transform in Qiskit.

• Studied 3Blue1Brown’s linear algebra series; applied geometric insights to code a reflective‑sphere shader in GLSL using raymarching and 3D vector geometry.

• Explored complex analysis and rendered the Mandelbrot set in GLSL.

• Developed an automated stock‑trading bot for your computing NEA: analysed large datasets with pandas, designed a GUI, and integrated a trading API.

• Achieved distinction (top 5% and best in school) in the 2023 Perse Coding Challenge Round 1, merit in the final, and top 25% in the 2023 British Informatics Olympiad.

• Coded a pitch‑recognition training program to sharpen music skills.

• Built an automatic solver for a Rubik’s Pyramid using brute‑force search.

• Completed Kevin Buzzard’s Natural Numbers Game in Lean, using Peano’s axioms to prove statements and learning about type‑theory‑based theorem provers.