# Thread:

1. ## Proving convergence of {an/bn} given...

Theorem: If {an} is bounded and {bn} tends to infinity with bn not equal to 0 for all n, then {an/bn} converges to 0.

I am having trouble understanding why this theorem is true. Can somebody please provide me with a proof?

2. Originally Posted by gwiz
Theorem: If {an} is bounded and {bn} tends to infinity with bn not equal to 0 for all n, then {an/bn} converges to 0.

I am having trouble understanding why this theorem is true. Can somebody please provide me with a proof?
$-\dfrac{K}{|b_n|}\le \left| \dfrac{a_n}{b_b} \right| \le \dfrac{K}{|b_n|}$

where $K \ge |a_n|$ for all $$$n \in \mathbb{N}$

CB
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 3, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9093095660209656, "perplexity_flag": "middle"}