I saw the following sequence-
Sn=12,23,34,45,56,…,n−1n.
Now, I may say that-
(A)≤Sn≤(B),
where, A=12 and B=1
Now, am I correct in saying that B is the least possible upper bound?
If yes, how do I prove it?
Thanks for any help.
I have injection f:A→B and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...
No comments:
Post a Comment