February 22, 2017

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:

Related Questions

More Related Questions