How do you prove a sequence is unbounded ?
Could someone explain this?
show for any n\in N, then is a term a_m in your
sequence such that n < |a_m|
Also
Let A and B be two sets. If there exists a one-to-one
function f from A to B and another one-to-one function
g from B to A, then card(A) = card(B).
Does this mean function f is onto?
Does this mean function g is onto?
how about the composit functions F(G),G(F)?
why?
Could someone explain this?
show for any n\in N, then is a term a_m in your
sequence such that n < |a_m|
Also
Let A and B be two sets. If there exists a one-to-one
function f from A to B and another one-to-one function
g from B to A, then card(A) = card(B).
Does this mean function f is onto?
Does this mean function g is onto?
how about the composit functions F(G),G(F)?
why?