‫ﺭﻭﺍﺑﻂ ﺑﺎﺯﮔﺸﺘﻲ‬

‫ﺭﻭﺍﺑﻂ ﺑﺎﺯﮔﺸﺘﻲ ﺍﻭﻟﻴﻪ‪:‬‬

‫ﺁﻧﭽﻪ ﺩﺭ ﻣﺒﺎﺣﺚ ﻗﺒﻞ ﺩﺭﺑﺎﺭﺓ ﺩﻧﺒﺎﻟﻪﻫﺎ ﺧﻮﺍﻧﺪﻳﻢ‪ ،‬ﺩﺭ ﺣﻘﻴﻘﺖ ﺣﺎﻟﺖ ﺧﺎﺻﻲ ﺍﺯ ﺭﻭﺍﺑﻂ ﺑﺎﺯﮔـﺸﺘﻲ ﺑـﻪ ﺷـﻤﺎﺭ‬

‫ﻣﻲﺁﻳﺪ‪.‬‬

‫ﻫﻤﺎﻥ ﻃﻮﺭ ﻛﻪ ﭘﻴﺸﺎﭘﻴﺶ ﮔﻔﺘﻪ ﺷﺪ ﺭﺍﺑﻄﻪﺍﻱ ﺭﺍ ﺑﺎﺯﮔﺸﺘﻲ ﻣﻲﻧﺎﻣﻴﻢ ﻛﻪ ﺩﺭ ﺁﻥ ﺑﺮﺍﻱ ﻣﺤﺎﺳﺒﺔ ﻫﺮ ﻋﻨﺼﺮ ﻧﻴﺎﺯ‬

‫ﺑﻪ ﻣﻘﺎﺩﻳﺮ ﺗﻌﺪﺍﺩﻱ ﺍﺯ ﻋﻨﺎﺻﺮ ﻗﺒﻠﻲ ﺁﻥ ﺩﺍﺷﺘﻪ ﺑﺎﺷﻴﻢ ﻭ ﺑﺮﺍﺳﺎﺱ ﺁﻧﻬﺎ ﺑﻴﺎﻥ ﺷﺪﻩ ﺑﺎﺷﺪ‪.‬‬

‫ﻧﻘﻄﺔ ﻣﻘﺎﺑﻞ ﺭﺍﺑﻄﺔ ﺑﺎﺯﮔﺸﺘﻲ ﺭﺍﺑﻄﺔ ﺻﺮﻳﺢ ﻣﻲﺑﺎﺷﺪ ﻛﻪ ﺩﺭ ﺁﻥ ﺑﺎ ﺩﺍﻧﺴﺘﻦ ﺷﻤﺎﺭﺓ ﻋﻨﺼﺮ ﻣﺴﺘﻘﻴﻤﺎﹰ ﻣﻘﺪﺍﺭ ﺁﻥ‬

‫ﺗﻮﺳﻂ ﺗﺎﺑﻊ ﺻﺮﻳﺢ ﺁﻥ ﭘﻴﺪﺍ ﻣﻲﮔﺮﺩﺩ‪.‬‬

‫ﺭﺍﺑﻄﻪ ﺑﺎﺯﮔﺸﺘﻲ ﺭﺍ ﺑﻪ ﺻﻮﺭﺕ ﻛﻠﻲ ﺑﻪ ﺻﻮﺭﺕ‬

