Welcome! In this class, we will cover topics to prepare you for the AMC 10 competition. This class will move at a somewhat quick pace and will cover problems of various difficulties within the AMC 10. We will only briefly cover the underlying concepts so we can focus on problem solving skills and cover as many kinds of problems as possible. However, resources to learn more about certain concepts covered in class will be provided. Prerequisite: high school geometry (we will only cover geometry for one week so algebra 1 also can work), previous math competition experience Topics: First week: Algebra Second week: Number Theory Third week: Counting and Probability Fourth week: Geometry

This is a 3-week, weekly course where we teach the basics of competitive programming, including some USACO Bronze topics and CodeForces problems about 800-1000 in rating. Each session, we'll go over one concept from competitive programming. The topics we will likely cover are: 1. Introduction + math 2. Strings 3. Data structures 4. Simulation/brute force 5. Sorting 6. Greedy problems Prerequisites: familiarity with Python, Java, or C++ (if you haven't learned these, please visit w3schools for a tutorial)

We will cover inequalities, starting with basic 1-variable inequalities, then moving on to graphing 2-variable/2d inequalities on a coordinate plane, and then solve 1d and 2d compound inequalities and inequality systems.

Prerequisites: learners should be comfortable with the basics (loops, variables, functions, arrays, data types) in a programming language, preferably c++, but python and java are also acceptable choices. As long as you are generally comfortable with the core programming concepts, you should be ready for this course. First, we'll learn how to read a programming problem, read input, and write output. Then, we'll go over a few problems from the CodeForces problemset, a website with many programming problems, each with a difficulty rating, that range from simple (800) to extremely complex (3000). This session will cover some of the simplest problems, approximately 800-1000. Competitive programming is a competition where contestants solve a set of problems (usually about 5) in an exam environment (sometimes virtual). Competitive programming strengthens your mathematical and programming problem-solving skills and relies heavily on DSA, or data structures and algorithms, to complete tasks in a short amount of time with as little memory used as possible.

In this session, we will go over the basics of quadratics: what they are, some properties of them, how to solve them, and some examples of problems with quadratics. Prerequisites: students should have a solid foundation in prealgebra and being comfortable with most algebra 1 topics (especially linear equations and adding/subtracting polynomials). Quadratics are one of the hardest topics in algebra 1! Showing your face and answering questions out loud would be much appreciated. However, whether you use the meeting chat (which is ok!) or answering questions out loud, don't be scared of answering something wrong; answer it wrong, (or right), confidently, but still be open to new ideas.