Courses and Lectures

• We have 40+ lectures and talks and attending every lecture would not be physically and mentally possible as each lecture would be quite rigorous.

• Hence, we decide to introduce the course structure!

• The selected students and the awardees would be given choice to select as many courses as they want, depending on how free they are during the whole month

• These courses would be week-long.

• These courses have 2-3 sub lectures. Students are advised to attend all the classes of their selected course.

• Problem sets would also be provided and students are supposed to try them. There would be office hours where students would ask their doubts or in general, ask for hints on the question they are stuck.

• Each olympiad area has 4 courses.

• The number 1,2,3,4 denotes the difficulty of the courses, where 1 stand for the easiest and 4 is the hardest.

• Hence, in the span of 4 weeks, we would be covering 16 courses. Note that some courses' sub lectures would be running simultaneously.

Number Theory

In Number Theory, we have four different levels, with 1000 being the easiest ( and requiring no prerequisites ) to 4000 being the hardest.

NT 1000

• Introduction to Number Theory - Sunaina Pati

• Exponents and Orders - Ananya Ranade

• Constructions in Number Theory - Rohan Goyal

Requisites: None

An entry-level course for Number theory where we develop theory from FLT and go till orders and LTE. We would also do some fun construction in number theory.

NT 2000

• Quadratic Residues and Legendre symbol manipulation - Sidharth Suresh

• Sizes and Density in Number Theory- Archit Manas

Requisites: Familiar with NT 1000's theory i.e familiar with FLT, Euler's theorem, orders, LTE

An intermediate-level course for Number theory where we develop theory from QRs and Legendre Symbol. We would also play with bounding, sizes and density problems.

NT 3000

• Polynomials in Number Theory- Sanjana Das

• Rational points on Elliptic Curve - Pranav Choudhary

Requisites: Familiar with NT 1000's theory i.e familiar with FLT, Euler's theorem, orders, LTE

An intermediate-level course for Number theory where we do polynomial-related theory and polynomials. We would also talk about Elliptic curves.

NT 4000

• Algebraic Number Theory- Aahan Chatterjee

Requisites: Familiar with NT 1000, 2000, 3000's theory i.e familiar with FLT, Euler's theorem, orders, LTE, QRs, Polynomials in NT

An advanced-level course for Number theory where we develop theory around Gaussian integers and cyclotomic polynomials.

Combinatorics

In combinatorics, we have four different levels, with 1000 being the easiest ( and requiring no prerequisites ) to 4000 being the hardest.

COMBO 1000

• Introduction to Combinatorics - Rohinee Joshi

• PSS in Equality - Ananya Ranade

• PSS in Local flavoured Problems- Yash Vardhan

• Mathematics of Languages - Kalash Bhaiya

Requisites: None

An entry-level course for Combinatorics where we develop theory from PHP and then do some problem-solving.

COMBO 2000

• Combinatorial Games and Processes- Atul Shatavart Nadig

• Game Theory #1 - Rohinee Joshi

• Maximal Object in Combinatorics - Anant Mudgal

• Burnside Lemma - Kaustav Mishra

Requisites: Familiar with COMBO 1000's theory i.e familiar with PHP.

An intermediate-level course for Combinatorics where we solve a lot of problems revolving around games. We would also play with grids.

GRAPH 3000

• Introduction to Graph Theory- Rushil Mathur

• PSS in Graph Theory - Kazi Aryan Amin

• Extremal Graph Theory - Kanav Talwar

Requisites: Familiar with COMBO 1000's theory i.e familiar with PHP, etc.

An intermediate-level course for Combinatorics where we learn about Graph Theory and Extremal Graph Theory. We would also solve some problems revolving around the topics.

COMBO 4000

• Game Theory # 2- Bhavya Agrawalla

• Algorithms + Graph Theory - Kshitij Sodani

• Grids - Kazi Aryan Amin

• Complexity Theory - Shourya Pandey

• Arrows - Vedant Saini

Requisites: Familiar with COMBO 1000, 2000, 3000's theory i.e familiar with Graph Theory, PHP and be comfortable with hard problems.

An advanced-level course for Combinatorics where we learn about probabilistic methods and expectations. Pretty fun!