Álgebra Límites

SUCESIONES I
𝟏. −𝑫𝒆𝒇𝒊𝒏𝒊𝒄𝒊ó𝒏
𝑈𝑛𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑟𝑒𝑎𝑙 𝑒𝑠 𝑢𝑛𝑎 𝑠𝑒𝑐𝑢𝑒𝑛𝑐𝑖𝑎 𝑑𝑒 𝑛ú𝑚𝑒𝑟𝑜𝑠 𝑟𝑒𝑎𝑙𝑒𝑠 𝑞𝑢𝑒 𝑝𝑢𝑒𝑑𝑒 𝑠𝑒𝑟 𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑎 𝑑𝑒 𝑙𝑎𝑠 𝑠𝑖𝑔𝑢𝑖𝑒𝑛𝑡𝑒𝑠 𝑚𝑎𝑛𝑒𝑟𝑎𝑠:
𝟏. 𝟏. − 𝑫𝒆𝒇𝒊𝒏𝒊𝒄𝒊ó𝒏 𝒑𝒐𝒓 𝒓𝒆𝒈𝒍𝒂 𝒅𝒆 𝒄𝒐𝒓𝒓𝒆𝒔𝒑𝒐𝒏𝒅𝒆𝒏𝒄𝒊𝒂
𝑆𝑒𝑎 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝒂𝒏 𝒏∈ℤ+ 𝑜 𝑡𝑎𝑚𝑏𝑖é𝑛 𝒂𝒏 𝒏∈ℕ 𝑜 𝒂𝒏 𝒏≥𝟏
𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑎 𝑑𝑒 𝑚𝑎𝑛𝑒𝑟𝑎 𝑞𝑢𝑒 𝒂𝒏 = 𝒇 𝒏 𝑝𝑎𝑟𝑎 𝑡𝑜𝑑𝑜 𝑛 ∈ ℤ+

𝑅𝑒𝑔𝑙𝑎 𝑑𝑒 𝑐𝑜𝑟𝑟𝑒𝑠𝑝𝑜𝑛𝑑𝑒𝑛𝑐𝑖𝑎 𝑜
𝑻é𝒓𝒎𝒊𝒏𝒐 𝒏 − é𝒔𝒊𝒎𝒐
𝐸𝑗𝑒𝑚𝑝𝑙𝑜:
𝟐𝒏 + 𝟏
𝑆𝑒𝑎 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ 𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑎 𝑝𝑜𝑟 𝒂𝒏 = 𝒇(𝒏) =
𝒏+𝟐
2 1 +1 2 2 +1 5 2 3 +1 7
𝑎1 = 𝑓 1 = =1 𝑎2 = 𝑓 2 = = 𝑎3 = 𝑓 3 = =
1+2 2+2 4 3+2 5
𝐸𝑠 𝑑𝑒𝑐𝑖𝑟: 5 7 2𝑛 + 1
𝑎𝑛 𝑛∈ℤ+ = 1; ; ; … ; ;…
4 5 𝑛+2
𝟏. 𝟐. − 𝑫𝒆𝒇𝒊𝒏𝒊𝒄𝒊ó𝒏 𝒑𝒐𝒓 𝒓𝒆𝒈𝒍𝒂 𝒅𝒆 𝒓𝒆𝒄𝒖𝒓𝒓𝒆𝒏𝒄𝒊𝒂
𝑆𝑒𝑎 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ 𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑎 𝑑𝑒 𝑚𝑎𝑛𝑒𝑟𝑎 𝑞𝑢𝑒
𝒂𝒏+𝒌 = 𝒇 𝒂𝒏 ; 𝒂𝒏+𝟏 ; 𝒂𝒏+𝟐 ; … ; 𝒂𝒏+𝒌−𝟏 𝒑𝒂𝒓𝒂 𝒕𝒐𝒅𝒐 𝒏 ∈ ℤ+

