|
Activity:
Combinations |
|
| Go to: |
http://education.ti.com/.../Activity.do
(opens a new window)
|
| Description: |
This activity introduces students to combinations. They derive the formula for the number of combinations of n objects taken r at a time by starting with a list of permutations and eliminating those that name the same group, just in a different order. From here they see how the number of combinations is related to the number of permutations. Students then solve several problems involving combinations, including problems that involve geometry. |
| Technology Type: |
TI-Nspire | |
| Author: |
Texas Instruments |
| Language: |
English | |
| Cost: |
Does not require payment for use |
|
| Average Rating: |
 [0]
|
Login to rate this resource
|
| My MathTools: |
Login to Subscribe / Save This
|
| Reviews: |
be the first to review this resource
|
| Discussions: |
start a discussion of this resource
|
|
| Courses: |
Math 7 |
Combinations |
| Geometry |
Polygons |
| Discrete Math |
Counting possibilities, Permutations, R-combinations, Ordered and unordered, Permutations vs. combs., Combinatorial formulas |
|
|