TPT
Total:
$0.00

Algebra 1 Project and Review Activity Bundle

;
STEM Nerdd
134 Followers
Grade Levels
7th - 10th
Standards
Formats Included
  • Google Slidesβ„’
Pages
19 projects
$21.00
List Price:
$31.59
You Save:
$10.59
Bundle
$21.00
List Price:
$31.59
You Save:
$10.59
Bundle
Share this resource
Report this resource to TPT
STEM Nerdd
134 Followers
Includes Google Appsβ„’
This bundle contains one or more resources with Google apps (e.g. docs, slides, etc.).

Products in this Bundle (19)

    showing 1-5 of 19 products

    Description

    This growing bundle has 18+ projects that I use in my Algebra 1 class. Create Your Own Business with Linear Equations, Slope Ramp Accessibility, Quadratics, Sequences, Holiday Themed Projects, and so much more. Can you tell I like project based learning? Highly engaging projects that encourage student creativity.

    Total Pages
    19 projects
    Answer Key
    N/A
    Teaching Duration
    2 months
    Report this resource to TPT
    Reported resources will be reviewed by our team. Report this resource to let us know if this resource violates TPT’s content guidelines.

    Standards

    to see state-specific standards (only available in the US).
    Create equations and inequalities in one variable and use them to solve problems.
    Create equations in two or more variables to represent relationships between quantities; graph equations on coordinate axes with labels and scales.
    Represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret solutions as viable or non-viable options in a modeling context. For example, represent inequalities describing nutritional and cost constraints on combinations of different foods.
    Use function notation, evaluate functions for inputs in their domains, and interpret statements that use function notation in terms of a context.
    Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers. For example, the Fibonacci sequence is defined recursively by 𝘧(0) = 𝘧(1) = 1, 𝘧(𝘯+1) = 𝘧(𝘯) + 𝘧(𝘯-1) for 𝘯 greater than or equal to 1.

    Reviews

    Questions & Answers

    134 Followers