1 / 8

Lesson 56 -- Finite and Infinite Sets -- Membership in a Set -- Rearranging Before Graphing

Lesson 56 -- Finite and Infinite Sets -- Membership in a Set -- Rearranging Before Graphing. Finite and Infinite Sets. Definitions:. Finite. - Implies the thought of bounded or limited. - can be counted because there is an exact number. Infinite.

minnie
Télécharger la présentation

Lesson 56 -- Finite and Infinite Sets -- Membership in a Set -- Rearranging Before Graphing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Lesson 56--Finite and Infinite Sets--Membership in a Set--Rearranging Before Graphing

  2. Finite and Infinite Sets Definitions: Finite - Implies the thought of bounded or limited - can be counted because there is an exact number Infinite - Implies the thought of unbounded or unlimited - cannot be counted because there is a never ending number of things A set with a finite number of members is called a finite set. A set with a infinite number of members is called a infinite set.

  3. Membership in a Set Example 56.1 Represent the following numbers as being members of set K:

  4. Membership in a Set Example 56.2 Represent the following numbers as being members of set L:

  5. Membership in a Set Example 56.3 Given the sets A = {0, 1, 3, 5}, B = {0, 4, 6, 7}, and C = {1, 2, 3, 5, 7}, are the following statements true or false? True False True

  6. Membership in a Set Example 56.4 Given the sets L = {0, 1, 2, 3}, M = {5, 6, 7}, and N = {0, 1}, are the following statements true or false? False True

  7. Rearranging Before Graphing Example 56.5 Graph: 3x + 2y = 4

  8. Rearranging Before Graphing Example 56.6 Graph: y – x = 0

More Related