𝐸𝑠 𝑑𝑒𝑐𝑖𝑟, 𝒖𝒏 𝒕é𝒓𝒎𝒊𝒏𝒐 𝒅𝒆𝒑𝒆𝒏𝒅𝒆 𝒅𝒆 𝒍𝒐𝒔 𝒂𝒏𝒕𝒆𝒓𝒊𝒐𝒓𝒆𝒔.
𝑹𝒆𝒈𝒍𝒂 𝒅𝒆 𝒓𝒆𝒄𝒖𝒓𝒓𝒆𝒏𝒄𝒊𝒂
𝑆𝑒𝑎 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ 𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑎 𝑝𝑜𝑟 𝒂𝒏+𝟐 = 𝒂𝒏+𝟏 + 𝒂𝒏 ∧ 𝒂𝟏 = 𝒂𝟐 = 𝟏
𝐴𝑝𝑙𝑖𝑐𝑎𝑛𝑑𝑜 𝑙𝑎 𝑟𝑒𝑔𝑙𝑎 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎 𝑝𝑎𝑟𝑎 𝑛 = 1 𝑎3 = 𝑎2 + 𝑎1 → 𝒂𝟑 = 𝟏 + 𝟏 = 𝟐
𝐴𝑝𝑙𝑖𝑐𝑎𝑛𝑑𝑜 𝑙𝑎 𝑟𝑒𝑔𝑙𝑎 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎 𝑝𝑎𝑟𝑎 𝑛 = 2 𝑎4 = 𝑎3 + 𝑎2 → 𝒂𝟒 = 𝟐 + 𝟏 = 𝟑

𝐴𝑝𝑙𝑖𝑐𝑎𝑛𝑑𝑜 𝑙𝑎 𝑟𝑒𝑔𝑙𝑎 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎 𝑝𝑎𝑟𝑎 𝑛 = 3 𝑎5 = 𝑎4 + 𝑎3 → 𝒂𝟓 = 𝟑 + 𝟐 = 𝟓
𝐴𝑝𝑙𝑖𝑐𝑎𝑛𝑑𝑜 𝑙𝑎 𝑟𝑒𝑔𝑙𝑎 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎 𝑝𝑎𝑟𝑎 𝑛 = 4 𝑎6 = 𝑎5 + 𝑎4 → 𝒂𝟔 = 𝟓 + 𝟑 = 𝟖
𝐴𝑝𝑙𝑖𝑐𝑎𝑛𝑑𝑜 𝑙𝑎 𝑟𝑒𝑔𝑙𝑎 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎 𝑝𝑎𝑟𝑎 𝑛 = 5 𝑎7 = 𝑎6 + 𝑎5 → 𝒂𝟕 = 𝟖 + 𝟓 = 𝟏𝟑
𝐸𝑠 𝑑𝑒𝑐𝑖𝑟: 𝑎𝑛 𝑛∈ℤ+ = 1; 1; 2; 3; 5; 8; 13; …
𝐿𝑎 𝑐𝑢𝑎𝑙 𝑒𝑠 𝑐𝑜𝑛𝑜𝑐𝑖𝑑𝑎 𝑐𝑜𝑚𝑜 𝑙𝑎 𝑺𝑼𝑪𝑬𝑺𝑰Ó𝑵 𝑫𝑬 𝑭𝑰𝑩𝑶𝑵𝑨𝑪𝑪𝑰

𝟐. −𝑺𝒖𝒄𝒆𝒔𝒊𝒐𝒏𝒆𝒔 𝑵𝒐𝒕𝒂𝒃𝒍𝒆𝒔
𝟐. 𝟏. −𝑷𝒓𝒐𝒈𝒓𝒆𝒔𝒊ó𝒏 𝑨𝒓𝒊𝒕𝒎é𝒕𝒊𝒄𝒂
𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ 𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑎 𝑑𝑒 𝑙𝑎 𝑠𝑖𝑔𝑢𝑖𝑒𝑛𝑡𝑒 𝑓𝑜𝑟𝑚𝑎: 𝑎𝑛+1 = 𝑎𝑛 + 𝑟 ∧ 𝑎1 = 𝑎 (𝑟 ≠ 0)

