No student devices needed. Know more
9 questions
What word do we use to describe two stages if the number of ways of doing one stage does not depend on how the other stage is done?
independent
inconsistent
invariant
impossible
Compute i=1∏4i .
1
10
24
4096
Suppose a task consists of two independent stages in which there are m ways to do the first stage and n ways to do the second stage. In total, how many ways can the entire task be completed?
m+n
m-n
m/n
mn
DJ has 5 pairs of shoes. How many ways are there for DJ to wear his shoes over a week if he doesn't want to wear the same pair two days in a row?
78125
20480
120
0
DJ's family is from St. Clair county Alabama, where 88,199 people reside. License plates in St. Clair county contain seven characters: the first two are "59" to indicate the county of registration, followed by a certain number of consecutive letters, then completed with consecutive numerals. Assuming there is one car for every two people, how many letters are needed to ensure each car will have a unique license plate?
0
1
2
3
Let A={1,2,3,4} and B={1,2,3,4,5} . How many functions f: A→B exist?
1024
625
120
24
Let A={1,2,3,4} and B={1,2,3,4,5} . How many one-to-one functions f: A→B exist?
1024
625
120
24
Let A={1,2,3,4} and B={1,2,3,4,5} . How many onto functions f: A→B exist?
0
1
24
120
A bijective function is a function that is both one-to-one and onto. Let f: A→B be a bijective function. Which of the following are true?
There is exactly one such function f.
If there are n elements in the domain A, then there are n!=n(n-1)(n-2)...(2)(1) such functions f.
By the vertical line test, a function cannot simultaneously be one-to-one and onto.
There must be the same number of elements in A as in B.
Explore all questions with a free account