Let X = {1, 2, 3, 4} and Y = {a, b, c, d, e}. Define g: X | StudySoup
Discrete Mathematics with Applications | 4th Edition | ISBN: 9780495391326 | Authors: Susanna S. Epp

Table of Contents

1.1
Variables
1.1
Variables
1.2
The Language of Sets
1.2
The Language of Sets
1.3
The Language of Relations and Functions
1.3
The Language of Relations and Functions

2.1
Logical Form and Logical Equivalence
2.1
Logical Form and Logical Equivalence
2.2
Conditional Statements
2.2
Conditional Statements
2.3
Valid and Invalid Arguments
2.3
Valid and Invalid Arguments
2.4
Application: Digital Logic Circuits
2.4
Application: Digital Logic Circuits
2.5
Application: Number Systems and Circuits for Addition
2.5
Application: Number Systems and Circuits for Addition

3.1
Predicates and Quantified Statements I
3.2
Predicates and Quantified Statements II
3.2
Predicates and Quantified Statements II
3.3
Statements with Multiple Quantifiers
3.3
Statements with Multiple Quantifiers
3.4
Arguments with Quantified Statements
3.4
Arguments with Quantified Statements

4.1
Direct Proof and Counterexample I: Introduction
4.1
Direct Proof and Counterexample I: Introduction
4.2
Direct Proof and Counterexample II: Rational Numbers
4.2
Direct Proof and Counterexample II: Rational Numbers
4.3
Direct Proof and Counterexample III: Divisibility
4.3
Direct Proof and Counterexample III: Divisibility
4.4
Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem
4.4
Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem
4.5
Direct Proof and Counterexample V: Floor and Ceiling
4.5
Direct Proof and Counterexample V: Floor and Ceiling
4.6
Indirect Argument: Contradiction and Contraposition
4.6
Indirect Argument: Contradiction and Contraposition
4.7
Indirect Argument: Two Classical Theorems
4.7
Indirect Argument: Two Classical Theorems
4.8
Application: Algorithms
4.8
Application: Algorithms

5.1
Sequences
5.1
Sequences
5.2
Mathematical Induction I
5.2
Mathematical Induction I
5.3
Mathematical Induction II
5.3
Mathematical Induction II
5.4
Strong Mathematical Induction and the Well-Ordering Principle for the Integers
5.4
Strong Mathematical Induction and the Well-Ordering Principle for the Integers
5.5
Application: Correctness of Algorithms
5.5
Application: Correctness of Algorithms
5.6
Defining Sequences Recursively
5.6
Defining Sequences Recursively
5.7
Solving Recurrence Relations by Iteration
5.7
Solving Recurrence Relations by Iteration
5.8
Second-Order Linear Homogenous Recurrence Relations with Constant Coefficients
5.8
Second-Order Linear Homogenous Recurrence Relations with Constant Coefficients
5.9
General Recursive Definitions and Structural Induction
5.9
General Recursive Definitions and Structural Induction

6.1
Set Theory: Definitions and the Element Method of Proof
6.1
Set Theory: Definitions and the Element Method of Proof
6.2
Properties of Sets
6.2
Properties of Sets
6.3
Disproofs, Algebraic Proofs, and Boolean Algebras
6.3
Disproofs, Algebraic Proofs, and Boolean Algebras
6.4
Boolean Algebras, Russell’s Paradox, and the Halting Problem
6.4
Boolean Algebras, Russell’s Paradox, and the Halting Problem

7.1
Functions Defined on General Sets
7.1
Functions Defined on General Sets
7.2
One-to-One and Onto, Inverse Functions
7.2
One-to-One and Onto, Inverse Functions
7.3
Composition of Functions
7.3
Composition of Functions
7.4
Cardinality with Applications to Computability
7.4
Cardinality with Applications to Computability

8.1
Relations on Sets
8.1
Relations on Sets
8.2
Reflexivity, Symmetry, and Transitivity
8.2
Reflexivity, Symmetry, and Transitivity
8.3
Equivalence Relations
8.3
Equivalence Relations
8.4
Modular Arithmetic with Applications to Cryptography
8.4
Modular Arithmetic with Applications to Cryptography
8.5
Partial Order Relations
8.5
Partial Order Relations

