All Finite Mathematics Resources
Example Questions
Example Question #11 : Logic, Sets, And Counting
Consider the sentence:
"In ten years, the Prime Minister of the United Kingdom will be a woman."
True or false: This sentence is an example of a logical statement.
True
False
True
A logical statement is a sentence which is either true or false. "In ten years, the Prime Minister of the United Kingdom will be a woman" is a prediction. While its truth value will not be established for a while, it is either true or false, and it is therefore a logical statement.
Example Question #11 : Logic, Sets, And Counting
Define to be the set of people who are at least 200 years old.
True or false: is an example of a well-defined set.
True
False
True
A set is well-defined if it can be determined without ambiguity what elements are - and are not - in the set. Since every person either has lived at least two hundred years or has not lived at least two hundred years, this set meets the criterion for being well-defined.
Note that this set is (probably) the empty set, since no one alive is older than 200; the condition holds nonetheless.
Example Question #12 : Logic, Sets, And Counting
Consider the conditional
"If , then 13 is a prime number."
By the laws of logic, is this statement true, false, or neither?
True
Neither
False
True
This is an example of a conditional statement with a true antecedent and a true consequent, since and 13 is a prime number. Even though the consequent does not result from the antecedent, the truth value of such a conditional is still "true".
Example Question #13 : Logic, Sets, And Counting
Select the set that has exactly 1,000 subsets.
No set can have exactly 1,000 subsets.
No set can have exactly 1,000 subsets.
The number of subsets of a set with elements is . It follows that the number of sets of any subset must be exactly a power of 2. 1,000 is not a power of 2, so there cannot be a set with exactly that many subsets.
Example Question #14 : Logic, Sets, And Counting
Select the set that has exactly 1,024 subsets.
No set can have exactly 1,024 subsets.
The number of subsets of a set with elements is . It follows that the number of sets of any subset must be exactly a power of 2. Since
,
a set with 1,024 subsets can exist, and such a set would have ten elements. Of the given choices, the set
is such a set.
Example Question #14 : Logic, Sets, And Counting
Consider the statement
"Andy is a Freemason if and only if neither Benny nor Charlie is a Freemason."
Benny is a Freemason. What do we know about whether Andy and Charlie are Freemasons?
Andy is not a Freemason; no conclusion can be drawn about Charlie.
Andy is a Freemason; no conclusion can be drawn about Charlie.
No conclusions can be drawn about either Andy or Charlie.
Charlie is not a Freemason; no conclusion can be drawn about Andy.
Charlie is a Freemason; no conclusion can be drawn about Andy.
Andy is not a Freemason; no conclusion can be drawn about Charlie.
The statement
"Andy is a Freemason if and only if neither Benny nor Charlie is a Freemason."
is a biconditional statement. It can be rewritten by negating both parts of the statement as
"It is not true that Andy is a Freemason if and only if it is not true that neither Benny nor Charlie is a Freemason."
or, simplifying it a little,
"Andy is not a Freemason if and only if either Benny or Charlie is a Freemason."
Benny is a Freemason, making the second part of the latter biconditional statement true whether or not Charlie is a Freemason. It follows that Andy is not a Freemason. However, whether Charlie is a Freemason or not, his status is consistent with the biconditional.
We therefore know that Andy is not a Freemason, but we do not know whether or not Charlie is a Freemason.
Example Question #15 : Logic, Sets, And Counting
Define to be the set of all of the Presidents of the United States.
True or false: is an example of a well-defined set.
False
True
True
A set is well-defined if it can be determined with no ambiguity which elements are and are not in the set. In the case of , since, given any person in history, that person is/was or is/was not the President of the United States, is a well-defined set.
Example Question #57 : Finite Mathematics
The state of X has passed a law stating that all license plate numbers must adhere to the following rules:
1) A prefix of one or two letters must precede a string of five digits.
2) "X" can only appear in the prefix if it is the second letter of a two-letter group.
3) Repetition is allowed.
How many license plate numbers are possible under these rules?
The selection of a license plate number can be seen as a series of independent events, as follows:
First, a prefix of one or two letters must be chosen. One way to look at this is that the prefix can be any one of 25 letters ("X" is excluded) followed by either any of 26 letters or a blank. By the multiplication principle, there are
possible prefixes.
The remaining characters must comprise five numeral; since there are no restrictions on the digits, by the multiplication principle, the number of possible numeral strings is
Applying the multiplication principle one more time, there will be
Example Question #58 : Finite Mathematics
The state of X has passed a law stating that all license plate numbers must adhere to the following rules:
1) A license plate number must have exactly six characters - four numerals and two letters.
2) The letters "I" and "O" are not allowed.
3) The two letters may appear anywhere in the license number.
4) Repetition is allowed.
How many license plate numbers are possible under these rules?
The selection of a license plate number can be seen as a series of independent events, as follows:
First, the positions of the two letters is chosen. Since this is a choice of two positions out of six, without regard to order - the number of combinations of two from a set of six - the number of ways to choose these positions is .
Next, the two letters are chosen. Repetition is allowed, and there are 24 letters from which to choose, so, by the multiplication principle, there are ways to choose the letters.
Next, the four numerals are chosen. Repetition is allowed, and there are 10 digits from which to choose, so, by the multiplication principle, there are ways to choose the digits.
Applying the multiplication principle one more time, this gives us
different license plate numbers.
Example Question #59 : Finite Mathematics
Consider the statements:
:
:
True or false: is the negation of .
False
True
False
The negation of a statement can be stated as "It is not true that ." Therefore, the negation of the statement "" is the statement "It is not true that ." This can be restated as - not . Therefore, is not the negation of .
Certified Tutor