# discrete math

posted by .

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 -

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. one-to-one and onto), and if the domain is countably infinite, the range of f, i.e. A, must be also.

## Similar Questions

1. ### discrete math

1)prove that if x is rational and x not equal to 0, then 1/x is rational. 2) prove that there is a positive integers that equals the sum of the positive integers not exceeding it. Is your proof constructive or nonconstructive?
2. ### discrete math

If a and b are positive integers, prove that; ab = gcd(a,b)*lcm(a,b).
3. ### Discrete Math

Theorem: For every integer n, if x and y are positive integers with max(x, y) = n, then x = y. Basic Step: Suppose that n = 1. If max(x, y) = 1 and x and y are positive integers, we have x = 1 and y = 1. Inductive Step: Let k be a …
4. ### discrete math

Fill in the blanks: For all sets A and B, if A is in the set of B, then A union B in in the set of B. Proof: Suppose A and B are any sets and A in in the set of B. [we must show that __________] Let x be and element of _______. [we …
5. ### computer science

Write a method printBackwards that prints an array of integers in reverse order, in the following format. For the array {1, -3, 4, 7, 2}: element [4] is 2 element [3] is 7 element [2] is 4 element [1] is -3 element [0] is 1
6. ### discrete math

Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, nd k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one?
7. ### math

Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, nd k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one?