𝑆𝑒𝑎 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ 𝑡𝑎𝑙 𝑞𝑢𝑒 𝑎𝑛+1 = 𝑎𝑛 + 4 ∧ 𝑎1 = 3
𝑎2 = 𝑎1 + 4 → 𝑎2 = 3 + 4 = 7 𝐸𝑠 𝑑𝑒𝑐𝑖𝑟: 𝑎𝑛 𝑛∈ℤ+ = 3; 7; 11; 15; 19; …
𝑎3 = 𝑎 2 + 4 → 𝑎3 = 7 + 4 = 11 𝑇é𝑟𝑚𝑖𝑛𝑜 𝑛 − é𝑠𝑖𝑚𝑜 = 𝑎𝑛 = 𝑎1 + 𝑛 − 1 𝑟
𝑎4 = 𝑎 3 + 4 → 𝑎4 = 11 + 4 = 15 𝑎𝑛 = 3 + 𝑛 − 1 4
𝑎𝑛 = 4𝑛 − 1
𝟐. 𝟐. −𝑷𝒓𝒐𝒈𝒓𝒆𝒔𝒊ó𝒏 𝑮𝒆𝒐𝒎é𝒕𝒓𝒊𝒄𝒂
𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ 𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑎 𝑑𝑒 𝑙𝑎 𝑠𝑖𝑔𝑢𝑖𝑒𝑛𝑡𝑒 𝑓𝑜𝑟𝑚𝑎: 𝑎𝑛+1 = 𝑎𝑛 . 𝑟 ∧ 𝑎1 = 𝑎 (𝑟 ≠ 0)

𝑆𝑒𝑎 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ 𝑡𝑎𝑙 𝑞𝑢𝑒 𝑎𝑛+1 = 𝑎𝑛 . 2 ∧ 𝑎1 = 5
𝑎2 = 𝑎1 . 2 → 𝑎2 = 5.2 = 10 𝐸𝑠 𝑑𝑒𝑐𝑖𝑟: 𝑎𝑛 𝑛∈ℤ+ = 5; 10; 20; 40; …

