Search & Filtering
How many strings can be formed in the length of 5 strings from the word DISCRETE?
Let the function f : R → R and g : R → R be defined by f(x) 2x + 3 and g(x) = -3x + 5.
a. Show that f is one-to-one and onto.
b. Show that g is one-to-one and onto.
c. Determine the composition function g o f
d. Determine the inverse functions f -1 and g -1 .
e. Determine the inverse function (g o f) -1 of g o f and the composite f -1 o g -1
Show that (~𝒑∨𝒒)∧(𝒑∧~𝒒) is a contradiction
2. How many 4 letter words can be created, if repetitions are allowed?
3. How many three digit numbers can be formed?
4. How many words (of any number of letters) can be formed from GAME?
5. How many 3-digit, 4-digit, or 5-digit numbers can be made using the digits of 46723819?
6. How many numbers between 999 and 9999 are divisible by 5 and have no repeated digits?
7. How many ways can you order the letters in KEYBOARD if K and Y must always be kept together?
8. How many ways can 4 rock, 5 pop, and 6 classical albums be ordered if all albums of the same genre must be kept together?
9. In how many ways can the letters from the word EDITOR be arranged if vowels and consonants alternate positions?
10. If 8 boys and 2 girls must stand in line for a picture, how many line-up’s will have the
2. How many 4 letter words can be created, if repetitions are allowed?
3. How many three digit numbers can be formed?
4. How many words (of any number of letters) can be formed from GAME?
5. How many 3-digit, 4-digit, or 5-digit numbers can be made using the digits of 46723819?
6. How many numbers between 999 and 9999 are divisible by 5 and have no repeated digits?
7. How many ways can you order the letters in KEYBOARD if K and Y must always be kept together?
8. How many ways can 4 rock, 5 pop, and 6 classical albums be ordered if all albums of the same genre must be kept together?
9. In how many ways can the letters from the word EDITOR be arranged if vowels and consonants alternate positions?
10. If 8 boys and 2 girls must stand in line for a picture, how many line-up’s will have the
2. How many 4 letter words can be created, if repetitions are allowed?
3. How many three digit numbers can be formed?
4. How many words (of any number of letters) can be formed from GAME?
5. How many 3-digit, 4-digit, or 5-digit numbers can be made using the digits of 46723819?
6. How many numbers between 999 and 9999 are divisible by 5 and have no repeated digits?
7. How many ways can you order the letters in KEYBOARD if K and Y must always be kept together?
8. How many ways can 4 rock, 5 pop, and 6 classical albums be ordered if all albums of the same genre must be kept together?
9. In how many ways can the letters from the word EDITOR be arranged if vowels and consonants alternate positions?
10. If 8 boys and 2 girls must stand in line for a picture, how many line-up’s will have the girls separated from each other?
Express the negation of each of these statements in terms
of quantifiers without using the negation symbol.
a) ∀x(x > 1)
b) ∀x(x ≤ 2)
c) ∃x(x ≥ 4)
d) ∃x(x < 0)
e) ∀x((x < −1) ∨ (x > 2))
f ) ∃x((x < 4) ∨ (x > 7))
Show that (~𝒑∨𝒒)∧(𝒑∧~𝒒) is a contradiction.
Construct a graph G with 6 vertices {v1, v2, v3, v4, v5, v6} and six edges {e1, e2, e3, e4, e5,
e6} such that
i. e2 is a loop at v2
ii. v2 and v5 are end point of e5
iii. v3 is adjacent to v2
iv. v4 is isolated
v. e3 is parallel to e5
vi. e4 is incident of v1 and v6
Determine whether each of these functions from Z to Z is one-to-one.
a. f(n) = n2
+ 1
b. f(n) = n
