Download presentation
Presentation is loading. Please wait.
1
A#3 / 0-5/0-6 Homework Worksheet
Homework Corrections A#3 / 0-5/0-6 Homework Worksheet 5. 35
2
Warm Up ÷ 3 ÷ 6 ÷ 9 ÷ 2 ÷ 8
3
Addition Slap Facts
4
Objectives Lesson Objectives: I will be able to …
Page 17 Lesson Objectives: I will be able to … Identify numbers as prime or composite Language Objectives: I will be able to … Read, write, and listen about vocabulary, key concepts, and examples Discuss how to create rectangles with a given area
5
0-7: Prime and Composite Numbers
A composite number has more than two factors. Example: 12 is a composite number. Factors of 12: 1, 2, 3, 4, 6, 12 A prime number has only two factors. Example: 29 is a prime number. Factors of 29: 1, 29 The number 1 is neither composite nor prime because it only has one factor. Factor of 1: 1 Page 17
6
0-7: Prime and Composite Numbers
Factoring with Rectangles Make a group of 2 – 4. Send one person up to get 20 tiles. Sieve of Eratosthenes Each student will need his/her own set of markers or colored pencils
7
0-7: Prime and Composite Numbers
Page 17
8
0-7: Prime and Composite Numbers
Example 1: Determine whether 516 is divisible by 2, 3, 4, 5, 6, 9, and 10. Page 18
9
0-7: Prime and Composite Numbers
Your Turn 1: Determine whether 740 is divisible by 2, 3, 4, 5, 6, 9, 10 Page 18
10
0-7: Prime and Composite Numbers
Example 2: Determine whether each number is prime or composite. A. 17 B. 27 C. 57 Page 19
11
0-7: Prime and Composite Numbers
Your Turn 2: Determine whether each number is prime or composite. A. 132 B. 11 Page 19
12
Cornell Notes Fill in the Essential Question:
“How can I find the factors of a number and determine whether the number is prime or composite?” Write two or three main ideas from this lesson in the Notes section. Write a Question for each main idea. (The answer to the question should be the main idea.) Summarize the answers to your questions in the Summary section. Page 20
13
Homework Assignment #4 0-7 Homework Worksheet
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.