𝑎3 = 𝑎2 . 2 → 𝑎3 = 10.2 = 20 𝑇é𝑟𝑚𝑖𝑛𝑜 𝑛 − é𝑠𝑖𝑚𝑜 = 𝑎𝑛 = 𝑎1 . 𝑟 𝑛−1
𝑎4 = 𝑎3 . 2 → 𝑎4 = 20.2 = 40 𝑎𝑛 = 5.2𝑛−1
𝟐. 𝟑. −𝑺𝒖𝒄𝒆𝒔𝒊ó𝒏 𝒄𝒐𝒏 𝒅𝒊𝒇𝒆𝒓𝒆𝒏𝒄𝒊𝒂𝒔 𝒇𝒊𝒏𝒊𝒕𝒂𝒔
𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ 𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑎 𝑑𝑒 𝑙𝑎 𝑠𝑖𝑔𝑢𝑖𝑒𝑛𝑡𝑒 𝑓𝑜𝑟𝑚𝑎:
𝑎𝑛 𝑛∈ℤ+ = {𝑎1 ; 𝑎2 ; 𝑎3 ; 𝑎4 ; 𝑎5 ; 𝑎6 ; … }
𝑏1 𝑏2 𝑏3 𝑏4 𝑏5
𝑐1 𝑐2 𝑐3 𝑐4 𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑐𝑜𝑛 𝑑𝑖𝑓𝑒𝑟𝑒𝑛𝑐𝑖𝑎𝑠 𝑓𝑖𝑛𝑖𝑡𝑎𝑠 𝑑𝑒 𝑘 − é𝑠𝑖𝑚𝑜 𝑜𝑟𝑑𝑒𝑛
𝒌 𝒏𝒊𝒗𝒆𝒍𝒆𝒔
…
∆ ∆
𝑆𝑒𝑎 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ = {3; 7; 13; 21; 31; 43; … }
4 6 8 10 12
𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑐𝑜𝑛 𝑑𝑖𝑓𝑒𝑟𝑒𝑛𝑐𝑖𝑎𝑠 𝑓𝑖𝑛𝑖𝑡𝑎𝑠 𝑑𝑒 𝟐𝒅𝒐 𝒐𝒓𝒅𝒆𝒏
2 2 2 2
𝑆𝑒𝑎 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ = {1; 9; 29; 67; 129; ; … }
8 20 38 62
12 18 24 𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑐𝑜𝑛 𝑑𝑖𝑓𝑒𝑟𝑒𝑛𝑐𝑖𝑎𝑠 𝑓𝑖𝑛𝑖𝑡𝑎𝑠 𝑑𝑒 𝟑𝒆𝒓 𝒐𝒓𝒅𝒆𝒏
6 6
𝑪á𝒍𝒄𝒖𝒍𝒐 𝒅𝒆𝒍 𝒕é𝒓𝒎𝒊𝒏𝒐 𝒏 − é𝒔𝒊𝒎𝒐:
𝑎𝑛 𝑛∈ℤ+ = {𝑎1 ; 𝑎2 ; 𝑎3 ; 𝑎4 ; 𝑎5 ; 𝑎6 ; … }
𝑺𝒖𝒄𝒆𝒔𝒊ó𝒏 𝒄𝒐𝒏 𝒅𝒊𝒇𝒆𝒓𝒆𝒏𝒄𝒊𝒂𝒔 𝒇𝒊𝒏𝒊𝒕𝒂𝒔 𝒅𝒆 𝒌 − é𝒔𝒊𝒎𝒐 𝒐𝒓𝒅𝒆𝒏
𝑏1 𝑏2 𝑏3 𝑏4 𝑏5
𝑐1 𝑐2 𝑐3 𝑐4 𝒂𝒏 = 𝒂𝟏 𝑪𝒏−𝟏
𝟎 + 𝒃𝟏 𝑪𝒏−𝟏 𝒏−𝟏
𝟏 + 𝒄𝟏 𝑪𝟐 + ⋯ ∆𝑪𝒏−𝟏
𝒌
𝑘 𝑛𝑖𝑣𝑒𝑙𝑒𝑠
…
∆ ∆
𝑆𝑒𝑎 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ = {3; 7; 13; 21; 31; 43; … } 𝑺𝒖𝒄𝒆𝒔𝒊ó𝒏 𝒄𝒐𝒏 𝒅𝒊𝒇𝒆𝒓𝒆𝒏𝒄𝒊𝒂𝒔 𝒇𝒊𝒏𝒊𝒕𝒂𝒔 𝒅𝒆 𝟐𝒅𝒐 𝒐𝒓𝒅𝒆𝒏
4 6 8 10 12 𝒂𝒏 = 𝟑𝑪𝒏−𝟏
𝟎 + 𝟒𝑪𝒏−𝟏 𝒏−𝟏
𝟏 + 𝟐𝑪𝟐
2 2 2 2 𝑒𝑛 𝑔𝑒𝑛𝑒𝑟𝑎𝑙:
𝑎𝑛 = 3𝐶0𝑛−1 + 4𝐶1𝑛−1 + 2𝐶2𝑛−1
𝑎4 = 3𝐶03 + 4𝐶13 + 2𝐶23 𝑎6 = 3𝐶05 + 4𝐶15 + 2𝐶25
(𝑛−1)(𝑛−2)
3𝑥2 5𝑥4 𝑎𝑛 = 3(1) + 4(𝑛 − 1)+ 2 1𝑥2
𝑎4 = 3 1 + 4 3 + 2 𝑎4 = 3 1 + 4 5 + 2
1𝑥2 1𝑥2 𝑎𝑛 = 3 + 4𝑛 − 4 + 𝑛2 − 3𝑛 + 2
𝑎4 = 21 𝑎4 = 43
𝒂𝒏 = 𝒏𝟐 + 𝒏 + 𝟏
𝑆𝑒𝑎 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ = {1; 9; 29; 67; 129; ; … }
8 20 38 62
𝑺𝒖𝒄𝒆𝒔𝒊ó𝒏 𝒄𝒐𝒏 𝒅𝒊𝒇𝒆𝒓𝒆𝒏𝒄𝒊𝒂𝒔 𝒇𝒊𝒏𝒊𝒕𝒂𝒔 𝒅𝒆 𝟑𝒆𝒓 𝒐𝒓𝒅𝒆𝒏
12 18 24
𝑎𝑛 = 1𝐶0𝑛−1 + 8𝐶1𝑛−1 + 12𝐶2𝑛−1 + 6𝐶3𝑛−1
6 6
𝑎4 = 1𝐶03 + 8𝐶13 + 12𝐶23 + 6𝐶33 𝑎5 = 1𝐶04 + 8𝐶14 + 12𝐶24 + 6𝐶34