9.1
Introduction
9.1
Introduction
9.2
Possibility Trees and the Multiplication Rule
9.2
Possibility Trees and the Multiplication Rule
9.3
Counting Elements of Disjoint Sets: The Addition Rule
9.3
Counting Elements of Disjoint Sets: The Addition Rule
9.4
The Pigeonhole Principle
9.4
The Pigeonhole Principle
9.5
Counting Subsets of a Set: Combinations
9.5
Counting Subsets of a Set: Combinations
9.6
r-Combinations with Repetition Allowed
9.6
r-Combinations with Repetition Allowed
9.7
Pascal’s Formula and the Binomial Theorem
9.7
Pascal’s Formula and the Binomial Theorem
9.8
Probability Axioms and Expected Value
9.8
Probability Axioms and Expected Value
9.9
Conditional Probability, Bayes’ Formula, and Independent Events
9.9
Conditional Probability, Bayes’ Formula, and Independent Events

10.1
Graphs: Definitions and Basic Properties
10.1
Graphs: Definitions and Basic Properties
10.2
Trails, Paths, and Circuits
10.2
Trails, Paths, and Circuits
10.3
Matrix Representations of Graphs
10.3
Matrix Representations of Graphs
10.4
Isomorphisms of Graphs
10.4
Isomorphisms of Graphs
10.5
Trees
10.5
Trees
10.6
Rooted Trees
10.6
Rooted Trees
10.7
Spanning Trees and Shortest Paths
10.7
Spanning Trees and Shortest Paths

11.1
Real-Valued Functions of a Real Variable and Their Graphs
11.1
Real-Valued Functions of a Real Variable and Their Graphs
11.2
Notations
11.2
Notations
11.3
Application: Analysis of Algorithm Efficiency I
11.3
Application: Analysis of Algorithm Efficiency I
11.4
Exponential and Logarithmic Functions: Graphs and Orders
11.4
Exponential and Logarithmic Functions: Graphs and Orders
11.5
Application: Analysis of Algorithm Efficiency II
11.5
Application: Analysis of Algorithm Efficiency II

12.1
Formal Languages and Regular Expressions
12.1
Formal Languages and Regular Expressions
12.2
Finite-State Automata
12.2
Finite-State Automata
12.3
Simplifying Finite-State Automata
12.3
Simplifying Finite-State Automata

Textbook Solutions for Discrete Mathematics with Applications

Chapter 7.1 Problem 39E

Question

Problem 39E

Let X = {1, 2, 3, 4} and Y = {a, b, c, d, e}. Define g: X →Y as follows: g(1) = a, g(2) = a, g(3) = a, and g(4) = d.

a. Draw an arrow diagram for g.

b. Let A = {2, 3}, C = {a}, and D = {b, c}. Find g(A), g(X), g-1(C), g-1(D), and g−1(Y).

Solution

Step 1 of 6)

The first step in solving 7.1 problem number 39 trying to solve the problem we have to refer to the textbook question: Problem 39ELet X = {1, 2, 3, 4} and Y = {a, b, c, d, e}. Define g: X →Y as follows: g(1) = a, g(2) = a, g(3) = a, and g(4) = d.a. Draw an arrow diagram for g.b. Let A = {2, 3}, C = {a}, and D = {b, c}. Find g(A), g(X), g-1(C), g-1(D), and g−1(Y).
From the textbook chapter Functions Defined on General Sets you will find a few key concepts needed to solve this.

Step 2 of 7)

Visible to paid subscribers only

Step 3 of 7)

Visible to paid subscribers only

Subscribe to view the
full solution

Title Discrete Mathematics with Applications  4 
Author Susanna S. Epp
ISBN 9780495391326

Let X = {1, 2, 3, 4} and Y = {a, b, c, d, e}. Define g: X

Chapter 7.1 textbook questions

×

Login

Organize all study tools for free

Or continue with
×

Register

Sign up for access to all content on our site!

Or continue with

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back