SAT Math Mastery: Tackling the Hardest Problems for an 800
SAT Score Range
•
3 sessions
•
NK
RC
OA
+7
This series ended on August 12, 2025. All 1:1 and group chats related to this series are disabled 7 days after the last session.
About
Get ready to take on the toughest SAT math problems with a clear, focused game plan. As an 800 scorer, I’ll walk you through how to break down challenging questions, point out common traps, and share strategies that boost confidence, speed, and accuracy so you can reach your highest score.
Tutored by
Schedule
✋ ATTENDANCE POLICY
Feel free to attend any session and you don't need to have attended previous sessions to join in!
SESSION 1
10
Aug
SESSION 1
SAT Math
SAT Math
Sun 2:00 PM - 3:00 PM UTCAug 10, 2:00 PM - 3:00 PM UTC
We’ll tackle the toughest SAT math problems, focusing on advanced algebra, functions, geometry, trig, word problems, and data analysis. Each session will break down tricky concepts, highlight common traps, and teach strategies for speed and accuracy.
SESSION 2
11
Aug
SESSION 2
SAT Math
SAT Math
Mon 2:00 PM - 3:00 PM UTCAug 11, 2:00 PM - 3:00 PM UTC
We will go over more handpicked difficult problems from a mix of sources including the 150 Hardest SAT Questions from PrepPros aswell as Collegeboard questions that are currently inactive (meaning you won't see them on Bluebook in a practice test). Format will be:
1. You try the problem
2. Everyone presents their answers
3. Someone will volunteer to walk us through it
4. I'll explain how I would go about the problem / set it up and solve if necessary
SESSION 3
12
Aug
SESSION 3
SAT Math
SAT Math
Tue 2:00 PM - 3:00 PM UTCAug 12, 2:00 PM - 3:00 PM UTC
We will go over more handpicked difficult problems from a mix of sources including the 150 Hardest SAT Questions from PrepPros aswell as Collegeboard questions that are currently inactive (meaning you won't see them on Bluebook in a practice test). Format will be:
1. You try the problem
2. Everyone presents their answers
3. Someone will volunteer to walk us through it
4. I'll explain how I would go about the problem / set it up and solve if necessary