Question

Discrete mathematics function relation problem Let P ∗ (N) be the set of all nonempty subsets...

Discrete mathematics function relation problem

Let P ∗ (N) be the set of all nonempty subsets of N. Define m : P ∗ (N) → N by m(A) = the smallest member of A. So for example, m {3, 5, 10} = 3 and m {n | n is prime } = 2.

(a) Prove that m is not one-to-one.

(b) Prove that m is onto.

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Let S be a finite set and let P(S) denote the set of all subsets of...
Let S be a finite set and let P(S) denote the set of all subsets of S. Define a relation on P(S) by declaring that two subsets A and B are related if A and B have the same number of elements. (a) Prove that this is an equivalence relation. b) Determine the equivalence classes. c) Determine the number of elements in each equivalence class.
6. Let S be a finite set and let P(S) denote the set of all subsets...
6. Let S be a finite set and let P(S) denote the set of all subsets of S. Define a relation on P(S) by declaring that two subsets A and B are related if A ⊆ B. (a) Is this relation reflexive? Explain your reasoning. (b) Is this relation symmetric? Explain your reasoning. (c) Is this relation transitive? Explain your reasoning.
For a set A, let P(A) be the set of all subsets of A. Prove that...
For a set A, let P(A) be the set of all subsets of A. Prove that A is not equivalent to P(A)
Problem 1. Let {En}n∞=1 be a sequence of nonempty (Lebesgue) measurable subsets of [0, 1] satisfying...
Problem 1. Let {En}n∞=1 be a sequence of nonempty (Lebesgue) measurable subsets of [0, 1] satisfying limn→∞m(En) = 1. Show that for each ε ∈ [0, 1) there exists a subsequence {Enk }k∞=1 of {En}n∞=1 such that m(∩k∞=1Enk) ≥ ε
Let f be a function from the set of students in a discrete mathematics class to...
Let f be a function from the set of students in a discrete mathematics class to the set of all possible final grades. (a) Under what conditions is f an injection? (b) Under what conditions is f a surjection? (please show all work)
I have a discrete math question. let R be a relation on the set of all...
I have a discrete math question. let R be a relation on the set of all real numbers given by cry if and only if x-y = 2piK for some integer K. prove that R is an equivalence relation.
Let p and q be any two distinct prime numbers and define the relation a R...
Let p and q be any two distinct prime numbers and define the relation a R b on integers a,b by: a R b iff b-a is divisible by both p and q. For this relation R: Prove that R is an equivalence relation. you may use the following lemma: If p is prime and p|mn, then p|m or p|n
Using Discrete Math Let ρ be the relation on the set of natural numbers N given...
Using Discrete Math Let ρ be the relation on the set of natural numbers N given by: for all x, y ∈ N, xρy if and only if x + y is even. Show that ρ is an equivalence relation and determine the equivalence classes.
Let p and q be any two distinct prime numbers and define the relation a R...
Let p and q be any two distinct prime numbers and define the relation a R b on integers a,b by: a R b iff b-a is divisible by both p and q. I need to prove that: a) R is an equivalence relation. (which I have) b) The equivalence classes of R correspond to the elements of  ℤpq. That is: [a] = [b] as equivalence classes of R if and only if [a] = [b] as elements of ℤpq I...
Discrete Mathematics (a) Let P(x) be the predicate “−10 < x < 10” with domain Z+...
Discrete Mathematics (a) Let P(x) be the predicate “−10 < x < 10” with domain Z+ (the set of all positive integers). Find the truth set of P(x). (b) Rewrite the statement Everybody trusts somebody in formal language using the quantifiers ∀ and ∃, the variables x and y, and a predicate P(x,y) that you must define. (c) Write the negation of the statement in (b) both formally and informally.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT