Wednesday
April 23, 2014

Homework Help: discrete math

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

Answer this Question

First Name:
School Subject:
Answer:

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

Search
Members