Scribd
Upload
22 views4 pages

Review final-FA2024

Uploaded by

kkoutsothodoros
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views4 pages

Review final-FA2024

Uploaded by

kkoutsothodoros
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

MA 130 – Review Final Exam

1. Let A = {1, 2}, B = {a, b, c, d}, and C = {1, a, b}. Use the roster method to list all of
the elements of each of the following sets:

(a) A × B (d) A2 (g) A × ∅


(b) B × A (e) A × (B ∩ C) (h) B × {2}
(c) A × C (f) (A × B) ∩ (A × C) (i) P(C)

2. The Venn diagram of 4 sets can be represented as follows

Let A, B, C, and D be four sets. Find the Venn diagrams for


(a) (A − B) ∪ (C − D)
(b) (A ∪ B) ∩ (∼ C) ∩ D

3. State the domain and range of the function f : Z6 → Z6 defined by

f (x) = (2x2 + 2) mod 6.

4. Let d be the function that associates with each natural number the number of its natural
number divisors. That is, d : N → N where d(n) is the number of natural number divisors
of n. For example, d(6) = 4, since 1, 2, 3, and 6 are the natural number divisors of 6.
(a) Calculate d(k) for each natural number k from 1 through 6.
(b) Does there exist a natural number n such that d(n) = 1? What is the set of
preimages of the natural number 1?
(c) Does there exist a natural number n such that d(n) = 2? If so, determine the set of
all preimages of the natural number 2.
(d) Is the following statement true or false? Justify your conclusion.
For all m, n ∈ N, if m ̸= n, then d(m) ̸= d(n).
(e) Calculate d(2k ) for k = 0 and for each natural number k from 1 through 6.
(f) Base on your work in Part (e), make a conjecture for a formula for d(2n ) where n is
a nonnegative integer. Then explain why your conjecture is correct.
(g) Is the following statement true or false?
For each n ∈ N, there exists a natural number m such that d(m) = n.
(h) Is the function d(n) injective?
(i) Is the function d(n) surjective?
3
5. Consider f : R → (0, ∞) defined by f (x) = ex
(a) Is f one-to-one? Justify your answer.
(b) Is f onto? Justify your answer.
(c) Is f invertible? If so, find its inverse.
6. Let p, q, and r be statements. Construct the truth table of the logical expression

¬p → ¬(q ∨ r)

7. Let p, q be two statements. Show that


(a) ¬(p ∨ (¬p ∧ q)) ≡ ¬p ∧ ¬q
(b) ((p → q) → q) → q ≡ p → q
8. Let x and y be two integers. Show that if x + y is even then x2 + y 2 is even.
9. Prove the following statement
Let m, a, b, c, and d be integers with m ̸= 0. If m|(a − b) and m|(c − d), then
m|(ac − bd).

10. Show, using a proof by cases, that


If n ∈ N, then 1 + (−1)n (2n − 1) is a multiple of 4.

11. Show, using a proof by the contrapositive, that if the product of two positive real numbers
is greater than 100, then at least one of the numbers is greater than 10.
12. Show, using a proof by contradiction, that for any integer n, n2 − 2 is not divisible by 4.
13. Consider the sequence a1 , a2 , a3 , . . . defined by

a1 = 1 an+1 = 5an + 1 for all n ≥ 1.


5n − 1
Show that an = for all integer n ≥ 1.
4

Page 2
14. Show, using the Principle of Mathematical Induction, that for any natural number n,
n(n + 1)(2n + 1)
12 + 22 + 32 + · · · + n2 = .
6

15. Consider the sequence defined by


a1 = 1, a2 = 8, an = an−1 + 2an−2 , for n ≥ 3.
Show using strong induction that an = 3 · 2n−1 + 2(−1)n .
16. Use the Pigeonhole Principle to show that whenever five points are placed inside an
equilateral triangle with sides of length 1, there must be at least two points within 12 of
each other.
17. How many arrangements are there of the letters in the word GAMES?
18. If we did a national survey asking people for their favorite two days of the week, how
many different responses could we possibly get?
19. A certain mid-Atlantic state has a simple rule for its license plates: Use three letters
followed by four digits.
(a) How many possible plates are there?
(b) Suppose the state court has ruled that 97 of the possible three-letter combinations
are offensive and cannot be used. Now how many possible plates are there?
20. An organization has 8 math majors, 12 computer science majors, and 6 science majors.
In how many ways can the organization elect a president, vise president, and secretary
for each situation described?
(a) The three officers are all the same major.
(b) At least one of the officers must be a science major.
(c) Either the president or the vice president must be a math major.
21. On a TV game show, nine scarves numbered 1 to 9 are placed in a basket and thoroughly
mixed. Then they are drawn out one at a time.
(a) How many possible results are there?
(b) Of these, how many have all five odd numbers first, followed by four even numbers?
22. On a TV show, there are eight contestants. One of them (call her Jill) has won a prize
dinner, and is allowed to select three of the others to join her. How many ways are there
for her to make her selection?
23. A committee of size 6 is being formed from a group of 10 Republicans, 8 Democrats, and
4 Independents.
(a) How many different committees are possible?
(b) Of these, how many have exactly two of each political persuasion?
24. Use the Euclidean algorithm to find

Page 3
(a) gcd(1001, 1331) (b) gcd(1000, 5040)

25. Express gcd(252, 198) = 18 as as linear combination of 252 and 198.

26. Find the multiplicative inverse in Z10 , if it exists.

(a) 3 (b) 5

Page 4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy