edited by
153 views
0 votes
0 votes

Let $X$ be the set $\{1, 2, 3, 4, 5\}$ and $Y$ be the set $\{6, 7, 8, 9, 10\}$. We describe the functions $f : X\rightarrow Y$ and $g : X\rightarrow Y$ in the following tables. Answer each part and give a reason for each negative answer.

 

$n$ $f(n)$
1 6
2 7
3 6
4 7
5 6

 

$n$ $g(n)$
1 10
2 9
3 8
4 7
5 6

 

  1. Is $f$ one-to-one?
  2. Is $f$ onto?
  3. Is $f$ a correspondence?
  4. Is $g$ one-to-one?
  5. Is $g$ onto?
  6. Is $g$ a correspondence?
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
admin asked Oct 17, 2019
173 views
Let $INFINITE_{PDA} = \{\langle{ M \rangle} \mid \text{M is a PDA and L(M) is an infinite language}\}$. Show that $INFINITE_{PDA}$ is decidable.
0 votes
0 votes
0 answers
2
admin asked Oct 17, 2019
187 views
Let $INFINITE_{DFA} = \{\langle{ A \rangle} \mid \text{ A is a DFA and L(A) is an infinite language}\}$. Show that $INFINITE_{DFA}$ is decidable.
0 votes
0 votes
0 answers
3
admin asked Oct 17, 2019
421 views
Review the way that we define sets to be the same size in Definition $4.12$ (page $203$). Show that “is the same size” is an equivalence relation.
0 votes
0 votes
0 answers
4