Posted by Samantha on Saturday, December 4, 2010 at 3:23pm.
Let A= {for all m that's an element of the integers  m=3k+7 for some k that's an element of positive integers}. Prove that A is countably infiite. Note: you must define a function from Z+ to A, and then prove that the function you definied is a bijection

discrete math  MathMate, Saturday, December 4, 2010 at 7:35pm
So the question is:
A={m∈ℤ : m=3k+7 ∃k∈ℤ^{+}}
Prove that A is countably infinite by defining a function f : ℤ > A and proving that f is bijective.
A function f is bijective if and only if its inverse is also a function.
Since the inverse of f is relative easy to find, all you need is to prove that the inverse is a function.
If f is bijective (i.e. onetoone and onto), and if the domain is countably infinite, the range of f, i.e. A, must be also.
Answer This Question
Related Questions
 discrete math  Let f:ℤ+ → ℤ+ be the function defined by: for...
 computer science  Write a method printBackwards that prints an array of ...
 PHYSICS  Consider a series of integers that are all positive and all of the ...
 PHYSICS  Consider a series of integers a1< a2<... < a43 < a44 that...
 discrete math  1)prove that if x is rational and x not equal to 0, then 1/x is ...
 math  Let f:ℤ+ → ℤ+ be the function defined by: for each x &#...
 math help please  Let f:ℤ+ → ℤ+ be the function defined by: ...
 discrete math  Fill in the blanks: For all sets A and B, if A is in the set of ...
 Discrete Math  Theorem: For every integer n, if x and y are positive integers ...
 discrete math  If a and b are positive integers, prove that; ab = gcd(a,b)*lcm(...
More Related Questions