The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Bijective function
0
votes
60
views
Let R be set of all real numbers, and
A = B = R*R
A function A> B is defined by
f(a,b) = (a+b,ab)
How to prove it is a bijective function?
discretemathematics
functions
asked
Nov 9, 2018
in
Set Theory & Algebra
by
dan31
Junior
(
829
points)

60
views
answer
comment
0
You have to prove that sum and difference of 2 real numbers are always unique.
0
To prove a function is bijective, prove that it is oneone and onto i.e for every value of (a,b) there exists a unique value of f(a,b) and that for every value (x,y) present in the codomain, there exists a value (a,b) such that f(a,b) = (x,y).
Your identity must be verified before you can post a comment. Please wait if already uploaded identity proof or upload your proof
here
Please
log in
or
register
to answer this question.
1
Answer
0
votes
Let's there is a value $(x, y)$ in codomain of $RXR$. From there we can get $a=(x+y)/2$ & $b=(xy) /2$ and $a, b \epsilon R$. Thus proves Range = Co domain... This also proves for every $(x, y)$, there is unique pair or $(a, b) $. Thus proves function is bijective.
answered
Nov 9, 2018
by
2019_Aspirant
Active
(
1.8k
points)
comment
Your identity must be verified before you can post a comment. Please wait if already uploaded identity proof or upload your proof
here
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+2
votes
0
answers
1
Function f and g
Let $f(x)$ mean that function $f$ ,applied to $x$,and $f^{n}(x)$ mean $f(f(........f(x)))$,that is $f$ applied to $x$ ,$n$ times.Let $g(x) = x+1$ and $h_{n}(x)=g^{n}(x).$Then what is $h_{9}^{8}(72)?$
asked
Oct 7, 2018
in
Set Theory & Algebra
by
Lakshman Patel RJIT
Boss
(
41.5k
points)

52
views
discretemathematics
settheory&algebra
functions
+2
votes
1
answer
2
Function
asked
Jan 29, 2018
in
Set Theory & Algebra
by
srestha
Veteran
(
112k
points)

62
views
functions
discretemathematics
+2
votes
1
answer
3
Inverse of a function
Consider a function f from A to B such that f : A → B is bijective. f–1 represents inverse of f. Than could we say that f1 :B>A is also bijective..Please give proper reasoning thanks
asked
Oct 7, 2017
in
Set Theory & Algebra
by
Shivi rao
Junior
(
523
points)

131
views
discretemathematics
functions
0
votes
1
answer
4
Function Composition
For gof to be onetoone, f must be onetoone but reverse is not true. Is the above statement correct? According to me both f and g must be onetoone for gof to be onetoone. I took below examples: (i) f is onetoone and g is onto Let A = {1 ... . Here, g(f(1)) and g(f(2)) both gives α which implies that gof is onetoone. Are above examples correct? If yes, please explain.
asked
Sep 18, 2017
in
Set Theory & Algebra
by
aishwarydewangan
(
311
points)

416
views
discretemathematics
functions
0
votes
1
answer
5
composition of function
Let f : A → B and g : B → C denote two functions. Consider the following two statements: S1 : If both f and g are injections then the composition function gof: A → C is an injection. S2 : If the function gof: A → C is surjection and g is an ... a)) and h(a) is onto then g must be onto, where ∀a, a ∈ A. Which of the above statements are valid? please give explanation
asked
Jan 20, 2017
in
Set Theory & Algebra
by
Pankaj Joshi
Active
(
2.6k
points)

214
views
discretemathematics
functions
0
votes
1
answer
6
Function
The function defined for positive integers by $F(1)=1,F(2)=1,F(3)=1$ and by identities F(2k)=F(k),F(2k+1)=F(k) for $ k>=2.$The sum $F(1)+F(2)+F(3)+...+F(100)$ is________
asked
Oct 24, 2018
in
Combinatory
by
Lakshman Patel RJIT
Boss
(
41.5k
points)

100
views
discretemathematics
functions
0
votes
0
answers
7
Injective Function
The number of ways possible to form injective function from set A set B where A = 3 and B = 5 such that pth element of set A cannot match with pthelement of set B are _________.
asked
Aug 28, 2018
in
Combinatory
by
srestha
Veteran
(
112k
points)

37
views
discretemathematics
functions
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
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
Recent Posts
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
My journey from Wipro to an IISc student  GATE 2019
Interview Experience at IITPalakkad
All categories
General Aptitude
1.8k
Engineering Mathematics
7.3k
Discrete Mathematics
5.1k
Mathematical Logic
2.1k
Set Theory & Algebra
1.3k
Combinatory
880
Graph Theory
806
Probability
991
Linear Algebra
685
Calculus
489
Digital Logic
2.9k
Programming and DS
4.9k
Algorithms
4.4k
Theory of Computation
6k
Compiler Design
2.1k
Operating System
4.2k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.1k
Non GATE
1.4k
Others
1.5k
Admissions
594
Exam Queries
577
Tier 1 Placement Questions
23
Job Queries
72
Projects
18
Follow @csegate
Recent Blog Comments
It was said that there will be an address...
sir .I recvd a mail which states "Your...
https://drive.google.com/open?id=1lzQpNHE4Phvo9JFA...
Sir, I will say the "
THE PURPOSE OF...
Even though the pre booking is closed...if i go...
49,808
questions
54,481
answers
188,251
comments
74,526
users