The Gateway to Computer Science Excellence
0 votes
4 views

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?
in Theory of Computation by Veteran (54.9k points)
edited by | 4 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,644 questions
56,505 answers
195,555 comments
101,042 users