Week 3 — Systems, Graphing, and Full Simulation
← Back to main study plan | ← Week 2
Goal this week: convert the biggest point-loss area on the June 25 exam (Part III multi-step systems and Part IV graphing) into reliable points. End with a full-length simulation.
Time: ~60 min weekdays, ~3 hours Saturday.
Heuristics in heavy use: H1 (read prompt twice, circle every noun), H4 (simplest form), plus the graphing rubric checklist.
Monday — Linear-Quadratic Systems
Objective
Solve linear-quadratic systems all the way through to ordered pairs . The June 25 Q34 lost a point because -values were found but -values were missed or had wrong signs.
The completion checklist (use on EVERY problem)
- Did I find every value the quadratic produces?
- Did I back-substitute each into the linear equation (it’s easier)?
- Did I keep the negative signs through back-substitution?
- Did I write my final answer as ordered pairs , not just values?
Practice problems
Solve each system algebraically. Report all solutions as ordered pairs.
1.
2. (Q34)
3.
4.
5.
6.
Answers
1. and . 2. and . 3. and . 4. and . 5. and . 6. and .
Worked solution for #2 (the Q34 redo)
H1: prompt asks for and .
Linear equation: .
Substitute into the quadratic: .
.
or .
Back-substitute into the linear equation (H3 — keep signs):
Worked solution for #5 (downward parabola)
Set equal: .
or .
Back-substitute into :
Self-check question
After solving the quadratic, which equation should you back-substitute into and why? (The linear equation — arithmetic is simpler and less error-prone than re-squaring.)
Tuesday — Systems of Inequalities (Algebra + Graph)
Objective
Graph a system of inequalities with correct line types, correct shading, and labels — the three things graders specifically check.
Graph rubric (every problem must satisfy this)
| Element | Required |
|---|---|
| Axes labeled | "" and "" or context labels |
| Scale | tick marks at consistent intervals |
| Line | solid for or ; dashed for or |
| Plotted points | at least 2 per line, both intercepts when possible |
| Arrows | both ends of every infinite line |
| Shading | correct side of each boundary; overlap distinctly visible |
| Labels | each inequality named on its line (e.g., "") |
Workflow
- Convert each inequality to slope-intercept form.
- Decide solid vs dashed from the inequality sign.
- Plot the line.
- Test the point — if it satisfies, shade that side; if not, shade the other side.
- Label the line.
- Identify the overlap and outline it.
Practice problems
Graph each system. Show your work on each step.
| # | System |
|---|---|
| 1 | and |
| 2 | and |
| 3 | and |
| 4 | and and |
| 5 | and |
Worked solution for #2
Inequality A: . Solid line, slope 1, -intercept . Test : ✓ — shade where lives (above the line).
Inequality B: . Solid line, slope , -intercept . Test : ✓ — shade below the line.
Overlap: the region above the first line AND below the second. Outline that region in pen.
Label each line with its inequality near a prominent part of the line.
Self-check question
What test point should you use to determine which side to shade? ( is almost always easiest — unless the line passes through the origin, in which case use or .)
Wednesday — Word-to-System Translation + Q35 Redo
Objective
Translate two-quantity word problems into a full system: inequalities + graph + valid combination + justification. Then re-do Q35 end-to-end.
Translation template
Every two-quantity word problem decomposes into:
- Money / value inequality:
- Quantity / capacity inequality:
- Domain limits if are real-world counts: ,
Solution template (4 deliverables)
- System of inequalities written clearly.
- Graph following the Tuesday rubric.
- Combination — a point in the feasible region. Verify both inequalities numerically.
- Justification — a sentence stating which inequalities are satisfied and why the combination is valid.
Practice problems
1. Marcus sells lemonade at $2/cup and cookies at $3/cookie. He wants to earn at least $60 at the fair. He can carry max 40 items total. Let = cups, = cookies. Write the system, graph it, state a valid combination, justify.
2. A bookstore sells novels for $15 and cookbooks for $25. To break even today they must earn at least $300. They have shelf space for at most 30 books. Let = novels, = cookbooks. System, graph, combination, justification.
3. Sarah’s babysitting + tutoring problem (Q35 redo): $6/hr babysitting (), $12/hr tutoring (), at least $120/week, max 14 hours total. System, graph, combination, justification.
4. A coffee shop has two drinks: lattes ($4) and teas ($3). The owner needs to sell at least $200 worth in an hour. The shop can make at most 60 drinks per hour. Let = lattes, = teas. System, graph, combination, justification.
Worked solution for #3 (Q35 redo)
Full worked solution
System:
Convert for graphing:
- . Solid line. Test : ? No — shade above (away from origin).
- . Solid line. Test : ? Yes — shade below (toward origin).
Graph the feasible region as the intersection of those two shaded regions, restricted to the first quadrant (, ).
Combination: babysitting hours, tutoring hours.
- Money: ✓
- Hours: ✓
Justification: “Working 4 hours babysitting and 10 hours tutoring satisfies both constraints. Sarah earns $144 (which meets the $120 goal) and works exactly 14 hours (within the 14-hour limit).”
Self-check question
How do you decide whether to shade above or below a boundary line? (Pick a test point not on the line — usually . If it satisfies the inequality, shade that side; otherwise, the other side.)
Thursday — Graphing Functions from Scratch
Objective
Drill graphing fidelity. Every graph must satisfy the rubric: labeled axes, scale, plotted points, arrows, and (for inequalities) shading.
Instructions
- Graph all 8 functions on separate coordinate grids.
- For each, plot at least 3 points and the key feature (intercept for lines, vertex for parabolas, etc.).
- Apply arrows on both ends of every infinite curve.
- Self-check against the rubric checklist after each one.
Practice — graph these
| # | Function | Key features |
|---|---|---|
| 1 | -int ; slope ; passes through | |
| 2 | -int ; -int | |
| 3 | vertex ; -ints ; opens up | |
| 4 | vertex ; opens down; -ints and | |
| 5 | V-shape, vertex , opens up | |
| 6 | V-shape, vertex , opens up | |
| 7 | and on same axes (Q31!) — find intersection visually | intersections at and |
| 8 | -ints and ; vertex at , |
Worked plotting plan for #7 (Q31 redo)
Line :
- Passes through .
- Slope : from go right 1, down 3 to .
- Other points: , .
- Draw as a straight line with arrows on both ends.
Parabola :
- Vertex at .
- Symmetric points: , , .
- Smooth U-shape opening up. Arrows on both branches.
Intersection points (visually and algebraically):
- and — both curves pass through these.
- Algebraically: .
State: and .
Self-check rubric
After each graph, score yourself:
- ☐ Both axes labeled
- ☐ Scale visible (tick marks)
- ☐ Key feature plotted (vertex / intercept)
- ☐ At least 2 other points plotted
- ☐ Arrows on infinite ends
- ☐ Line/curve labeled with its equation
A graph that misses any of these would lose points on the Regents.
Friday — Timed Part III + Part IV
Objective
Final dress rehearsal before Saturday’s full simulation. Apply every checklist under timed pressure.
Instructions
- Pull Part III (Q31–Q34) and Part IV (Q35) from a prior Regents administration.
- Timer: 60 minutes.
- Work in pen. Use the linear-quadratic completion checklist on every system problem.
- Use the graphing rubric on every graph.
- Score strictly against the Model Response Set.
Self-score targets
- Part III: 12+ / 16
- Part IV: 5+ / 6
What to do with misses
For every lost point, identify which checklist item failed:
- Did you skip the back-substitution step? (Completion checklist #2)
- Did you forget a negative sign? (Checklist #3)
- Did you give -values only? (Checklist #4)
- Did you forget to shade or label a graph? (Graphing rubric)
- Did you forget the justification on Q35-type problems? (Solution template #4)
Each of these is a process failure, not a knowledge failure. Re-do the problem on Saturday morning before the full simulation.
Saturday — Full-Length Regents Simulation (3 hours)
Objective
Realistic, end-to-end measurement of progress.
Instructions
- Setup: print a complete prior Regents Algebra I (any released year). Sit at a clear table. No phone, no distractions.
- Timer: 3 hours, no break. Bring a graphing calculator, ruler, pen, and pencil (graphs only).
- Work the test in order. Apply every heuristic and checklist from the past three weeks.
- Score immediately afterward against the Model Response Set.
Score breakdown to record
| Part | Possible | Earned | vs. June 25 baseline |
|---|---|---|---|
| I (MC) | 48 | __ | 44 |
| II (2-pt) | 12 | __ | 10 |
| III (4-pt) | 16 | __ | ~5 |
| IV (6-pt) | 6 | __ | ~3 |
| Raw total | 82 | __ | 62 |
Success bar for Week 3
- Raw score 70 (up from 62) — that’s a scale score of ~85+, the Mastery threshold.
- Zero “didn’t finish” errors on multi-step problems.
- Zero graphing rubric misses.
Post-test reflection
Write 1–2 paragraphs in the Mistake Log:
- What worked? Which heuristics fired automatically?
- What still needs work? Which patterns showed up multiple times?
- What’s the next focus? Based on remaining gaps.
If raw score is below 70, repeat the day(s) of the corresponding weak area before retaking the test.
After Week 3
You’ve completed 21 sessions of focused work. The next 2–3 weeks before the actual Regents should be:
- One full-length simulation per week under timed conditions.
- Daily 20-minute mistake-log review — flip through the entries and re-do any problem you no longer instantly see the solution to.
- Targeted drills on whatever pattern shows up most in your latest simulation.
The pattern is durable: every Regents mistake fits into one of the H1–H5 buckets. If you keep tagging and reviewing, the failure modes get harder and harder to repeat.