Maze - Recursive Formula of Arithmetic Sequence given first terms

Maze - Recursive Formula of Arithmetic Sequence given first terms
Maze - Recursive Formula of Arithmetic Sequence given first terms
Maze - Recursive Formula of Arithmetic Sequence given first terms
Maze - Recursive Formula of Arithmetic Sequence given first terms
Maze - Recursive Formula of Arithmetic Sequence given first terms
Maze - Recursive Formula of Arithmetic Sequence given first terms
Maze - Recursive Formula of Arithmetic Sequence given first terms
Maze - Recursive Formula of Arithmetic Sequence given first terms
File Type

PDF

(3 MB|7 pages)
Product Rating
3.7
(1 Rating)
Standards
Also included in:
  1. This bundle includes a total of 18 mazes (Close to 50% OFF). Each of these mazes is sold separately at my store. Please visit the links below for more details about each individual product. The mazes are:ARITHMETIC SEQUENCES BUNDLE:☑ Maze - Is it An Arithmetic Sequence?☑ Maze - Explicit Formula o
    $25.25
    $17.68
    Save $7.57
  2. This bundle includes a total of 8 mazes. Each of these mazes is sold separately at my store. Please visit the links below for more details about each individual product. The mazes are:ARITHMETIC SEQUENCES BUNDLE:☑ Maze - Is it An Arithmetic Sequence?☑ Maze - Explicit Formula of Arithmetic Sequenc
    $10.75
    $7.53
    Save $3.22
  • Product Description
  • StandardsNEW

✐ This product is a good review of "Finding the Recursive Formula of an Arithmetic Sequence".

Students are given:

► First four terms

The maze consists of 15 questions. Students would have to complete 12 of the 14 to reach the end.

Students must feel comfortable with:

❖ The Recursive Formula of an Arithmetic Sequence: a1 = a & An = a (sub n-1) + d

❖ How to find the common difference given the first four terms of an arithmetic sequence

❖ How to identify the first term

Please, take a look at the preview before purchasing to make sure that this maze meets your expectations. After seeing the preview, If you would like to modify the maze in any way, please don't hesitate to contact me via Q and A.

✰ ✰ ✰ My students truly were ENGAGED answering this maze much better than the textbook problems. They complete it in class as a bell work.✰ ✰ ✰

This maze could be used as: a way to check for understanding, a review, recap of the lesson, pair-share, cooperative learning, exit ticket, entrance ticket, homework, individual practice, when you have time left at the end of a period, beginning of the period (as a warm up or bell work), before a quiz on the topic, and more.

☺Would love to hear your feedback☺. Please don't forget to come back and rate this product when you have a chance. You will also earn TPT credits. Enjoy and I ☺thank you☺ for visiting my ☺Never Give Up On Math☺ store!!!

© Never Give Up On Math 2019

This product is intended for personal use in one classroom only. For use in multiple classrooms, please purchase additional licenses.

☺ HAVE A WONDERFUL DAY ☺

Log in to see state-specific standards (only available in the US).
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.
Total Pages
7 pages
Answer Key
Included
Teaching Duration
N/A
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.
Loading...
$1.50
Digital Download
Share this resource
Report this resource to TpT
More products from Never Give Up on Math
Product Thumbnail
Product Thumbnail
Product Thumbnail
Product Thumbnail
Product Thumbnail

Teachers Pay Teachers is an online marketplace where teachers buy and sell original educational materials.

Learn More

Keep in Touch!

Sign Up