Scribd Logo
Upload

Welcome to Scribd!

  • Asin.: DH T (Boundcd) TT I Ih N N Sin

    Uploaded by

    VEER Sharma
    5 views1 page
    The document discusses upper bounds of sequences. It defines the upper bound (U) of a sequence as the least number that is greater than or equal to each term in the sequence. It also states that if there is no number greater than or equal to each term, the upper bound is positive infinity. The upper bound provides an estimate of how large the terms in a sequence can get.

    Original Description:

    Unit 1

    Original Title

    - 2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses upper bounds of sequences. It defines the upper bound (U) of a sequence as the least number that is greater than or equal to each term in the sequence. It also states that if there is no number greater than or equal to each term, the upper bound is positive infinity. The upper bound provides an estimate of how large the terms in a sequence can get.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    5 views1 page

    Asin.: DH T (Boundcd) TT I Ih N N Sin

    Uploaded by

    VEER Sharma
    The document discusses upper bounds of sequences. It defines the upper bound (U) of a sequence as the least number that is greater than or equal to each term in the sequence. It also states that if there is no number greater than or equal to each term, the upper bound is positive infinity. The upper bound provides an estimate of how large the terms in a sequence can get.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    3

    HTFTCT K = max {| m 1, M), T ZE HE

    M sKTT | m | s K .(2)
    T m s | m |, 3Ta
    - m sK
    -
    KS m.
    3
    377:7Ht (1), (2) TeT (3),
    - K smS s, M sK Vn EN
    -

    Ks s, sK VnEN.

    s K Vn ¬N
    -K S s, S K Vn EN. ..(4)

    n = 1
    T 3 7 : yAy 354T: - K TTK I T7:
    n=1

    salSK Vn EN
    dH T(boundcd) TTI
    3aTETU TT% 7 , J s,, =n si
    IH n =1

    Sn= n sin=asin.
    S T Vn EN.

    = 1
    f sK Vn EN, 3 , 3uftazINaT ÈI
    fr4TT 1. ftit 3TTA s,Pn1 5 34 uftara (UPPER BOUND) TE 2HH HET U I

    The UPPER BOUND, U of a scquence is the lcast number wvhich is grcatcr

    han or cqual to each and cvery s,

    TE 2 T I, E7 TEd E 3uf7 uftara (UPPER BOUND) + I

    if thcre is no number grcater than oi cqual to cach and


    For a
    sequence n=1
    say that UPPER BOUND of s,, is +oo.
    every s, then we

    You might also like