|Feb23-12, 09:57 PM||#1|
show that the function f is bijection
a function f, that maps from the Cartesian Product of the positive integers to the positive integers. where
f(x,y) = 2^(x - 1) * (2y - 1).
I have to show that this function is both one-to-one and onto. I started trying to prove that it is onto, showing that there exists an n such that f(n,0) = n but I am not sure where to go from here.
|Feb24-12, 01:26 AM||#2|
Hey zodiacbrave and welcome to the forum.
For one-to-one, one suggestion I have is to show that the inverse exists everywhere in the respective domain.
By showing that the inverse exists everywhere in the domain, you have basically shown the one-to-one property.
Even though we are only dealing with integers, if you show this property over the positive reals, then it automatically applies for the positive integers (think of it in terms of subsets).
Hint: What do we need for the derivative to be when an inverse function exists across an interval?
|Similar Threads for: show that the function f is bijection|
|Bijection for a power set function||Calculus & Beyond Homework||8|
|(Real Analysis) Show the function is Bijection||Calculus & Beyond Homework||14|
|Show a function is differentiable everywhere, and show its derivative is continuous||Calculus & Beyond Homework||1|
|Prove Inverse of Bijection function||Calculus & Beyond Homework||4|
|Given partials of a function, show the function does not exist||Calculus & Beyond Homework||5|