‫)‪u n = F (u n −1 ,u n − 2 ,L‬‬

‫ﺑﻴﺎﻥ ﻣﻲﻛﻨﻨﺪ )ﺍﮔﺮ ‪ ui‬ﻫﺎ ﻋﻨﺎﺻﺮ ﺩﻧﺒﺎﻟﺔ ﻣﺰﺑﻮﺭ ﺑﺎﺷﻨﺪ(‪.‬‬

‫ﺭﺍﺑﻄﻪ ﺑﺎﺯﮔﺸﺘﻲ ﻣﺮﺗﺒﺔ ‪:2‬‬

‫ﺑﻪ ﺭﺍﺑﻄﻪﺍﻱ ﺑﻪ ﺻﻮﺭﺕ‪:‬‬

‫‪x n = px n −1 + qx n − 2‬‬ ‫) ‪(q ≠ 0‬‬ ‫‪, p ∈Q‬‬

‫ﺭﺍﺑﻄﺔ ﺑﺎﺯﮔﺸﺘﻲ ﺍﺯ ﻣﺮﺗﺒﺔ ‪ 2‬ﻣﻲﮔﻮﻳﻨﺪ‪.‬‬

‫ﺩﻗﺖ ﻛﻨﻴﺪ ‪ p‬ﻭ ‪ q‬ﺿﺮﺍﻳﺐ ﺛﺎﺑﺖ ﺩﺭ ﺍﻳﻦ ﺭﺍﺑﻄﻪ ﻣﻲﺑﺎﺷﻨﺪ ﻭ ﺍﮔﺮ ﭼﻪ ‪ q ≠ 0‬ﺍﺳﺖ ﻭﻟﻲ ﺍﮔﺮ ‪ q‬ﺭﺍ ﻣﺴﺎﻭﻱ ﺻﻔﺮ‬

‫ﺑﮕﻴﺮﻳﻢ ﺩﻧﺒﺎﻟﻪ ﺑﻪ ﻳﻚ ﺗﺼﺎﻋﺪ ﻫﻨﺪﺳﻲ ﺗﺒﺪﻳﻞ ﻣﻲﺷﻮﺩ‪.‬‬

‫ﺑﻪ ﻃﻮﺭ ﻛﻠﻲ ﻳﻚ ﺭﺍﻩ ﺑﺮﺍﻱ ﭘﻴﺪﺍﻛﺮﺩﻥ ﺟﻮﺍﺏ ﺻﺮﻳﺢ ﻣﻌﺎﺩﻻﺕ ﺑﺎﺯﮔـﺸﺘﻲ ﻛـﻪ ﺁﻥ ﺭﺍ »ﺣـﻞ ﻛـﺮﺩﻥ ﺭﺍﺑﻄـﺔ‬

‫ﺑﺎﺯﮔﺸﺘﻲ« ﻣﻲﻧﺎﻣﻨﺪ‪ ،‬ﻧﺨﺴﺖ ﺣﺪﺱﺯﺩﻥ ﻓﺮﻡ ﺟﻮﺍﺏ ‪ xn‬ﺍﺳﺖ‪.‬‬

‫‪n‬‬
‫‪ xn = λ‬ﺭﺍ ﺩﺭ ﻧﻈﺮ ﻣﻲﮔﻴـﺮﻳﻢ ﻭ‬ ‫ﺩﺭ ﺍﻳﻦ ﺳﻮﺍﻝ ﺑﺪﻭﻥ ﺁﻧﻜﻪ ﺑﻪ ﺷﻤﺎ ﺑﮕﻮﻳﻢ ﭼﮕﻮﻧﻪ ﻭ ﭼﺮﺍ ﺟﻮﺍﺑﻲ ﺑﻪ ﺷﻜﻞ‬

‫ﺳﻌﻲ ﻣﻲﻛﻨﻴﻢ ‪ λ‬ﻣﻨﺎﺳﺐ ﺭﺍ ﺑﻴﺎﺑﻴﻢ ﺗﺎ ﺩﺭ ﺭﺍﺑﻄﺔ‬

‫‪xn = p xn −1 + q xn − 2‬‬

‫ﺻﺪﻕ ﻛﻨﺪ‪.‬‬

‫ﺍﮔﺮ ‪ λ‬ﺻﺪﻕ ﻛﻨﺪ ﺧﻮﺍﻫﻴﻢ ﺩﺍﺷﺖ‪:‬‬

‫‪λ n = p λ n −1 + q λ n −2‬‬

‫‪⇒ λ2 = p λ +q‬‬

‫‪⇒ λ2 − p λ −q = 0‬‬

‫ﺍﻳﻦ ﻣﻌﺎﺩﻟﻪ ﺭﺍ ﻣﻌﺎﺩﻟﺔ ﻣﺸﺨﺼﺔ ﺁﻥ ﺭﺍﺑﻄﻪ ﻣﻲﻧﺎﻣﻴﻢ‪.‬‬

‫∆ ‪−b ±‬‬
‫= ‪⇒ λ1 , λ2‬‬
‫‪2a‬‬

‫ﻛﻪ ﺻﺮﻑﻧﻈﺮ ﺍﺯ ﻣﺤﺎﺳﺒﺔ ‪ λ1‬ﻭ ‪ λ2‬ﺧﻮﺍﻫﻴﻢ ﺩﺍﺷﺖ‪:‬‬

‫‪x n = u λ1n + v λ2n‬‬

 ‫ﺁﻧﭽﻪ ﺗﺎﻛﻨﻮﻥ ﺁﻣﺪ ﺍﺳﺎﺱ ﺣﻞ ﺭﻭﺍﺑﻂ ﺑﺎﺯﮔﺸﺘﻲ ﻫﻤﮕﻦ ﻭ ﻧﺎﻫﻤﮕﻦ ﺧﻮﺍﻫﺪ ﺑﻮﺩ‪.‬‬

‫ﻧﻜﺘﻪ‪ .‬ﺍﮔﺮ ‪ λ1 = λ2‬ﺑﺎﺷﺪ )ﺭﻳﺸﺔ ﻣﻀﺎﻋﻒ( ﺁﻧﮕﺎﻩ ﻣﻌﺎﺩﻟﻪ ﺁﻳﺎ ﺑﻪ ﺻﻮﺭﺕ‬

‫‪x n = a λ1n + b λ2n = ( a + b ) λ1n‬‬

‫ﺩﺭ ﺧﻮﺍﻫﺪ ﺁﻣﺪ؟‬

‫ﺧﻴﺮ‪ .‬ﺩﺭ ﺍﻳﻦ ﺻﻮﺭﺕ ﺟﻮﺍﺏ ﺻﺮﻳﺢ ﻣﻌﺎﺩﻟﻪ ﺑﻪ ﺻﻮﺭﺕ ﺯﻳﺮ ﺧﻮﺍﻫﺪ ﺑﻮﺩ‪.‬‬

‫‪x n = (a + b n ) λ n‬‬

‫ﺩﺭ ﺭﺍﺑﻄﺔ ﻧﻬﺎﻳﻲ ﮔﻔﺘﻪ ﺷﺪﻩ ﻫﻤﺎﻥ ﻃﻮﺭ ﻛﻪ ﺩﻳﺪﻩ ﻣﻲﺷﻮﺩ ﻛﻤﺎﻛﺎﻥ ‪ a‬ﻭ‪ b‬ﻣﺠﻬﻮﻝﺍﻧﺪ ﻛﻪ ﺑﺎ ﻣﻘﺪﺍﺭﻫﺎﻱ ﺍﻭﻟﻴـﺔ‬

‫‪ ، xn‬ﻣﻲﺗﻮﺍﻥ ﺁﻧﻬﺎ ﺭﺍ ﭘﻴﺪﺍ ﻛﺮﺩ‪.‬‬

‫ﻣﺜﺎﻝ‪ .‬ﺩﺍﺭﻳﻢ‬

‫‪x n = 2x n −1 − x n − 2‬‬
‫‪‬‬
‫‪‬‬
‫‪x o = x1 = 1‬‬

‫ﻣﻌﺎﺩﻟﻪ ﺭﺍ ﺣﻞ ﻛﻨﻴﺪ‪.‬‬

‫ﺣﻞ‪.‬‬
‫‪x n = λn‬‬

‫‪⇒ λ n = 2λ n −1 + λ n − 2‬‬

‫‪⇒ λ 2 = 2λ + 1‬‬

‫‪⇒ λ 2 − 2λ − 1 = 0‬‬

‫‪2± 8‬‬
‫= ‪⇒λ‬‬ ‫‪= 1± 2‬‬
‫‪2‬‬

‫(‬ ‫)‬ ‫(‬ ‫)‬

‫‪n‬‬ ‫‪n‬‬
‫‪⇒ x n = a 1+ 2‬‬ ‫‪+b 1− 2‬‬

‫‪‬‬
‫(‬ ‫)‬ ‫(‬ ‫)‬
‫‪o‬‬ ‫‪o‬‬
‫‪‬‬ ‫‪x‬‬ ‫‪o‬‬ ‫=‬ ‫‪a‬‬ ‫‪1‬‬ ‫‪+‬‬ ‫‪2‬‬ ‫‪+‬‬ ‫‪b‬‬ ‫‪1‬‬ ‫‪−‬‬ ‫‪2‬‬ ‫‪= a +b‬‬
‫‪‬‬
‫‪‬‬
‫(‬ ‫)‬ ‫(‬ ‫)‬
‫‪1‬‬ ‫‪1‬‬
‫‪x1 = a 1 + 2 + b 1 − 2 = a + b + (a − b ) 2‬‬

‫‪a + b = 1‬‬
‫‪‬‬
‫‪⇒‬‬
‫‪a + b + (a − b ) 2 = 0‬‬

‫ﻛﻪ ﺑﺎ ﺣﻞ ﺍﻳﻦ ﺩﺳﺘﮕﺎﻩ ‪ a‬ﻭ ‪ b‬ﺑﺪﺳﺖ ﺁﻣﺪﻩ ﻭ ﺩﺭ ﻧﺘﻴﺠﻪ ﺭﺍﺑﻄﺔ ﺻﺮﻳﺢ ﻧﻴﺰ ﺣﺴﺎﺏ ﺧﻮﺍﻫﺪ ﺷﺪ‪.‬‬

‫ﻗﺒﻞ ﺍﺯ ﺁﻧﻜﻪ ﺑﻴﺸﺘﺮ ﻭﺍﺭﺩ ﺟﺰﺋﻴﺎﺕ ﺣﻞ ﺭﻭﺍﺑﻂ ﺑﺎﺯﮔﺸﺘﻲ ﺑﺸﻮﻳﻢ ﺑﻪ ﺳﺮﺍﻍ ﺭﻭﺍﺑـﻂ ﺑﺎﺯﮔـﺸﺘﻲ ﺳـﺎﺩﻩﺗـﺮ‬

‫ﻣﻲﺭﻭﻳﻢ‪.‬‬

‫ﻣﺜﺎﻝ‪ .‬ﺑﻪ ﭼﻨﺪ ﻃﺮﻳﻖ ﻣﻲﺗﻮﺍﻥ ﺻﻔﺤﻪﺍﻱ ‪ 2 * n‬ﺭﺍ ﺑﺎ ﻣﻮﺯﺍﻳﻴﻚﻫﺎﻱ ‪ 2 * 1‬ﻓﺮﺵ ﻛﺮﺩ؟‬

‫ﺣﻞ‪ .‬ﺍﻳﻦ ﻣﺴﺄﻟﻪ ﺑﺴﻴﺎﺭ ﺳﺎﺩﻩﺍﻱ ﺍﺳﺖ ﻛﻪ ﻣﻤﻜﻦ ﺍﺳﺖ ﺁﻥ ﺭﺍ ﺩﻳﺪﻩ ﺑﺎﺷﻴﺪ‪ .‬ﺍﮔﺮ ﺟـﺪﻭﻝ ‪ 2 * n‬ﺭﺍ ﺑﺘـﻮﺍﻥ ‪fn‬‬

‫ﺭﻭﺵ ﻣﺨﺘﻠﻒ ﺑﺎ ﻣﻮﺍﺯﻳﻴﻚ ﻫﺎﻱ ‪ 2 * n‬ﻓﺮﺵ ﻛﺮﺩ ﺑﻪ ﺭﺍﺣﺘﻲ ﻣﻲﺗﻮﺍﻥ ﺛﺎﺑﺖ ﻛﺮﺩ ﻛﻪ ‪ . fn= fn-1+ fn-2‬ﺑﻪ ﺍﻳﻦ ﺗﺮﺗﻴـﺐ‬
‫ﺍﮔﺮ ﺩﺭ ﺳﺘﻮﻥ ‪n‬ﺍﻡ ﺟﺪﻭﻝ ﻳﻚ ﻣﻮﺯﺍﻳﻴﻚ ‪ 2 * 1‬ﺑﻪ ﺻﻮﺭﺕ ﻋﻤﻮﺩﻱ ﮔﺬﺍﺷﺘﻪ ﺷﻮﺩ‪ ،‬ﺟﺪﻭﻟﻲ )‪ 2 * (n – 1‬ﻣﻲﻣﺎﻧﺪ ﻛﻪ‬

‫ﺑﺎﻳﺪ ﻣﻮﺯﺍﻳﻴﻚﻫﺎﻱ ‪ 2 * 1‬ﻓﺮﺵ ﺷﻮﺩ ﻛﻪ ﺑﻪ ‪ fn-1‬ﻃﺮﻳﻖ ﻣﻤﻜﻦ ﺍﺳﺖ‪ .‬ﺩﺭ ﻏﻴﺮ ﺍﻳﻦ ﺻﻮﺭﺕ ﺩﻭ ﺳﺘﻮﻥ ‪ n‬ﻭ ‪ n – 1‬ﺍﻡ ﺑﺎ‬

‫ﺩﻭ ﻣﻮﺯﺍﻳﻴﻚ ‪ 2 * 1‬ﺍﻓﻘﻲ ﭘﻮﺷﺎﻧﺪﻩ ﺷﺪﻩﺍﻧﺪ‪ .‬ﻛﻪ ﺟﺪﻭﻟﻲ )‪ 2 *( n-2‬ﻣﻲﻣﺎﻧﺪ ﻛﻪ ﺑﺎﻳﺪ ﺑﺎ ﻣﻮﺯﺍﻳﻴﻚﻫﺎﻱ ‪ 2 * 1‬ﻓﺮﺵ‬

‫ﺷﻮﺩ ﻛﻪ ﺑﻪ ‪ fn-2‬ﻃﺮﻳﻖ ﻣﻤﻜﻦ ﺍﺳﺖ‪ .‬ﭘﺲ ﺩﺭ ﻛﻞ ﺗﻌﺪﺍﺩ ﺭﻭﺵﻫﺎﻱ ﻓﺮﺵ ﻛﺮﺩﻥ ﺟﺪﻭﻝ ‪ 2 * n‬ﺑﺎ ﻣﻮﺯﺍﻳﻴﻚﻫﺎﻱ ‪* 1‬‬

‫‪ 2‬ﺑﺮﺍﺑﺮ ﺍﺳﺖ ﺑﺎ ‪ ، fn-1+ fn-2‬ﻳﻌﻨﻲ ‪ . fn = fn-1+ fn-2‬ﺍﻳﻦ ﺭﺍﺑﻄﻪ‪ ،‬ﺩﻧﺒﺎﻟﺔ ﻣﻌﺮﻭﻓﻲ ﺭﺍ ﻣﺸﺨﺺ ﻣﻲﻛﻨﺪ ﻛﻪ ﺑﺎ ﻣﻘﺎﺩﻳﺮ ﺍﻭﻟﻴﺔ‬

‫‪ fo = o‬ﻭ ‪ f1 = 1‬ﺩﻧﺒﺎﻟﺔ ﻓﻴﺒﻮﻧﺎﭼﻲ ﻧﺎﻡ ﺩﺍﺭﺩ‪.‬‬

‫ﺩﻗﺖ ﻣﻲﻛﻨﻴﻢ ﻛﻪ ﺭﺍﺑﻄﺔ ‪ fn = fn-1+ fn-2‬ﻫﺮ ﻋﻀﻮ ﺩﻧﺒﺎﻟﻪ ﺭﺍ ﺑﺮ ﺣﺴﺐ ﺍﻋﻀﺎﻱ ﻗﺒﻠﻲ ﺑﻴﺎﻥ ﻣﻲﻛﻨﺪ‪ ،‬ﻣﺜﻼﹰ ﺑﺮﺍﻱ‬

‫ﭘﻴﺪﺍ ﻛﺮﺩﻥ ‪ f2‬ﻣﻲﺗﻮﺍﻥ ﺍﺯ ﺭﺍﺑﻄﻪ ‪ f2 = f0+ f1‬ﺍﺳﺘﻔﺎﺩﻩ ﻛﺮﺩ ﻭ ﺑﻪ ﺩﺳﺖ ﺁﻭﺭﺩ‪ .f2 = 0 + 1 = 1 :‬ﺣـﺎﻝ ﺑـﻪ ﻫﻤـﻴﻦ‬

‫ﺗﺮﺗﻴﺐ ﺑﺎ ﺟﻤﻊ ‪ f1‬ﻭ ‪ f2‬ﻣﻲﺗﻮﺍﻥ ‪ f3‬ﺭﺍ ﺑﻪ ﺩﺳﺖ ﺁﻭﺭﺩ‪ .‬ﺿﻤﻨﺎﹰ ﺑﺮﺍﻱ ﺳﺎﺧﺘﻦ ﺩﻧﺒﺎﻟﻪ ﺑﺎﻳﺪ ﺩﻭ ﻋـﻀﻮ ﺍﻭﻝ ﺁﻥ ﺭﺍ ﺩﺍﺷـﺘﻪ‬

‫ﺑﺎﺷﻴﻢ ﺗﺎ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺁﻧﻬﺎ ‪ f2‬ﻭ ‪ f3‬ﻭ ﻫﻤﻴﻦ ﻃﻮﺭ ﺗﺎ ‪ fn‬ﻣﺸﺨﺺ ﺻﻮﻧﺪ‪ .‬ﺣﻞ ﺭﺍﺑﻄﺔ ﺑﺎﺯﮔﺸﺘﻲ ﺑﻪ ﺍﻳﻦ ﻣﻌﻨﺎﺳﺖ ﻛﻪ ﻣﺎ‬

‫ﻫﺮ ﻋﻀﻮ ﺩﻧﺒﺎﻟﺔ ‪ fn‬ﺭﺍ ﺑﺪﻭﻥ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺍﻋﻀﺎﻱ ﻗﺒﻠﻲ ﻭ ﻣﺴﺘﻘﻞ ﺍﺯ ﺁﻥ ﺍﻋﻀﺎ ﺑﻴﺎﻥ ﻛﻨﻴﻢ‪،‬‬

‫ﻣﺜﺎﻝ‪ n .‬ﺳﻜﺔ ﻳﻜﺴﺎﻥ ‪ 50‬ﺗﻮﻣﺎﻧﻲ ﺩﺍﺭﻳﻢ‪ .‬ﻓﺮﺽ ﻣﻲﻛﻨﻴﻢ ‪ xn‬ﺗﻌﺪﺍﺩ ﺭﻭﺵﻫﺎﻳﻲ ﺑﺎﺷﺪ ﻛﻪ ﺍﻳﻦ ‪ n‬ﺳـﻜﻪ ﺭﺍ ﺩﺭ‬

‫ﺩﻭ ﺭﺩﻳﻒ ﺍﻓﻘﻲ ﺭﻭﻱ ﻫﻢ ﭼﻨﺎﻥ ﻣﺮﺗﺐ ﻛﻨﻴﻢ ﻛﻪ ﻫﺮ ﺳﻜﺔ ﺩﺭ ﺭﺩﻳﻒ ﺑﺎﻻ‪ ،‬ﺩﻗﻴﻘﺎﹰ ﺩﺭ ﺯﻳﺮ ﺁﻥ ﻗﺮﺍﺭ ﮔﺮﻓﺘﻪ ﺑﺎﺷﻨﺪ‪.‬‬

‫ﻣﺎﻧﻨﺪ‪:‬‬

‫ﺑﺮﺍﻱ ﻣﺤﺎﺳﺒﺔ ‪ xn‬ﺭﺍﺑﻄﻪ ﺑﺎﺯﮔﺸﺘﻲ ﺑﺪﺳﺖ ﺁﻭﺭﻳﺪ‪.‬‬

‫ﺣﻞ‪ .‬ﺩﺭ ﺭﺩﻳﻒ ﭘﺎﺋﻴﻦ ﺳﻤﺖ ﭼﭗﺗﺮﻳﻦ ﺳﻜﻪ ﺭﺍ ﺍﮔﺮ ﺩﺭ ﻧﻈﺮ ﺑﮕﻴﺮﻳﻢ‪ ،‬ﺩﻭ ﺣﺎﻟﺖ ﺩﺍﺭﻳﻢ‪ .‬ﻳﺎ ﺑﺎﻻ ﻭ ﺳﻤﺖ ﺭﺍﺳـﺖ‬
‫ﺁﻥ ﺳﻜﻪﺍﻱ ﻗﺮﺍﺭ ﺩﺍﺭﺩ ﻳﺎ ﻧﻪ‪ ،‬ﻛﻪ ﺍﮔﺮ ﻗﺮﺍﺭ ﺩﺍﺷﺘﻪ ﺑﺎﺷﺪ‪ ،‬ﺑﺠﺰ ﺍﻳﻦ ﺩﻭ ﺳﻜﻪ ‪ n – 2‬ﺳﻜﺔ ﺩﻳﮕﺮ ﻗﺮﺍﺭ ﺩﺍﺭﻧﺪ ﻛﻪ ﻣﺴﺘﻘﻼﹰ‬

‫ﺑﻪ ‪ xn-2‬ﻃﺮﻳﻖ ﻣﻲﺗﻮﺍﻧﻨﺪ ﭼﻴﺪﻩ ﺷﻮﻧﺪ ﻭ ﺍﮔﺮ ﻗﺮﺍﺭ ﻧﺪﺍﺷﺘﻪ ﺑﺎﺷﺪ‪ n – 1 ،‬ﺳﻜﻪ ﺩﺭﺳﻤﺖ ﺭﺍﺳﺖ ﺁﻥ ﻣﺴﺘﻘﻼﹰ ﺑـﻪ ‪xn-1‬‬

‫ﻃﺮﻳﻖ ﻣﻲﺗﻮﺍﻧﻨﺪ ﭼﻴﺪﻩ ﺷﻮﻧﺪ‪.‬‬

‫‪xn = xn-1 + xn-2‬‬ ‫ﻳﻌﻨﻲ‬

‫ﻛﻪ ﺍﻳﻦ ﺭﺍﺑﻄﻪ ﻫﻤﺎﻥ ﺭﺍﺑﻄﺔ ﺑﺎﺯﮔﺸﺘﻲ ﻓﻴﺒﻮﻧﺎﭼﻲ ﺍﺳﺖ ﻛﻪ ﺑﻌﺪﺍﹰ ﺑﻴﺸﺘﺮ ﺑﻪ ﺁﻥ ﺧﻮﺍﻫﻴﻢ ﭘﺮﺩﺍﺧـﺖ‪ .‬ﺿـﻤﻨﺎﹰ ﺩﺭ‬

‫ﻣﺜﺎﻝ ﺑﺎﻻ‬

‫‪x1 = 1‬‬

‫‪x2 = 1‬‬

‫ﻣﺜﺎﻝ‪ .‬ﻣﻄﻠﻮﺏ ﺍﺳﺖ ﺗﻌﻴﻴﻦ ﺭﺍﺑﻄﺔ ﺑﺎﺯﮔﺸﺘﻲ ﺑﺮﺍﻱ ﺗﻌﺪﺍﺩ ﺩﻧﺒﺎﻟﻪﻫﺎﻱ ﺻﻔﺮ ﻭ ﻳﻚ ﺑﻪ ﻃﻮﻝ ‪ n‬ﻛﻪ ﻫﻴﭻ ﺩﻭ ﺻﻔﺮ‬

‫ﻣﺘﻮﺍﻟﻲ ﻧﺪﺍﺭﻧﺪ‪.‬‬

‫ﺣﻞ‪ .‬ﻣﻲﺧﻮﺍﻫﻴﻢ ﺭﺍﺑﻄﻪ ﺑﺎﺯﮔﺸﺘﻲ ﻣﻨﺎﺳﺐ ﺑﺮﺍﻱ ﺁﻥ ﺑﺪﺳﺖ ﺁﻭﺭﻳﻢ‬

‫ﻓﻜﺮ ﻣﻲﻛﻨﻴﺪ ﺍﻳﻦ ﺑﺎﺭ ﺑﺎﻳﺪ ﭼﮕﻮﻧﻪ ﺑﺸﻤﺎﺭﻳﻢ‪.‬‬

‫ﻫﻤﺎﻥﻃﻮﺭ ﻛﻪ ﺗﺎﻛﻨﻮﻥ ﺗﺠﺮﺑﻪ ﻛﺴﺐ ﻛﺮﺩﻩﺍﻳﺪ‪ ،‬ﺑﺎﻳﺪ ﺑﻪ ﻧﺤﻮﻱ ﺳﺎﻳﺮ ﻣﺴﺌﻠﻪ ﺭﺍ ﺑـﺎ ﺣـﺬﻑ ﺗﻌـﺪﺍﺩﻱ ﻋﻨﺎﺻـﺮ‬

‫ﻛﻮﭼﻜﺘﺮ ﻛﺮﺩ‪ .‬ﺩﺭ ﺍﻳﻦ ﻣﺜﺎﻝ ﻧﻴﺰ ﺳﻤﺖ ﭼﭗﺗﺮﻳﻦ ﻋﺪﺩ ﺭﺍ ﺩﺭ ﻧﻈﺮ ﻣﻲﮔﻴﺮﻳﻢ‪.‬‬

‫ﺍﮔﺮ ﺟﻮﺍﺏ ﻣﺴﺌﻠﻪ ﺭﺍ ‪ sn‬ﺑﮕﻴﺮﻳﻢ ﺩﺍﺭﻳﻢ‪:‬‬

‫‪1−‬‬ ‫‪−‬‬ ‫‪−‬‬ ‫‪−‬‬ ‫‪− ...‬‬ ‫‪−‬‬

‫‪n −1‬‬
 ‫‪01 −‬‬ ‫‪−‬‬ ‫‪−‬‬ ‫‪−‬‬ ‫‪− ...‬‬ ‫‪−‬‬
‫‪n −2‬‬

‫ﺍﮔﺮ ‪ 1‬ﺑﺎﺷﺪ‪ ،‬ﺁﻧﮕﺎﻩ ‪ n – 1‬ﺭﻗﻢ ﺳﻤﺖ ﺭﺍﺳﺖ ﺁﻥ ﻣﺴﺘﻘﻼﹰ ﺑﻪ ‪ sn – 1‬ﻃﺮﻳﻖ ﻣﻲﺗﻮﺍﻧﻨﺪ ﺑﻨﺸﻴﻨﻨﺪ ﻭ ﺍﮔـﺮ ﺻـﻔﺮ‬

‫ﺑﺎﺷﺪ ﺁﻧﮕﺎﻩ ﺍﻟﺰﺍﻣﺎﹰ ﺭﻗﻢ ﺩﻭﻡ ﻳﻚ ﻣﻲﺑﺎﺷﺪ )ﭼﺮﺍ؟(‬

‫ﭘﺲ ‪ n – 2‬ﺭﻗﻢ ﺑﺎﻗﻴﻤﺎﻧﺪﻩ ﻣﺴﺘﻘﻼﹰ ﺑﻪ ‪ Sn – 2‬ﻃﺮﻳﻖ ﻣﻲﺗﻮﺍﻧﻨﺪ ﻣﻘﺎﺩﻳﺮ ﺑﭙﺰﻳﺮﻧﺪ‪ .‬ﭘﺲ ﺩﺭ ﻛﻞ ﺩﺍﺭﻳﻢ‬

‫‪Sn = Sn – 1 + Sn-2‬‬

‫ﻭ ﭼﻪ ﺯﻳﺒﺎ ﻛﻪ ﺩﻭﺑﺎﺭﻩ ﺑﻪ ﺭﺍﺑﻄﺔ ﺑﺎﺯﮔﺸﺘﻲ ﻓﻴﺒﻮﻧﺎﭼﻲ ﺭﺳﻴﺪﻳﻢ‬

‫‪S1 = 2‬‬ ‫‪0,1‬‬

‫‪S2 = 3‬‬ ‫‪11 , 10 , 01‬‬

‫ﻭﻟﻴﻜﻦ ﺍﻳﻦﺑﺎﺭ ﻋﻨﺎﺻﺮ ﺷﺮﻭﻉ ﺑﺎ ﻣﻘﺎﺩﻳﺮ ﺭﺍﺑﻄﻪ ﻓﻴﺒﻮﻧﺎﭼﻲ ﺗﻔﺎﻭﺕ ﺩﺍﺭﻧﺪ‪.‬‬

‫ﺭﺍﺑﻄﺔ ﻓﻴﺒﻮﻧﺎﭼﻲ ﺑﻪ ﻫﻤﻴﻦ ﺟﺎ ﺧﺘﻢ ﻧﻤﻲﺷﻮﺩ؛ ﺑﻪ ﻃﻮﺭ ﻛﻠﻲ ﺩﺭ ﻣﺒﺤﺚ ﮔﺴﺴﺘﻪ ﺍﻳﻦ ﺭﺍﺑﻄﻪ ﺑﻪ ﺩﻓﻌﺎﺕ ﻇـﺎﻫﺮ‬

‫ﻣﻲﺷﻮﺩ‪.‬‬

‫ﻣﺜﺎﻝ‪ .‬ﺩﺭ ﺟﺰﻳﺮﻩﺍﻱ ﺗﻌﺪﺍﺩﻱ ﺧﺮﮔﻮﺵ ﺩﺍﺭﻳﻢ‪ .‬ﺍﮔﺮ ‪ Sn‬ﺭﺍ ﺗﻌﺪﺍﺩ ﺧﺮﮔﻮﺵﻫﺎ ﺩﺭ ﺳﺎﻝ ‪ n‬ﺑﮕﻴﺮﻳﻢ‪ ،‬ﺩﺭ ﻫﺮ ﺳـﺎﻝ‬

‫ﺧﺮﮔﻮﺵ ﻫﺎﻱ ﺑﺎﻟﻎ ﺟﻔﺖﮔﻴﺮﻱ ﻛﺮﺩﻩ ﻭ ﺑﻪ ﺍﺯﺍﻱ ﻫﺮ ﺧﺮﮔﻮﺵ ﺑﺎﻟﻎ ﻳﻚ ﻧﻮﺯﺍﺩ ﺧﺮﮔﻮﺵ ﺑﻪ ﺩﻧﻴﺎ ﻣﻲﺁﻳﺪ‪ .‬ﻧﻮﺯﺍﺩﺍﻥ ﻧﻴـﺰ‬

‫ﻳﻚ ﺳﺎﻝ ﻃﻮﻝ ﻣﻲﻛﺸﺪ ﺗﺎ ﺑﻪ ﺳﻦ ﺑﻠﻮﻍ ﺑﺮﺳﻨﺪ‪ .‬ﺍﮔﺮ ﺩﺭ ﺳﺎﻝ ﺍﻭﻝ ﺗﻨﻬﺎ ﻳﻚ ﺟﻔﺖ ﺧﺮﮔﻮﺵ ﺑـﺎﻟﻎ ﺩﺍﺷـﺘﻪ ﺑﺎﺷـﻴﻢ‪،‬‬

‫ﺭﺍﺑﻄﺔ ‪ Sn‬ﺭﺍ ﺑﺪﺳﺖ ﺁﻭﺭﻳﺪ‪.‬‬

‫ﺣﻞ‪ .‬ﺗﻌﺪﺍﺩ ﺧﺮﮔﻮﺵﻫﺎﻱ ﺳﺎﻝ ‪ n‬ﺍﻡ ﺑﺮﺍﺑﺮ ﺍﺳﺖ ﺑﺎ ﺗﻌﺪﺍﺩ ﺧﺮﮔﻮﺵﻫﺎﻱ ﺳـﺎﻝ ﻗﺒـﻞ ﺁﻥ ﺑـﻪ ﻋـﻼﻭﺓ ﺗﻌـﺪﺍﺩ‬

‫ﺑﭽﻪﻫﺎﻳﻲ ﻛﻪ ﺑﻪ ﺗﺎﺯﮔﻲ ﺑﻪ ﺩﻧﻴﺎ ﺁﻣﺪﻩﺍﻧﺪ ﻛﻪ ﺍﻳﻦ ﺗﻌﺪﺍﺩ ﺑﺮﺍﺑﺮ ﺑﺎ ﺗﻌﺪﺍﺩ ﺧﺮﮔﻮﺵﻫﺎﻱ ﺑﺎﻟﻎ ﺳﺎﻝ ﻗﺒﻞ ﺑـﻮﺩﻩ ﻭ ﺁﻥ ﻫـﻢ‬

‫ﺑﺮﺍﺑﺮ ﺑﺎ ﻛﻞ ﺧﺮﮔﻮﺵﻫﺎﻱ ﺩﻭﺳﺎﻝ ﻗﺒﻞ ﺁﻥ ﻣﻲﺑﺎﺷﺪ ﻭ ﺍﻳﻦ ﻳﻌﻨﻲ‬

‫‪Sn = Sn -1 + Sn – 2‬‬

‫ﻭ ﭼﻪ ﺯﻳﺒﺎ ﻛﻪ ﺑﺎﺯﻫﻢ ﺑﻪ ﺭﺍﺑﻄﻪﺍﻱ ﻣﻌﺎﺩﻝ ﺑﺎ ﺭﺍﺑﻄﺔ ﻓﻴﺒﻮﻧﺎﭼﻲ ﻭﻟﻲ ﺑﺎ ﻣﻘﺎﺩﻳﺮ ﺍﻭﻟﻴﺔ ﻣﺘﻔﺎﻭﺕ ﺭﺳﻴﺪﻳﻢ‪.‬‬

‫‪S1 = 2‬‬

‫‪S2 = 4‬‬

‫ﭘﺲ ﺍﺯ ﺍﻳﻦ ﻫﻤﻪ ﻣﺜﺎﻝﻫﺎﻳﻲ ﻛﻪ ﺟﻮﺍﺏ ﺁﻧﻬﺎ ﻣﺸﺎﺑﻪ ﻓﻴﺒﻮﻧﺎﭼﻲ ﻣﻲﺑﻮﺩ ﺯﻣﺎﻥ ﺁﻥ ﺭﺳﻴﺪﻩ ﻛﻪ ﺳﻌﻲ ﻛﻨﻴﻢ ﺭﺍﺑﻄﻪ‬

‫ﻓﻴﺒﻮﻧﺎﭼﻲ ﺭﺍ ﺣﻞ ﻛﻨﻴﻢ‪.‬‬

‫ﺍﮔﺮ ﭼﻪ ﺑﻌﺪﺍﹰ ﺣﻞ ﺍﻳﻦ ﮔﻮﻧﻪ ﺭﻭﺍﺑﻂ ﺭﺍ ﻣﻔﺴﻼﹰ ﻣﻲﺧﻮﺍﻧﻴﻢ ﻭﻟﻴﻜﻦ ﺩﺍﺭﻳﻢ‪:‬‬

‫ﺑﻪ ﻃﻮﺭ ﻛﻠﻲ ﺟﻤﻠﺔ ‪ n‬ﺍﻡ ﻓﻴﺒﻮﻧﺎﭼﻲ ﺭﺍ ﺑﺎ ‪ F n‬ﻧﻤﺎﻳﺶ ﻣﻲﺩﻫﻨﺪ‬

‫‪Fn = Fn – 1 + Fn – 2‬‬

‫‪F1 = F2 = 1‬‬

‫ﻣﺎﻧﻨﺪ ﻗﺒﻞ ﺍﻳﻦ ﺑﺎﺭ ﻓﺮﺽ ﻣﻲﻛﻨﻴﻢ‬

‫‪ r‬ﺍﻋﺪﺍﺩ ﺛﺎﺑﺖ ‪F n = r n‬‬

⇒ r n = r n −1 + r n −2

⇒ r 2 = r +1

⇒ r 2 − r −1 = 0

 1+ 5
r1 =
 2
⇒ 
 1− 5
 r2 =
 2

⇒ Fn = a r1n + b r2n

n n
 1+ 5   1− 5 
⇒ Fn = a   + b  
 2   2 

  1+ 5   1− 5 
F1 = a   + b   = 1
  2   2 

⇒ 
  1+ 5 
o
1− 5 
o
Fo = a 
  2  + b  2  = 0
   

1 1
⇒ a= , b =−
5 5

 n n
1  1+ 5   1− 5  
⇒ Fn =   − 
5   2   2  
 

.‫ﺍﮔﺮ ﺍﺯ ﺣﻞ ﺍﻳﻦ ﺭﺍﺑﻄﻪ ﺑﺎﺯﮔﺸﺘﻲ ﺍﺣﺴﺎﺱ ﺧﻮﺑﻲ ﭘﻴﺪﺍ ﻧﻜﺮﺩﻳﺪ ﻧﮕﺮﺍﻥ ﻧﺒﺎﺷﻴﺪ‬

‫ »ﻭﻟـﻴﻜﻦ‬.‫ﺣﻞ ﻛﻠﻲ ﺍﻳﻦ ﻣﻌﺎﺩﻻﺕ ﺟﻠﻮﺗﺮ ﮔﻔﺘﻪ ﺧﻮﺍﻫﺪ ﺷﺪ ﻭ ﺍﻛﻨﻮﻥ ﺗﻨﻬﺎ ﺧﻮﺍﺳﺘﻢ ﺫﻫﻦ ﺷﻤﺎ ﺭﺍ ﺩﺭﮔﻴﺮ ﻛﻨﻢ‬
‫ﺧﺪﺍﻳﻴﺶ ﺣﺎﻝ ﻛﺮﺩﻳﺪ؟! ﺩﻳﺪﻳﺪ ﻓﻴﺒﻮﻧﺎﭼﻲ ﻫﻢ ﺭﺍﺑﻄﺔ ﺻﺮﻳﺢ ﺩﺍﺭﻩ ﺍﻭﻧﻢ ﺑﺎ ﺍﻳﻦ ﻫﻤﻪ ﺭﺍﺩﻳﻜﺎﻝ‪ ،‬ﺍﻭﻟﺶ ﻛﻪ ﺑﻪ ﺫﻫﻦ ﺁﺩﻡ‬

‫ﻧﻤﻲﺭﺳﻪ«‪.‬‬