𝑎4 = 67 𝑎5 = 129
𝑒𝑛 𝑔𝑒𝑛𝑒𝑟𝑎𝑙:
𝑎𝑛 = 1𝐶0𝑛−1 + 8𝐶1𝑛−1 + 12𝐶2𝑛−1 + 6𝐶3𝑛−1
𝑛−1 𝑛−2 𝑛−1 𝑛−2 𝑛−3

𝑎𝑛 = 1 1 + 8(𝑛 − 1)+ 12 +6
1𝑥2 1𝑥2𝑥3
𝑎𝑛 = 𝑛 3 + 𝑛 − 1
𝐏𝐑𝐎𝐁𝐋𝐄𝐌𝐀𝐒 𝐑𝐄𝐒𝐔𝐄𝐋𝐓𝐎𝐒
𝐒𝐎𝐋𝐔𝐂𝐈Ó𝐍
𝟑. −𝑫𝒆𝒇𝒊𝒏𝒊𝒄𝒊ó𝒏 𝒇𝒐𝒓𝒎𝒂𝒍 𝒅𝒆 𝒔𝒖𝒄𝒆𝒔𝒊ó𝒏
𝑈𝑛𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑒𝑠 𝑢𝑛𝑎 𝒇𝒖𝒏𝒄𝒊ó𝒏 𝑐𝑜𝑛 𝑑𝑜𝑚𝑖𝑛𝑖𝑜 𝑒𝑙 𝑐𝑜𝑛𝑗𝑢𝑛𝑡𝑜 𝑑𝑒 𝑙𝑜𝑠 𝒏ú𝒎𝒆𝒓𝒐𝒔 𝒏𝒂𝒕𝒖𝒓𝒂𝒍𝒆𝒔, 𝑙𝑎 𝑐𝑢𝑎𝑙 𝑎𝑠𝑖𝑔𝑛𝑎 𝑎 𝑐𝑎𝑑𝑎
𝑛ú𝑚𝑒𝑟𝑜 𝑛𝑎𝑡𝑢𝑟𝑎𝑙, 𝑢𝑛 ú𝒏𝒊𝒄𝒐 𝒏ú𝒎𝒆𝒓𝒐 𝒓𝒆𝒂𝒍 𝑝𝑒𝑟𝑓𝑒𝑐𝑡𝑎𝑚𝑒𝑛𝑡𝑒 𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑜 𝑐𝑜𝑚𝑜 𝒂𝒏 𝑑𝑜𝑛𝑑𝑒 n ∈ ℕ
𝐸𝑠 𝑑𝑒𝑐𝑖𝑟:
𝒇: ℕ → ℝ, 𝒇 𝒏 = 𝒂𝒏 ∀𝒏 ∈ ℕ
𝑑𝑜𝑛𝑑𝑒 𝒂𝒏 𝑠𝑒𝑟á 𝑒𝑙 𝒕é𝒓𝒎𝒊𝒏𝒐 𝒅𝒆 𝒍𝒖𝒈𝒂𝒓 𝒏 𝑒𝑛 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛

𝑜 𝑡𝑎𝑚𝑏𝑖é𝑛 𝑐𝑜𝑛𝑜𝑐𝑖𝑑𝑜 𝑐𝑜𝑚𝑜 𝒕é𝒓𝒎𝒊𝒏𝒐 𝒏 − é𝒔𝒊𝒎𝒐 𝒐 𝒈𝒆𝒏𝒆𝒓𝒂𝒍.
𝐴𝑑𝑒𝑚á𝑠 𝑠𝑒 𝑒𝑠𝑐𝑟𝑖𝑏𝑒: 𝒂𝟏 , 𝒂𝟐 , 𝒂𝟑 , … , 𝒂𝒏 , … 𝒐 𝒂𝒏 𝒏∈ℕ 𝑜 𝑠𝑖𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡𝑒 𝒂𝒏

