Sunday

April 20, 2014

April 20, 2014

Posted by **Samantha** on Saturday, December 4, 2010 at 3:23pm.

- discrete math -
**MathMate**, Saturday, December 4, 2010 at 7:35pmSo 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. one-to-one and onto), and if the domain is countably infinite, the range of f, i.e. A, must be also.

**Related Questions**

computer science - Write a method printBackwards that prints an array of ...

discrete math - 1)prove that if x is rational and x not equal to 0, then 1/x is ...

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(...

Data Structures and Algorithms - Given integers R,M with M≠0, let S(R,M) ...

algebra - Find the sum of all positive integers c such that for some positive ...

math - Find the sum of all positive integers m such that 2^m can be expressed as...

Integers - The larger of two positive integers is five more than twice the ...

discrete math - Fill in the blanks: For all sets A and B, if A is in the set of ...

discrete math - Find how many positive integers with exactly four decimal digits...