Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
6. (a) Fix n, m € Z4. For each i e N,, define A; = {f : Nm → N„|i ¢ im(f)}. Prove (by constructing a bijection) that for any I C N, with |I| = k < n,

6. (a) Fix n, m € Z4. For each i e N,, define A; = {f : Nm → N„|i ¢ im(f)}. Prove (by constructing a bijection) that for any I C N, with |I| = k < n,

Advanced Engineering Mathematics
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
See similar textbooks
icon
Related questions
Question
Q6
1. Let X be a set, and suppose that f: Z, → X is an injection. Prove that X is infinite. 2. Suppose that AC {1,2,..., 12} with |A| > 5. Show that there exist a, b, c, d e A such that (a, b) + (c, d) and a +b = c + d. 3. Suppose that A C {1,2,..., 100} with |A| > 10. Show that there exist nonempty subsets B, C C A such that B,C are disjoint and the sum of the elements of B is equal to the sum of the elements of C. 4. Fix n, k E Z, with k < n, and let A1 Determine (with proof) the cardinality of the set {1,2, ..., k}, A2 {k + 1, k + 2, ..., n}. {f : N, N„|f(A)) C A1, ƒ (A2) C (A2)}. 5. (optional) Use induction to prove the following generalized version of the inclusion- exclusion principle: If n E Z4 and A1,..., An are finite sets, then E(-1)"I-1 i=1 07ICN, where Eo4ICN, means to take a sum as I ranges over all nonempty subsets of N,, and for I = {i1,..., im} C {1,...,n}, N A; is defined to be iɛl NA: = A;, N A, n..n m. ieI Hint: at some point you will need to use the fact that 'n-1 n-1 U A.)n A, = U(A;N A.). i=1 i=1 6. (a) Fix n, m e Z4. For each i e N,, define A; = {f : Nm → N„|i ¢ im(f)}. Prove (by constructing a bijection) that for any I C N,, with |I| = k < n, (n – k)". iel (b) Use problem 5 and part (a) to prove that for n, m e Z4, the number of surjections from Nm to N,, is given by (п — 1)" + n-1 (n – 2)m – ...+ (-1)" n – 1
Transcribed Image Text:1. Let X be a set, and suppose that f: Z, → X is an injection. Prove that X is infinite. 2. Suppose that AC {1,2,..., 12} with |A| > 5. Show that there exist a, b, c, d e A such that (a, b) + (c, d) and a +b = c + d. 3. Suppose that A C {1,2,..., 100} with |A| > 10. Show that there exist nonempty subsets B, C C A such that B,C are disjoint and the sum of the elements of B is equal to the sum of the elements of C. 4. Fix n, k E Z, with k < n, and let A1 Determine (with proof) the cardinality of the set {1,2, ..., k}, A2 {k + 1, k + 2, ..., n}. {f : N, N„|f(A)) C A1, ƒ (A2) C (A2)}. 5. (optional) Use induction to prove the following generalized version of the inclusion- exclusion principle: If n E Z4 and A1,..., An are finite sets, then E(-1)"I-1 i=1 07ICN, where Eo4ICN, means to take a sum as I ranges over all nonempty subsets of N,, and for I = {i1,..., im} C {1,...,n}, N A; is defined to be iɛl NA: = A;, N A, n..n m. ieI Hint: at some point you will need to use the fact that 'n-1 n-1 U A.)n A, = U(A;N A.). i=1 i=1 6. (a) Fix n, m e Z4. For each i e N,, define A; = {f : Nm → N„|i ¢ im(f)}. Prove (by constructing a bijection) that for any I C N,, with |I| = k < n, (n – k)". iel (b) Use problem 5 and part (a) to prove that for n, m e Z4, the number of surjections from Nm to N,, is given by (п — 1)" + n-1 (n – 2)m – ...+ (-1)" n – 1
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 49 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,
SEE MORE TEXTBOOKS