Let S be the set of odd positive integers. A function F : N S is defined by F(n) = k for
Chapter 9, Problem 9.77(choose chapter or problem)
Let S be the set of odd positive integers. A function F : N S is defined by F(n) = k for each n N,where k is that odd positive integer for which 3n + 1 = 2mk for some nonnegative integer m. Prove ordisprove the following:(a) F is one-to-one.(b) F is onto.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer