Scribd Logo
Upload

Welcome to Scribd!

  • Résumé Suites Arith-Geom

    Uploaded by

    cherazer
    21 views1 page
    This document summarizes two recursive sequences: 1) The first sequence is un+1 = qun, where q > 1. This sequence grows exponentially as n increases, with the limit approaching infinity. 2) The second sequence is un+1 = un + r, where r is a constant. This sequence increases linearly with n. The sum of the first n terms approaches n(n+1)/2 as n increases without limit. Both sequences demonstrate how recursive relationships define sequences and determine their behavior as the number of terms increases.

    Original Description:

    Original Title

    Résumé_suites_Arith-geom

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document summarizes two recursive sequences: 1) The first sequence is un+1 = qun, where q > 1. This sequence grows exponentially as n increases, with the limit approaching infinity. 2) The second sequence is un+1 = un + r, where r is a constant. This sequence increases linearly with n. The sum of the first n terms approaches n(n+1)/2 as n increases without limit. Both sequences demonstrate how recursive relationships define sequences and determine their behavior as the number of terms increases.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    21 views1 page

    Résumé Suites Arith-Geom

    Uploaded by

    cherazer
    This document summarizes two recursive sequences: 1) The first sequence is un+1 = qun, where q > 1. This sequence grows exponentially as n increases, with the limit approaching infinity. 2) The second sequence is un+1 = un + r, where r is a constant. This sequence increases linearly with n. The sum of the first n terms approaches n(n+1)/2 as n increases without limit. Both sequences demonstrate how recursive relationships define sequences and determine their behavior as the number of terms increases.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    2007 !

    " #$%

    & ' ( )
    . q ! "# $ % r ! "# * +

    ,-
    u n +1 = q .u n u n +1 = u n + r

    u 0 %( un = u0 q n u 0 %( un = u0 + n r
    .

    u1 %( u n = u1 q n 1
    u1 %( u n = u 1 + (n 1) r

    p , u n = u p + (n / 0/ ,-
    n p , un = u p q n p
    n p )r

    1 q n +1 u0 +un
    S = u 0 + u1 + ....... + u n = u 0 S = u 0 + u 1 + ....... + u n = (n + 1)
    1 q 2

    1 23 1 23
    .% / ////////////
    1 q %( + 4 5(
    S = %( × S = .% .2 × 2
    8 09 :
    1 q

    45 0 45 0
    1 q n +1 n (n + 1)
    1 + q + q + ....... + q =
    2 n
    1 + 2 + 3 + ...... + n =
    1 q 2
    q 11

    q >1 lim q n = +
    n +

    q =1 lim q n = 1 r >0 lim u n = +


    n +
    n + ;;;;;;;
    1< q <1 lim q n = 0 r <0 lim u n =
    n +
    +
    ( )
    n
    n
    q 1 ;. < 4: q =

    < <
    ( >? @ .% a ,b ,c ) ( @ .% a ,b ,c )
    <
    b 2 = a ×c 2b = a + c <
    c % a . @B >= A b.@ c % a . @B A b .@

    M r : Remila

    You might also like