𝟑. 𝟐. 𝑮𝒓á𝒇𝒊𝒄𝒂 𝒅𝒆 𝒖𝒏𝒂 𝒔𝒖𝒄𝒆𝒔𝒊ó𝒏
𝑛
𝑌𝑎 𝑞𝑢𝑒 𝑙𝑎𝑠 𝑠𝑢𝑐𝑒𝑠𝑖𝑜𝑛𝑒𝑠 𝑠𝑜𝑛 𝑓𝑢𝑛𝑐𝑖𝑜𝑛𝑒𝑠. 𝑡𝑎𝑚𝑏𝑖é𝑛 𝑝𝑢𝑒𝑑𝑒𝑛 𝑔𝑟𝑎𝑓𝑖𝑐𝑎𝑟𝑠𝑒. 𝑎𝑛 𝑛∈ℤ+ 𝑑𝑜𝑛𝑑𝑒 𝑎𝑛 =
𝑛+1
1
; 𝑛 𝑒𝑠 𝑖𝑚𝑝𝑎𝑟
𝑏𝑛 𝑛∈ℤ+ 𝑑𝑜𝑛𝑑𝑒 𝑏𝑛 = 𝑛
1
− ; 𝑛 𝑒𝑠 𝑝𝑎𝑟
𝑛−1
1
; 𝑛 𝑒𝑠 𝑖𝑚𝑝𝑎𝑟
𝑐𝑛 𝑛∈ℤ+ 𝑑𝑜𝑛𝑑𝑒 𝑐𝑛 = 𝑛
𝑛
; 𝑛 𝑒𝑠 𝑝𝑎𝑟
𝑛+1
𝟑. 𝟑. 𝑪𝒍𝒂𝒔𝒊𝒇𝒊𝒄𝒂𝒄𝒊ó𝒏 𝒅𝒆 𝒍𝒂𝒔 𝒔𝒖𝒄𝒆𝒔𝒊𝒐𝒏𝒆𝒔
𝑌𝑎 𝑞𝑢𝑒 𝑙𝑎𝑠 𝑠𝑢𝑐𝑒𝑠𝑖𝑜𝑛𝑒𝑠 𝑠𝑜𝑛 𝑓𝑢𝑛𝑐𝑖𝑜𝑛𝑒𝑠, 𝑡𝑎𝑚𝑏𝑖é𝑛 𝑠𝑒 𝑝𝑢𝑒𝑑𝑒𝑛 𝑐𝑙𝑎𝑠𝑖𝑓𝑖𝑐𝑎𝑟 𝑐𝑜𝑚𝑜 𝑚𝑜𝑛ó𝑡𝑜𝑛𝑎𝑠 𝑦 𝑎𝑐𝑜𝑡𝑎𝑑𝑎𝑠.
𝟑. 𝟑. 𝟏 𝑺𝒖𝒄𝒆𝒔𝒊ó𝒏 𝑴𝒐𝒏ó𝒕𝒐𝒏𝒂
𝑈𝑛𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑒𝑠 𝒎𝒐𝒏ó𝒕𝒐𝒏𝒂 𝑠𝑖 𝑐𝑢𝑚𝑝𝑙𝑒
𝑎𝑙𝑔𝑢𝑛𝑎 𝑑𝑒 𝑙𝑎𝑠 𝑠𝑖𝑔𝑢𝑖𝑒𝑛𝑡𝑒𝑠 𝑑𝑒𝑓𝑖𝑛𝑖𝑐𝑖𝑜𝑛𝑒𝑠
𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑐𝑟𝑒𝑐𝑖𝑒𝑛𝑡𝑒: ∀𝑛 ∈ ℕ 𝑎𝑛+1 > 𝑎𝑛

𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑑𝑒𝑐𝑟𝑒𝑐𝑖𝑒𝑛𝑡𝑒: ∀𝑛 ∈ ℕ 𝑎𝑛+1 < 𝑎𝑛
𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑛𝑜 𝑐𝑟𝑒𝑐𝑖𝑒𝑛𝑡𝑒: ∀𝑛 ∈ ℕ 𝑎𝑛+1 ≤ 𝑎𝑛
𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑛𝑜 𝑑𝑒𝑐𝑟𝑒𝑐𝑖𝑒𝑛𝑡𝑒: ∀𝑛 ∈ ℕ 𝑎𝑛+1 ≥ 𝑎𝑛
𝟑. 𝟑. 𝟐 𝑺𝒖𝒄𝒆𝒔𝒊ó𝒏 𝑨𝒄𝒐𝒕𝒂𝒅𝒂
𝑈𝑛𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑒𝑠 𝒂𝒄𝒐𝒕𝒂𝒅𝒂 𝑠𝑖 𝒆𝒙𝒊𝒔𝒕𝒆𝒏 𝒎 ∧ 𝑴 ∈ ℝ 𝑡𝑎𝑙 𝑞𝑢𝑒
𝑚 ≤ 𝑎𝑛 ≤ 𝑀 ∀𝑛 ∈ ℕ
𝑜 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑡𝑒𝑚𝑒𝑛𝑡𝑒 𝒆𝒙𝒊𝒔𝒕𝒆 𝒖𝒏 𝑴 ∈ ℝ 𝑡𝑎𝑙 𝑞𝑢𝑒
𝑎𝑛 ≤ 𝑀 ∀𝑛 ∈ ℕ
∗ 𝐿𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑒𝑠 𝒂𝒄𝒐𝒕𝒂𝒅𝒂 𝒊𝒏𝒇𝒆𝒓𝒊𝒐𝒓𝒎𝒆𝒏𝒕𝒆
𝑠𝑖 𝑦 𝑠𝑜𝑙𝑜 𝑠í 𝒆𝒙𝒊𝒔𝒕𝒆 𝒖𝒏 𝒎 ∈ ℝ tal que 𝒎 ≤ 𝒂𝒏 ∀𝒏 ∈ ℕ
∗ 𝐿𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑒𝑠 𝒂𝒄𝒐𝒕𝒂𝒅𝒂 𝒔𝒖𝒑𝒆𝒓𝒊𝒐𝒓𝒎𝒆𝒏𝒕𝒆
𝑠𝑖 𝑦 𝑠𝑜𝑙𝑜 𝑠𝑖 𝒆𝒙𝒊𝒔𝒕𝒆 𝒖𝒏 𝑴 ∈ ℝ tal que 𝒂𝒏 ≤ 𝑴 ∀𝒏 ∈ ℕ
𝐏𝐑𝐎𝐁𝐋𝐄𝐌𝐀𝐒 𝐑𝐄𝐒𝐔𝐄𝐋𝐓𝐎𝐒

Álgebra Límites

Uploaded by

Copyright:

Available Formats

Álgebra Límites

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Álgebra Límites

Uploaded by

Copyright:

Available Formats

SUCESIONES I

𝑆𝑒𝑎 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛 𝒂𝒏 𝒏∈ℤ+ 𝑜 𝑡𝑎𝑚𝑏𝑖é𝑛 𝒂𝒏 𝒏∈ℕ 𝑜 𝒂𝒏 𝒏≥𝟏

𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑎 𝑑𝑒 𝑚𝑎𝑛𝑒𝑟𝑎 𝑞𝑢𝑒 𝒂𝒏 = 𝒇 𝒏 𝑝𝑎𝑟𝑎 𝑡𝑜𝑑𝑜 𝑛 ∈ ℤ+

𝒂𝒏+𝒌 = 𝒇 𝒂𝒏 ; 𝒂𝒏+𝟏 ; 𝒂𝒏+𝟐 ; … ; 𝒂𝒏+𝒌−𝟏 𝒑𝒂𝒓𝒂 𝒕𝒐𝒅𝒐 𝒏 ∈ ℤ+

𝐴𝑝𝑙𝑖𝑐𝑎𝑛𝑑𝑜 𝑙𝑎 𝑟𝑒𝑔𝑙𝑎 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎 𝑝𝑎𝑟𝑎 𝑛 = 1 𝑎3 = 𝑎2 + 𝑎1 → 𝒂𝟑 = 𝟏 + 𝟏 = 𝟐

𝐴𝑝𝑙𝑖𝑐𝑎𝑛𝑑𝑜 𝑙𝑎 𝑟𝑒𝑔𝑙𝑎 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎 𝑝𝑎𝑟𝑎 𝑛 = 2 𝑎4 = 𝑎3 + 𝑎2 → 𝒂𝟒 = 𝟐 + 𝟏 = 𝟑

