Show that lim sup (an+bn)<=limsupan +limsupbn(adsbygoogle = window.adsbygoogle || []).push({});

where (bn) and (an) are bounded...

How would you go from for n < N , sn+tn<=limsups + limsupt

to limsup(an+bn)<=limsups + limsupt ?

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Difficult Problem proving limsup of a sequence.

Loading...

Similar Threads for Difficult Problem proving |
---|

A Maximization problem using Euler Lagrange |

A Maximization Problem |

I A question about Vector Analysis problems |

B Square root differential problem |

B Integrating Problem |

**Physics Forums | Science Articles, Homework Help, Discussion**