U3 Permutations and Organized Counting Flashcards

1
Q

combinatorics

A

branch of math that deals with ideas and methods for counting

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Multiplicative Counting Principle

A
  • if a task has stages of separate choices where the first stage has m choices, the second stage has m choices, the third stage has p choices
  • the total number of choices is m x n x p
  • “and” “then”
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

additive counting principle

A
  • if one mutually exclusive action can occur in m ways, another in n ways, and another in p ways
  • total number of ways these events can occur is m+n+p
  • “or”
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

what does factorial indicates

A

the multiplication of consecutive decreasing natural numbers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

counting and probability problems usually involves…

A

the product of consecutive natural integers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

general factorial rules

A
  1. n(n - 1)! = n!
  2. n! / (n - 1)! = n
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

falling factorials are

A

partial factorials which terminate early

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Pascal’s Triangle

A

array of numbers shown in a triangular patternq

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

who made pascal triangle

A
  • Blaise Pascal (1600s)
  • French mathematician at 13
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

the first and last terms in each row of pascal’s triangle are always

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly