Countable and uncountable sets: a. show that if a is countably infinite, then a x a is countably infinite. b. is the set of all bit strings of finite length countable or uncountable? if countable, show how you would enumerate the set. if uncountable, give a proof by diagonalization. c. is the set of all bit strings of infinite length countable or uncountable? if countable, show how you would enumerate the set. if uncountable, give a proof by diagonalization.

what statement? is there an image?

aloha~! my name is zalgo and i am here to you out on this amazing day. to answer your question, yes, nonzero numbers can have a greatest common factor and that would be 1. still don't get it? let me considering every number is divisible by 1 and hence every number has 1 as a factor of theirs. so, if 2 nonzero numbers didn't share any gcf (greatest common factor), they would still have a factor in common and that would be 1.

i hope that this ! : p

"stay and stay proud! " - zalgo

(by the way, do you mind marking me as brainliest? i'd greatly appreciate it! mahalo! x3)

a) 0,0; 1,1; and 2,2

step-by-step explanation:

these have the exact same coordinates, thus they are the correct function.