𝐸𝑠 𝑑𝑒𝑐𝑖𝑟: 𝑎𝑛 𝑛∈ℤ+ = 1; 1; 2; 3; 5; 8; 13; …

𝐿𝑎 𝑐𝑢𝑎𝑙 𝑒𝑠 𝑐𝑜𝑛𝑜𝑐𝑖𝑑𝑎 𝑐𝑜𝑚𝑜 𝑙𝑎 𝑺𝑼𝑪𝑬𝑺𝑰Ó𝑵 𝑫𝑬 𝑭𝑰𝑩𝑶𝑵𝑨𝑪𝑪𝑰

𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ 𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑎 𝑑𝑒 𝑙𝑎 𝑠𝑖𝑔𝑢𝑖𝑒𝑛𝑡𝑒 𝑓𝑜𝑟𝑚𝑎: 𝑎𝑛+1 = 𝑎𝑛 + 𝑟 ∧ 𝑎1 = 𝑎 (𝑟 ≠ 0)

𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ 𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑎 𝑑𝑒 𝑙𝑎 𝑠𝑖𝑔𝑢𝑖𝑒𝑛𝑡𝑒 𝑓𝑜𝑟𝑚𝑎: 𝑎𝑛+1 = 𝑎𝑛 . 𝑟 ∧ 𝑎1 = 𝑎 (𝑟 ≠ 0)

𝑎2 = 𝑎1 . 2 → 𝑎2 = 5.2 = 10 𝐸𝑠 𝑑𝑒𝑐𝑖𝑟: 𝑎𝑛 𝑛∈ℤ+ = 5; 10; 20; 40; …

𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑎𝑛 𝑛∈ℤ+ 𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑎 𝑑𝑒 𝑙𝑎 𝑠𝑖𝑔𝑢𝑖𝑒𝑛𝑡𝑒 𝑓𝑜𝑟𝑚𝑎:

12 18 24 𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑐𝑜𝑛 𝑑𝑖𝑓𝑒𝑟𝑒𝑛𝑐𝑖𝑎𝑠 𝑓𝑖𝑛𝑖𝑡𝑎𝑠 𝑑𝑒 𝟑𝒆𝒓 𝒐𝒓𝒅𝒆𝒏

𝑎4 = 1𝐶03 + 8𝐶13 + 12𝐶23 + 6𝐶33 𝑎5 = 1𝐶04 + 8𝐶14 + 12𝐶24 + 6𝐶34

𝑛−1 𝑛−2 𝑛−1 𝑛−2 𝑛−3

𝑛ú𝑚𝑒𝑟𝑜 𝑛𝑎𝑡𝑢𝑟𝑎𝑙, 𝑢𝑛 ú𝒏𝒊𝒄𝒐 𝒏ú𝒎𝒆𝒓𝒐 𝒓𝒆𝒂𝒍 𝑝𝑒𝑟𝑓𝑒𝑐𝑡𝑎𝑚𝑒𝑛𝑡𝑒 𝑑𝑒𝑓𝑖𝑛𝑖𝑑𝑜 𝑐𝑜𝑚𝑜 𝒂𝒏 𝑑𝑜𝑛𝑑𝑒 n ∈ ℕ

𝑑𝑜𝑛𝑑𝑒 𝒂𝒏 𝑠𝑒𝑟á 𝑒𝑙 𝒕é𝒓𝒎𝒊𝒏𝒐 𝒅𝒆 𝒍𝒖𝒈𝒂𝒓 𝒏 𝑒𝑛 𝑙𝑎 𝑠𝑢𝑐𝑒𝑠𝑖ó𝑛

𝐴𝑑𝑒𝑚á𝑠 𝑠𝑒 𝑒𝑠𝑐𝑟𝑖𝑏𝑒: 𝒂𝟏 , 𝒂𝟐 , 𝒂𝟑 , … , 𝒂𝒏 , … 𝒐 𝒂𝒏 𝒏∈ℕ 𝑜 𝑠𝑖𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡𝑒 𝒂𝒏

𝑆𝑢𝑐𝑒𝑠𝑖ó𝑛 𝑐𝑟𝑒𝑐𝑖𝑒𝑛𝑡𝑒: ∀𝑛 ∈ ℕ 𝑎𝑛+1 > 𝑎𝑛

You might also like