‫ﺍﺻﻞ ﻧﺎﻭﺭﺩﺍﻳﻲ‬

‫ﺩﺭ ﺍﻳﻨﺠﺎ ﻳﮑﻲ ﺍﺯ ﺍﺳﺘﺮﺍﺗﮋﻱ ﻫﺎﻱ ﺳﻄﺢ ﺑﺎﻻ ﺩﺭ ﺣﻞ ﻣـﺴﺎﻳﻞ ﺭﺍ ﺗﻮﺿـﻴﺢ ﺧـﻮﺍﻫﻴﻢ ﺩﺍﺩ‪ .‬ﻣـﺴﺎﻳﻞ ﺍﻳـﻦ‬

‫ﻗﺴﻤﺖ ﺩﺭ ﻧﮕﺎﻩ ﺍﻭﻝ ﻣﺸﮑﻞ ﺑﻪ ﻧﻈﺮ ﻣﻲ ﺭﺳﻨﺪ ﺍﻣﺎ ﺑﺎ ﺣﻞ ﭼﻨﺪ ﻣﺜﺎﻝ‪ ،‬ﺭﻭﺵ ﮐﻠﻲ ﺣـﻞ ﻣـﺴﺎﻳﻞ ﺭﺍ ﺑـﻪ ﺩﺳـﺖ‬

‫ﺧﻮﺍﻫﻴﻢ ﺁﻭﺭﺩ ﻭ ﺧﻮﺍﻫﻴﺪ ﺩﻳﺪ ﮐﻪ ﮔﺎﻫﻲ ﺍﻭﻗﺎﺕ ﻣﺴﺎﻳﻠﻲ ﮐﻪ ﺻﻮﺭﺕ ﺁﻧﻬﺎ ﺑﺴﻴﺎﺭ ﭘﻴﭽﻴﺪﻩ ﺍﺳﺖ‪ ،‬ﭼﻪ ﺑﺎﻃﻦ ﺳـﺎﺩﻩ‬

‫ﺍﻱ ﺩﺍﺭﻧﺪ‪ .‬ﺩﺭ ﺣﻘﻴﻘﺖ ﺭﻭﺵ ﺣﻞ ﻣﺴﺎﻟﻪ ﺭﺍ ﺗﻨﻬﺎ ﺑﺎ ﺣﻞ ﻣﺴﺎﻟﻪ ﻣﻲ ﺗﻮﺍﻥ ﺁﻣﻮﺧﺖ‪ .‬ﺑﻨﺎﺑﺮﺍﻳﻦ ﺗﻮﺻـﻴﻪ ﻣـﻲ ﮐﻨـﻴﻢ‬

‫ﭘﺲ ﺍﺯ ﻣﺸﺎﻫﺪﻩ ﻫﺮ ﺳﻮﺍﻝ ﺍﺑﺘﺪﺍ ﺳﻌﻲ ﮐﻨﻴﺪ ﺧﻮﺩﺗﺎﻥ ﻣﺴﺎﻳﻞ ﺁﻥ ﺭﺍ ﺣﻞ ﮐﻨﻴﺪ ﻭ ﺳﭙﺲ ﺣﻞ ﮐﺘﺎﺏ ﺭﺍ ﻣـﺸﺎﻫﺪﻩ‬

‫ﮐﻨﻴﺪ‪.‬‬

‫ﺍﺳﺘﺮﺍﺗﮋﻱ ﺍﻭﻝ ﺣﻞ ﻣﺴﺎﻟﻪ ﺟﺴﺘﺠﻮﻱ ﻗﻮﺍﻋﺪ ﺛﺎﺑﺖ ﺍﺳﺖ‪ .‬ﺩﺭ ﺣﻞ ﻣﺴﺎﻟﻪ ﻫﺎﻱ ﺍﻳﻦ ﻓﺼﻞ ﺍﻳﻦ ﻗﺎﻋـﺪﻩ ﺭﺍ‬

‫ﺭﻋﺎﻳﺖ ﮐﻨﻴﺪ‪:‬‬

‫ﺍﮔﺮ ﻳﮏ ﺗﮑﺮﺍﺭ ﻣﺸﺎﻫﺪﻩ ﮐﺮﺩﻳﺪ ﺑﻪ ﺩﻧﺒﺎﻝ ﻳﮏ ﻗﺎﻋﺪﻩ ﺛﺎﺑﺖ ﺑﮕﺮﺩﻳﺪ‪.‬‬

‫ﺩﺭ ﻣﺴﺎﻳﻞ ﺍﻳﻦ ﻓﺼﻞ ﺩﺭ ﻫﺮ ﻣﺴﺎﻟﻪ ﻳﮏ ﺣﺎﻟﺖ ﺍﻭﻟﻴﻪ )ﻓﻀﺎﻱ ﺍﺑﺘﺪﺍﻳﻲ( ﻭﺟﻮﺩ ﺩﺍﺭﺩ ﻭ ﻋﻤﻠﻲ ﻧﻴﺰ ﺗﻌﺮﻳـﻒ‬

‫ﺷﺪﻩ ﮐﻪ ﺩﺭ ﻫﺮ ﮔﺎﻡ ﺍﻧﺠﺎﻡ ﻣﻲ ﺷﻮﺩ ﻭ ﻣﻌﻤﻮﻻﹰ ﻳﮏ ﺣﺎﻟﺖ ﺑﻪ ﻋﻨﻮﺍﻥ ﻫﺪﻑ ﻧﻬﺎﻳﻲ ﻣﻌﺮﻓﻲ ﺷﺪﻩ ﻭ ﺳﻮﺍﻝ ﺍﻳﻦ ﺍﺳﺖ‬

‫ﮐﻪ‪ :‬ﺁﻳﺎ ﻣﻲ ﺗﻮﺍﻥ ﺑﻪ ﺍﻳﻦ ﻫﺪﻑ ﻧﻬﺎﻳﻲ ﺭﺳﻴﺪ ﻳﺎ ﺧﻴﺮ؟ ﺑﻨﺎﺑﺮﺍﻳﻦ ﻣﺴﺎﻳﻞ ﺍﻳﻦ ﻓﺼﻞ ‪ 2‬ﺣﺎﻟﺖ ﺩﺍﺭﻧﺪ‪:‬‬

‫‪ .1‬ﻣﺴﺎﻳﻠﻲ ﮐﻪ ﺭﺳﻴﺪﻥ ﺑﻪ ﺣﺎﻟﺖ ﻫﺪﻑ ﺁﻧﻬﺎ ﻣﻤﮑﻦ ﺍﺳﺖ‪ :‬ﺍﻳﻦ ﺩﺳﺘﻪ ﺍﺯ ﻣﺴﺎﻳﻞ )ﺑـﻪ ﻧﻈـﺮ ﻣـﻦ(‬

‫ﺟﺎﻟﺐ ﺗﺮ ﻫﺴﺘﻨﺪ ﺩﺭ ﺍﻳﻦ ﻣﺴﺎﻳﻞ ﻣﻌﻤﻮﻻﹰ ﺑﻪ ﺩﻧﺒﺎﻝ ﻳﮏ ﺗﺎﺑﻊ ﺍﮐﻴﺪﺍﹰ ﺻﻌﻮﺩﻱ ﻳﺎ ﺍﮐﻴـﺪﺍﹰ ﻧﺰﻭﻟـﻲ‬

‫ﺑﺮﺍﻱ ﻫﺮ ﮔﺎﻡ ﻣﻲ ﮔﺮﺩﻳﻢ‪ .‬ﭘﺲ ﺍﺯ ﻳﺎﻓﺘﻦ ﺍﻳﻦ ﺗﺎﺑﻊ ﺗﻘﺮﻳﺒﺎﹰ ‪ %80‬ﻣﺴﺎﻟﻪ ﺣﻞ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﭘـﺲ ﺍﺯ‬

‫ﻳﺎﻓﺘﻦ ﺍﻳﻦ ﺗﺎﺑﻊ ﻣﻌﻤﻮﻻﹰ ﻣﺴﺎﻳﻞ ﺑﻪ ‪ 2‬ﺭﻭﺵ ﺣﻞ ﻣﻲ ﺷﻮﻧﺪ‪.‬‬

‫ﺍﻟﻒ‪ .‬ﺍﺯ ﺁﻧﺠﺎ ﮐﻪ ﺗﺎﺑﻊ ﻳﮑﻨﻮﺍﺳﺖ‪ ،‬ﺩﺭ ﮔﺎﻡ ﻫﺎﻱ ﻣﺴﺎﻟﻪ ﺑﻪ ﺣﺎﻟـﺖ ﺗﮑـﺮﺍﺭﻱ ﺑﺮﻧﻤـﻲ ﺧـﻮﺭﻳﻢ ﭼـﻮﻥ‬

‫ﺑﺎﻳﺴﺘﻲ ﺩﺭ ﺍﻳﻦ ﺻﻮﺭﺕ ﺭﺷﺪ ﺗﺎﺑﻊ ﺩﺭ ﻣﻮﺍﻗﻌﻲ ﺑﻪ ﺻﻮﺭﺕ ﻋﮑﺲ ﺍﺩﺍﻣﻪ ﻳﺎﻓﺘﻪ ﺑﺎﺷﺪ‪ .‬ﺍﮔﺮ ﺗﻌﺪﺍﺩ‬

‫ﺣﺎﻟﺖ ﻫﺎﻱ )ﻓﻀﺎﻱ( ﻣﺴﺎﻟﻪ ﻣﺤﺪﻭﺩ ﺑﺎﺷﺪ ﭼﻮﻥ ﺩﺭ ﻫﺮ ﮔﺎﻡ ﺑﻪ ﻳﮏ ﺣﺎﻟﺖ ﺟﺪﻳﺪ ﻣـﻲ ﺭﺳـﻴﻢ‬

‫ﭘﺲ ﺍﻳﻦ ﻋﻤﻞ ﻧﻤﻲ ﺗﻮﺍﻧﺪ ﺑﻴﻨﻬﺎﻳﺖ ﺑﺎﺭ ﺍﻧﺠﺎﻡ ﺷﻮﺩ ﻭ ﺑﺎﻻﺧﺮﻩ ﺍﻳﻦ ﻋﻤﻞ ﻣﺘﻮﻗـﻒ ﻣـﻲ ﺷـﻮﺩ ﻭ‬

‫ﻣﻌﻤﻮﻻﹰ ﺗﻮﻗﻒ ﻋﻤﻞ ﻣﻌﺎﺩﻝ ﺣﻞ ﻣﺴﺎﻟﻪ ﺍﺳﺖ‪.‬‬

‫ﺏ‪ .‬ﺗﺎﺑﻊ ﻳﮑﻨﻮﺍﺳﺖ ﻭ ﻗﺪﺭ ﻣﻄﻠﻖ ﺭﺷﺪ ﺁﻥ ﺍﺯ ﻣﻘﺪﺍﺭ ‪ e‬ﺑﻴﺸﺘﺮ ﺍﺳﺖ ﺣﺎﻻ ﺍﮔﺮ ﺗـﺎﺑﻊ ﻣـﻮﺭﺩ ﻧﻈـﺮ ﺍﺯ‬

‫ﻣﻘﺪﺍﺭ ﻣﺸﺨﺼﻲ ﺑﻴﺸﺘﺮ )ﻳﺎ ﮐﻤﺘﺮ( ﻧﺸﻮﺩ ﺩﺭ ﺍﻳﻦ ﺻﻮﺭﺕ ﺍﻳﻦ ﻋﻤﻞ ﻣﺘﻮﻗﻒ ﺧﻮﺍﻫـﺪ ﺷـﺪ‪ .‬ﺩﺭ‬

‫ﺍﻳﻨﺠﺎ ﺫﮐﺮ ﻳﮏ ﻧﮑﺘﻪ ﻻﺯﻡ ﺍﺳﺖ‪ .‬ﻣﻘﺪﺍﺭ ‪ e‬ﭼﺮﺍ ﻻﺯﻡ ﺍﺳﺖ‪ :‬ﻓﺮﺽ ﮐﻨﻴﺪ ﻫﺪﻑ ﻣﺎ ﻋﺪﺩ ‪ 2‬ﺍﺳﺖ ﻭ‬

‫‪1‬‬ ‫‪1‬‬ ‫‪1‬‬

‫ﻭ ‪ ...‬ﺑﻪ ﻋـﺪﺩ ‪1‬‬ ‫ﺣﺎﻟﺖ ﺍﺑﺘﺪﺍ ﻋﺪﺩ ‪ 1‬ﺍﺳﺖ ﻭ ﺩﺭ ﮔﺎﻡ ﺍﻭﻝ ﺩﺭ ﮔﺎﻡ ﺩﻭﻡ ﺩﺭ ﮔﺎﻡ ﺳﻮﻡ‬
‫‪8‬‬ ‫‪4‬‬ ‫‪2‬‬

‫ﺍﺿﺎﻓﻪ ﺷﻮﺩ ﻣﺸﺎﻫﺪﻩ ﻣﻲ ﮐﻨﻴﻢ ﮐﻪ ﻫﻤﻴﺸﻪ ﻣﻲ ﺗﻮﺍﻥ ﺑﻪ ﻋﺪﺩ ﻣﻮﺟﻮﺩ ﻋـﺪﺩﻱ ﺍﺿـﺎﻓﻪ ﮐـﺮﺩ ﻭ‬

‫ﻫﻴﭻ ﻭﻗﺖ ﻫﻢ ﺍﻳﻦ ﻋﺪﺩ ﺑﻪ ‪ 2‬ﻧﻤﻲ ﺭﺳﺪ‪ .‬ﺍﻳﻨﺠﺎ ﻟﺰﻭﻡ ﻭﺟﻮﺩ ‪ e‬ﺍﺛﺒﺎﺕ ﻣﻲ ﺷﻮﺩ‪.‬‬

‫‪ .2‬ﻣﺴﺎﻳﻠﻲ ﮐﻪ ﺭﺳﻴﺪﻥ ﺑﻪ ﺣﺎﻟﺖ ﻫﺪﻑ ﺩﺭ ﺁﻧﻬﺎ ﻣﻤﮑﻦ ﻧﻴﺴﺖ‪ :‬ﺩﺭ ﺍﻳﻦ ﻣـﺴﺎﻳﻞ ﻣﻌﻤـﻮﻻﹰ ﺭﺍﺑﻄـﻪ‬

‫ﺛﺎﺑﺘﻲ ﻣﻲ ﻳﺎﺑﻴﻢ ﮐﻪ ﺑﺎ ﻫﺮ ﻋﻤﻞ ﻫﻤﭽﻨﺎﻥ ﺑﺮﻗﺮﺍﺭ ﺑﺎﻗﻲ ﻣﻲ ﻣﺎﻧﺪ ﺍﮔﺮ ﺍﻳﻦ ﺭﺍﺑﻄـﻪ ﺑـﺮﺍﻱ ﺣﺎﻟـﺖ‬

‫ﻧﻬﺎﻳﻲ )ﺣﺎﻟﺖ ﻫﺪﻑ( ﺑﺮﻗﺮﺍﺭ ﻧﺒﺎﺷﺪ‪ ،‬ﭼﻮﻥ ﺗﻨﻬﺎ ﺑﻪ ﺣﺎﻟﺖ ﻫﺎﻱ ﻣﻤﮑﻦ ﺍﺳﺖ ﺑﺮﺳـﻴﻢ ﮐـﻪ ﺍﻳـﻦ‬

‫ﺭﺍﺑﻄﻪ ﺭﺍ ﺍﺭﺿﺎ ﻣﻲ ﮐﻨﻨﺪ‪ ،‬ﺑﻨﺎﺑﺮﺍﻳﻦ ﺑﻪ ﺣﺎﻟﺖ ﻧﻬﺎﻳﻲ ﻧﻤﻲ ﺭﺳﻴﻢ )ﺑﻪ ﺍﻳﻦ ﺭﻭﺵ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺍﺻﻞ‬

‫ﻫﻢ ﺧﻮﺍﻧﻲ ﻫﻢ ﻣﻲ ﮔﻮﻳﻨﺪ(‪.‬‬

‫ﻣﺜﺎﻝ‪ . 1‬ﺍﺯ ﻧﻘﻄﻪ )‪ s = (a , b‬ﺑﺎ ﻓﺮﺽ ‪ 0 < b < a‬ﺩﺭ ﺻـﻔﺤﻪ ﺷـﺮﻭﻉ ﻣـﻲ ﮐﻨـﻴﻢ ﻭ ﺩﻧﺒﺎﻟـﻪ ﻧﻘـﺎﻁ‬

‫) ‪ ( xn , yn‬ﺭﺍ ﺑﺮ ﻃﺒﻖ ﻗﺎﻧﻮﻥ ﺯﻳﺮ ﻣﻲ ﺳﺎﺯﻳﻢ‪:‬‬

‫‪xn + yn‬‬ ‫‪2 xn yn‬‬

‫= ‪x0 = a , y0 = b, xn +1‬‬ ‫= ‪, yn +1‬‬
‫‪2‬‬ ‫‪xn + yn‬‬

‫ﺛﺎﺑﺖ ﮐﻨﻴﺪ ﺑﺎ ﺑﺰﺭﮒ ﺷﺪﻥ ‪ xn ،n‬ﻭ ‪ yn‬ﺑﻪ ﺳﻤﺖ ﻳﮏ ﺣﺪ ﻣﺸﺨﺺ ﻣﻴﻞ ﻣﻲ ﮐﻨﻨﺪ‪.‬‬

‫ﺣﻞ ‪ .‬ﺩﺭ ﺍﻳﻨﺠﺎ ﻳﺎﻓﺘﻦ ﻳﮏ ﺭﺍﺑﻄﻪ ﺛﺎﺑﺖ ﮐﺎﺭ ﺳﺎﺩﻩ ﺍﻱ ﺍﺳﺖ‪ .‬ﺍﺯ ﺭﺍﺑﻄﻪ ‪) xn +1 yn +1 = xn yn‬ﮐﻪ ﺑﺴﻴﺎﺭ‬

‫ﻭﺍﺿﺢ ﺍﺳﺖ ( ﺑﺮﺍﻱ ﺗﻤﺎﻡ ﻣﻘﺎﺩﻳﺮ ‪ n‬ﻣﻲ ﺗﻮﺍﻥ ﻧﺘﻴﺠﻪ ﮔﺮﻓﺖ ‪ . xn yn = ab‬ﺩﺭ ﺍﺑﺘﺪﺍ ﺩﺍﺭﻳﻢ ‪ . y0 < x0‬ﺍﻳﻦ ﺭﺍﺑﻄﻪ‬

‫ﻧﻴﺰ ﺑﻪ ﻋﻨﻮﺍﻥ ﻳﮏ ﺭﺍﺑﻄﻪ ﺛﺎﺑﺖ ﺑﺎﻗﻲ ﻣﻲ ﻣﺎﻧﺪ‪ .‬ﺩﺭ ﺣﻘﻴﻘﺖ ‪ xn +1‬ﻭﺍﺳﻄﻪ ﺣـﺴﺎﺑﻲ ‪ xn ، yn‬ﻭ ‪ yn +1‬ﻭﺍﺳـﻄﻪ‬

‫ﻫﻨﺪﺳﻲ ‪ yn‬ﻭ ‪ xn‬ﺍﺳﺖ‪ :‬ﻭﺍﺳﻄﻪ ﺣﺴﺎﺑﻲ ‪ 2‬ﻋﺪﺩ ﺗﻨﻬﺎ ﻭﻗﺘﻲ ﺑﺎ ﻭﺍﺳﻄﻪ ﻫﻨﺪﺳﻲ ﺁﻧﻬﺎ ﻣﺴﺎﻭﻱ ﺍﺳﺖ ﮐﻪ ‪ 2‬ﻋﺪﺩ‬

‫ﺑﺎ ﻫﻢ ﻣﺴﺎﻭﻱ ﺑﺎﺷﻨﺪ ﻭ ﺩﺭ ﻏﻴﺮ ﺍﻳﻦ ﺻﻮﺭﺕ ﻭﺍﺳﻄﻪ ﺣﺴﺎﺑﻲ ﺑﺰﺭﮒ ﺗﺮ ﺍﺳﺖ‪ .‬ﭼـﻮﻥ ‪ y0 < x0‬ﺍﺳـﺖ‪ ،‬ﺑـﻪ ﺍﺯﺍﻱ‬

‫ﺗﻤﺎﻡ ﻣﻘﺎﺩﻳﺮ ‪ n‬ﺭﺍﺑﻄﻪ ‪ yn < xn‬ﺑﺮﻗﺮﺍﺭ ﻣﻲ ﻣﺎﻧﺪ‪ .‬ﭘﺲ ﺑﺮﺍﻱ ﺗﻤﺎﻡ ﻣﻘﺎﺩﻳﺮ ‪ n‬ﺭﺍﺑﻄﻪ‬

‫‪xn − yn xn − yn xn − yn‬‬
‫= ‪0 < xn +1 − yn +1‬‬ ‫⋅‬ ‫<‬
‫‪xn + yn‬‬ ‫‪2‬‬ ‫‪2‬‬

‫ﺑﺮﻗﺮﺍﺭ ﺍﺳﺖ‪ .‬ﺑﻨﺎﺑﺮﺍﻳﻦ ‪ xn‬ﻭ ‪ yn‬ﺑﻪ ﺍﺯﺍﻱ ﻣﻘﺎﺩﻳﺮ ﺑﺰﺭﮒ ‪ n‬ﻫﺮ ﺩﻭ ﺑﻪ ﺳﻤﺖ ﻳﮏ ﻋﺪﺩ ﮐﻪ ﻣﺎ ﺁﻥ ﺭﺍ ‪ x‬ﻣﻲ‬

‫ﻧﺎﻣﻴﻢ ﻣﻴﻞ ﻣﻲ ﮐﻨﻨﺪ‪ x .‬ﺩﺭ ﺭﺍﺑﻄﻪ ‪ x2 = ab‬ﻳﺎ ‪ x = ab‬ﺑﺎﻳﺴﺘﻲ ﺻﺪﻕ ﮐﻨﺪ‪.‬‬

‫ﺍﻳﻦ ﻣﺜﺎﻟﻲ ﺍﺯ ﻳﺎﻓﺘﻦ ﺭﺍﺑﻄﻪ ﺛﺎﺑﺖ ﺩﺭ ﻣﺴﺎﻟﻪ ﺑﻮﺩ‪ .‬ﺗﻮﺟﻪ ﮐﻨﻴﺪ ﮐﻪ ﻳﺎﻓﺘﻦ ﺍﻳﻦ ﺭﻭﺍﺑﻂ ﺣـﻞ ﻣـﺴﺎﻟﻪ ﻧﻴـﺴﺖ‬

‫ﺑﻠﮑﻪ ﺻﺮﻓﺎﹰ ﺍﺑﺰﺍﺭﻱ ﺑﺮﺍﻱ ﺣﻞ ﻣﺴﺎﻟﻪ ﺍﺳﺖ‪ .‬ﺍﻳﻨﮑﻪ ﭼﮕﻮﻧﻪ ﺍﺯ ﺍﻳﻦ ﺭﻭﺍﺑﻂ ﺑﺮﺍﻱ ﺣﻞ ﻣﺴﺎﻟﻪ ﺍﺳﺘﻔﺎﺩﻩ ﻧﻤـﺎﻳﻴﻢ ﻧﻴـﺰ‬

‫ﻼ ﺍﺑﺘﮑﺎﺭﻱ ﺍﺳﺖ‪.‬‬
‫ﮐﺎﻣ ﹰ‬
‫ﻣﺜﺎﻝ‪ . 2‬ﻓﺮﺽ ﮐﻨﻴﺪ ‪ n‬ﻳﮏ ﻋﺪﺩ ﻃﺒﻴﻌﻲ ﻓﺮﺩ ﺍﺳﺖ‪ .‬ﺩﺭ ﺍﺑﺘﺪﺍ ﺗﻤـﺎﻡ ﺍﻋـﺪﺍﺩ ‪ 1,2,3,K,2 n‬ﺭﻭﻱ ﺗﺨﺘـﻪ‬

‫ﺳﻴﺎﻩ ﻧﻮﺷﺘﻪ ﺷﺪﻩ ﺍﻧﺪ‪ .‬ﺩﺭ ﻫﺮ ﻣﺮﺣﻠﻪ ‪ 2‬ﻋﺪﺩ ﺩﻟﺨﻮﺍﻩ ‪ a‬ﻭ ‪ b‬ﺭﺍ ﺍﺯ ﺑﻴﻦ ﺍﻋﺪﺍﺩ ﺭﻭﻱ ﺗﺨﺘﻪ ﺳﻴﺎﻩ ﭘﺎﮎ ﻣﻲ ﮐﻨـﻴﻢ ﻭ‬

‫ﺑﻪ ﺟﺎﻱ ﺁﻧﻬﺎ ﻋﺪﺩ | ‪ | a − b‬ﺭﺍ ﻣﻲ ﻧﻮﻳﺴﻴﻢ‪ .‬ﺛﺎﺑﺖ ﮐﻨﻴﺪ ﻋﺪﺩﻱ ﮐﻪ ﺩﺭ ﻧﻬﺎﻳﺖ ﺑﺎﻗﻲ ﺧﻮﺍﻫﺪ ﻣﺎﻧﺪ ﻓﺮﺩ ﺍﺳﺖ‪.‬‬

‫ﺣﻞ‪ .‬ﻓﺮﺽ ﮐﻨﻴﺪ ‪ S‬ﺑﺮﺍﺑﺮ ﻣﺠﻤﻮﻉ ﺍﻋﺪﺍﺩﻱ ﺑﺎﺷﺪ ﮐﻪ ﺩﺭ ﻫﺮ ﻣﺮﺣﻠﻪ ﺭﻭﻱ ﺗﺨﺘﻪ ﺳﻴﺎﻩ ﻧﻮﺷﺘﻪ ﺷﺪﻩ ﺍﻧﺪ ﺩﺭ‬

‫)‪2n(2n + 1‬‬
‫= ‪ S‬ﺍﺳﺖ ﮐﻪ ﻳﮏ ﻋﺪﺩ ﻓﺮﺩ ﺍﺳﺖ‪ .‬ﻓﺮﺽ ﮐﻨﻴﺪ ﺩﺭ ﻳﮏ ﻣﺮﺣﻠﻪ ‪ 2‬ﻋﺪﺩ ‪ a‬ﻭ ‪ b‬ﺭﺍ ﺍﻧﺘﺨـﺎﺏ‬ ‫ﺍﺑﺘﺪﺍ‬
‫‪2‬‬

‫ﮐﻨﻴﻢ‪ .‬ﺑﺪﻭﻥ ﮐﺎﺳﺘﻪ ﺷﺪﻥ ﺍﺯ ﮐﻠﻴﺖ ﻣﺴﺎﻟﻪ ﻣﻲ ﺗﻮﺍﻧﻴﻢ ﻓﺮﺽ ﮐﻨﻴﻢ ‪ a ≤ b‬ﺑﺎﺷﺪ ﺩﺭ ﺍﻳﻦ ﺻﻮﺭﺕ ‪ a‬ﻭ ‪ b‬ﺧﻂ ﻣﻲ‬

‫ﺧﻮﺭﻧﺪ ﻭ ﺑﻪ ﺟﺎﻱ ﺁﻧﻬﺎ ‪ b − a‬ﻗﺮﺍﺭ ﻣﻲ ﮔﻴﺮﺩ ﮐﻪ ﺩﺭﻧﺘﻴﺠﻪ ﻣﻘﺪﺍﺭ ‪ S‬ﺑﻪ ﺍﻧﺪﺍﺯﻩ‪ 2a ‬ﮐﺎﻫﺶ ﻣﻲ ﻳﺎﺑﺪ ﺑﻨﺎﺑﺮﺍﻳﻦ ﺯﻭﺝ‬

‫ﻳﺎ ﻓﺮﺩ ﺑﻮﺩﻥ ‪ S‬ﺛﺎﺑﺖ ﻣﻲ ﻣﺎﻧﺪ‪ .‬ﺩﺭ ﺍﺑﺘﺪﺍ ‪ S‬ﻋﺪﺩﻱ ﻓﺮﺩ ﺍﺳﺖ ﺑﻨﺎﺑﺮﺍﻳﻦ ﻋﺪﺩﻱ ﮐﻪ ﺩﺭ ﻧﻬﺎﻳﺖ ﺑﺎﻗﻲ ﻣﻲ ﻣﺎﻧـﺪ ﻧﻴـﺰ‬

‫ﻓﺮﺩ ﺍﺳﺖ‪.‬‬

‫ﻣﺜﺎﻝ ‪ . 3‬ﻳﮏ ﺩﺍﻳﺮﻩ ﺭﺍ ﺑﻪ ‪ 6‬ﺑﺨﺶ ﺗﻘﺴﻴﻢ ﮐﺮﺩﻩ ﺍﻳﻢ ﻭ ﺩﺭ ﺟﻬﺖ ﺧﻼﻑ ﺣﺮﮐﺖ ﻋﻘﺮﺑـﻪ ﻫـﺎﻱ ﺳـﺎﻋﺖ‬

‫ﻋﺪﺩﻫﺎﻱ ‪ 0 ،1 ،0 ،0 ،0‬ﻭ ‪ 1‬ﺩﺭ ﺍﻳﻦ ﺑﺨﺶ ﻫﺎ ﻧﻮﺷﺘﻪ ﺍﻳﻢ‪ .‬ﺷﻤﺎ ﻣﻲ ﺗﻮﺍﻧﻴﺪ ﺩﺭ ﻫﺮ ﻣﺮﺣﻠﻪ ﺑﻪ ﺩﻭ ﻋﺪﺩ ﮐـﻪ ﺩﺭ ‪2‬‬

‫ﺑﺨﺶ ﻣﺠﺎﻭﺭ ﻗﺮﺍﺭ ﺩﺍﺭﻧﺪ ﻳﮏ ﻭﺍﺣﺪ ﺍﺿﺎﻓﻪ ﻧﻤﺎﻳﻴﺪ‪ .‬ﺁﻳﺎ ﻣﻤﮑﻦ ﺍﺳﺖ ﺑﻪ ﺣﺎﻟﺘﻲ ﺑﺮﺳﻴﺪ ﮐﻪ ﺗﻤـﺎﻡ ﺍﻋـﺪﺍﺩ ﻧﻮﺷـﺘﻪ‬

‫ﺷﺪﻩ ﺑﺎ ﻫﻢ ﺑﺮﺍﺑﺮ ﺑﺎﺷﻨﺪ؟‬

‫ﺣﻞ‪ .‬ﺑﺮﺍﻱ ﺣﻞ ﻣﺴﺎﻟﻪ ﻓﺮﺽ ﻣﻲ ﮐﻨﻴﻢ ‪ A‬ﻣﺠﻤﻮﻉ ﺍﻋﺪﺍﺩ ﺑﺨﺶ ﻫﺎﻱ ﺍﻭﻝ ﻭ ﺳﻮﻡ ﻭ ﭘﻨﺠﻢ ﻭ ‪ ،B‬ﻣﺠﻤـﻮﻉ‬

‫ﺍﻋﺪﺍﺩ ﺑﺨﺶ ﻫﺎﻱ ﺩﻭﻡ ﻭ ﭼﻬﺎﺭﻡ ﻭ ﺷﺸﻢ ﺑﺎﺷﺪ ﺭﻭﺷﻦ ﺍﺳﺖ ﮐﻪ ﺭﺍﺑﻄﻪ ‪ A − B = 2‬ﻫﻤﻴﺸﻪ ﺑﺮﻗﺮﺍﺭ ﺍﺳﺖ ﭼﻮﻥ‬

‫ﺩﺭ ﻫﺮ ﮔﺎﻡ ﺑﻪ ﻫﺮ ﻳﮏ ﺍﺯ ‪ A‬ﻭ ‪ B‬ﻳﮏ ﻭﺍﺣﺪ ﺍﺿﺎﻓﻪ ﻣﻲ ﺷﻮﺩ‪ .‬ﺑﻨﺎﺑﺮﺍﻳﻦ ﺍﻣﮑﺎﻥ ﻧﺪﺍﺭﺩ ﺑﻪ ﺣﺎﻟﺘﻲ ﺑﺮﺳﻴﻢ ﮐﻪ ﺷـﺶ‬

‫ﻋﺪﺩ ﺑﺎ ﻫﻢ ﻣﺴﺎﻭﻱ ﺑﺎﺷﻨﺪ ﭼﻮﻥ ﺩﺭ ﺁﻥ ﺣﺎﻟﺖ ‪ A− B‬ﺑﺮﺍﺑﺮ ‪ 0‬ﺧﻮﺍﻫﺪ ﺑﻮﺩ‪.‬‬

‫ﻣﺜﺎﻝ ‪ . 4‬ﺩﺭ ﻳﮏ ﭘﺎﻟﻤﺎﻥ ﻫﺮ ﻧﻤﺎﻳﻨﺪﻩ ﺣﺪﺍﮐﺜﺮ ‪ 3‬ﻣﺨﺎﻟﻒ ﺩﺍﺭﺩ‪ .‬ﺛﺎﺑﺖ ﮐﻨﻴﺪ‪ ،‬ﺍﻳﻦ ﻧﻤﺎﻳﻨﺪﮔﺎﻥ ﺭﺍ ﻣﻲ ﺗـﻮﺍﻥ‬

‫ﺩﺭ ‪ 2‬ﺧﺎﻧﻪ ﻗﺮﺍﺭ ﺩﺍﺩ ﻃﻮﺭﻱ ﮐﻪ ﻫﺮ ﻧﻤﺎﻳﻨﺪﻩ ﺩﺭ ﺧﺎﻧﻪ‪ ‬ﺧﻮﺩ ﺣﺪﺍﮐﺜﺮ ‪ 1‬ﻣﺨﺎﻟﻒ ﺩﺍﺷﺘﻪ ﺑﺎﺷﺪ‪.‬‬

‫ﺣﻞ‪ .‬ﺩﺭ ﺍﺑﺘﺪﺍ ﻧﻤﺎﻳﻨﺪﮔﺎﻥ ﺭﺍ ﺑﻪ ﺻﻮﺭﺕ ﺩﻟﺨﻮﺍﻩ ﺩﺭ ‪ 2‬ﺧﺎﻧﻪ ﻗﺮﺍﺭ ﻣﻲ ﺩﻫﻴﻢ‪ .‬ﻓﺮﺽ ﮐﻨﻴﺪ ‪ H‬ﻣﺠﻤﻮﻉ ﺗﻌﺪﺍﺩ‬

‫ﻣﺨﺎﻟﻔﺎﻥ ﺍﻓﺮﺍﺩ ﺩﺭ ﺧﺎﻧﻪ ﻫﺎﻱ ﺧﻮﺩ ﺑﺎﺷﺪ‪ .‬ﻓﺮﺽ ﮐﻨﻴﺪ ‪ A‬ﺩﺭ ﺧﺎﻧﻪ ﺧﻮﺩ ﺑﻴﺶ ﺍﺯ ‪ 1‬ﻣﺨﺎﻟﻒ ﺩﺍﺷﺘﻪ ﺑﺎﺷﺪ ﺑﻨﺎﺑﺮﺍﻳﻦ‬

‫‪ A‬ﺣﺪﺍﮐﺜﺮ ﻳﮏ ﻣﺨﺎﻟﻒ ﺩﺭ ﺧﺎﻧﻪ‪ ‬ﺩﻳﮕﺮ ﺩﺍﺭﺩ ﻭ ﻣﻲ ﺗﻮﺍﻧﺪ ﺑﻪ ﺧﺎﻧﻪ‪ ‬ﺩﻳﮕﺮ ﺑﺮﻭﺩ‪ .‬ﺍﮔﺮ ﺧﺎﻧﻪ‪ A ‬ﻋﻮﺽ ﺷﻮﺩ ﻣﻘﺪﺍﺭ ‪H‬‬

‫ﮐﻢ ﺧﻮﺍﻫﺪ ﺷﺪ‪) .‬ﻣﻘﺪﺍﺭ ‪ H‬ﺣﺪﺍﻗﻞ ‪ 2‬ﻭﺍﺣﺪ ﮐﻤﺘﺮ ﻣﻲ ﺷﻮﺩ( ﺍﺯ ﺁﻧﺠﺎ ﮐﻪ ‪ H‬ﻋﺪﺩﻱ ﻃﺒﻴﻌﻲ ﻭ ﻣﺤﺪﻭﺩ ﺍﺳﺖ ﺍﻳـﻦ‬

‫ﻋﻤﻞ ﻧﻤﻲ ﺗﻮﺍﻧﺪ ﻫﻤﻴﺸﻪ ﺍﺩﺍﻣﻪ ﻳﺎﺑﺪ ﻭ ﺑﺎﻻﺧﺮﻩ ﻣﺘﻮﻗﻒ ﺧﻮﺍﻫﺪ ﺷﺪ‪ .‬ﻳﻌﻨﻲ ﺑﻌﺪ ﺍﺯ ﭼﻨﺪ ﻣﺮﺣﻠﻪ ﻣﻘـﺪﺍﺭ ‪ H‬ﺩﻳﮕـﺮ‬

‫ﮐﺎﻫﺶ ﻧﻤﻲ ﻳﺎﺑﺪ ﻭ ﺩﺭﻧﺘﻴﺠﻪ ﺩﺭ ﺁﻧﺠﺎ ﻣﺎ ﺑﻪ ﻧﺘﻴﺠﻪ ﻣﻄﻠﻮﺏ ﺭﺳﻴﺪﻩ ﺍﻳﻢ‪.‬‬

‫ﻣﻼﺣﻈﻪ ‪ .‬ﺩﺭ ﺍﻳﻨﺠﺎ ﺍﺯ ﻳﮏ ﺍﻳﺪﻩ‪ ‬ﺟﺪﻳﺪ ﺍﺳﺘﻔﺎﺩﻩ ﻧﻤﻮﺩﻳﻢ‪ .‬ﻣﺎ ﻳﮏ ﺗﺎﺑﻊ ﺍﮐﻴﺪﺍﹰ ﻧﺰﻭﻟﻲ ﺑـﺎﻓﺘﻴﻢ ﮐـﻪ ﺩﺭ ﻫـﺮ‬

‫ﻣﺮﺣﻠﻪ ﻣﻘﺪﺍﺭ ﺁﻥ ﮐﺎﻫﺶ ﻣﻲ ﻳﺎﺑﺪ ﻭ ﻫﻤﻴﺸﻪ ﻣﻘﺪﺍﺭ ﺁﻥ ﻋﺪﺩﻱ ﺻﺤﻴﺢ ﻭ ﻏﻴﺮﻣﻨﻔﻲ ﺍﺳﺖ ﺍﺯ ﺁﻧﺠـﺎ ﮐـﻪ ﺩﻧﺒﺎﻟـﻪ‪‬‬

‫ﻧﺎﻣﺘﻨﺎﻫﻲ ﺍﮐﻴﺪﺍﹰ ﻧﺰﻭﻟﻲ ﺍﺯ ﺍﻋﺪﺍﺩ ﺻﺤﻴﺢ ﻭ ﻏﻴﺮﻣﻨﻔﻲ ﻭﺟﻮﺩ ﻧﺪﺍﺭﺩ‪ ،‬ﺍﻳﻦ ﺩﻧﺒﺎﻟﻪ ﺑﺎﻳـﺴﺘﻲ ﻳـﮏ ﺩﻧﺒﺎﻟـﻪ‪ ‬ﻣﺘﻨـﺎﻫﻲ‬

‫ﺑﺎﺷﺪ‪.‬‬
 ‫ﻣﺜﺎﻝ ‪ . 5‬ﻓﺮﺽ ﮐﻨﻴﺪ ﻫﺮ ‪ 4‬ﻋﺪﺩ ‪ b ،c ،d‬ﻭ ‪ a‬ﺑﺎ ﻫﻢ ﻣﺴﺎﻭﻱ ﻧﺒﺎﺷﻨﺪ ﺍﺯ ﺩﻧﺒﺎﻟﻪ ﭼﻬﺎﺭﺗـﺎﻳﻲ ) ‪(a , b, c, d‬‬

‫ﺷﺮﻭﻉ ﻣﻲ ﮐﻨﻴﻢ ﺍﺯ ﺍﻳﻦ ﺩﻧﺒﺎﻟﻪ ﭼﻬﺎﺭﺗﺎﻳﻲ ﺟﺪﻳﺪ ) ‪ (a − b, b − c, c − d , d − a‬ﺭﺍ ﻣﻲ ﺳﺎﺯﻳﻢ ﻭ ﻫﻤﻴﻦ ﻋﻤـﻞ‬

‫ﺭﺍ ﺑﺎ ﺩﻧﺒﺎﻟﻪ‪ ‬ﺟﺪﻳﺪ ﺍﺩﺍﻣﻪ ﻣﻲ ﺩﻫﻴﻢ‪ .‬ﺛﺎﺑﺖ ﮐﻨﻴﺪ ﮐﻮﭼﮑﺘﺮﻳﻦ ﻋﺪﺩ ﺩﻧﺒﺎﻟﻪ‪ ،‬ﻣﻲ ﺗﻮﺍﻧﺪ ﺍﺯ ﻟﺤﺎﻅ ﻗﺪﺭﻣﻄﻠﻖ‪ ،‬ﺑﻪ ﻫـﺮ‬

‫ﺍﻧﺪﺍﺯﻩ ﺑﺰﺭﮒ ﺷﻮﺩ‪.‬‬

‫ﺣﻞ‪ .‬ﻓﺮﺽ ﮐﻨﻴﺪ ﺑﻪ ﺍﺯﺍﻱ ﻫﺮ ‪ = (a n , bn , c n , d n ) ،n‬د ‪ ρ‬ﭼﻬﺎﺭﺗﺎﻳﻲ ﺑﺎﺷﺪ ﮐﻪ ﺩﺭ ﻣﺮﺣﻠﻪ‪n ‬ﺍﻡ ﺑـﻪ ﺁﻥ‬

‫ﺭﺳﻴﺪﻩ ﺍﻳﻢ ﺑﻨﺎﺑﺮﺍﻳﻦ ﺑﺮﺍﻱ ‪ n > 0‬ﺩﺍﺭﻳﻢ‪ a n + bn + c n + d n = 0 :‬ﺍﻳﻦ ﻳﮏ ﺭﺍﺑﻄﻪ‪ ‬ﺛﺎﺑﺖ ﺍﺳﺖ ﮐـﻪ ﺷـﺎﻳﺪ‬

‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬

‫ﺯﻳﺎﺩ ﺑﻪ ﻣﺎ ﮐﻤﮏ ﻧﮑﻨﺪ ﻭﻟﻲ ﺍﮔﺮ ﺛﺎﺑﺖ ﮐﻨﻴﻢ ﺩﻧﺒﺎﻟﻪ‪ a n + bn + c n + d n ‬ﮐﺮﺍﻥ ﺑﺎﻻ ﻧـﺪﺍﺭﺩ ﺩﺭ ﺍﻳـﻦ ﺻـﻮﺭﺕ‬

‫ﻣﺴﺄﻟﻪ ﺣﻞ ﺧﻮﺍﻫﺪ ﺷﺪ‪ .‬ﻣﻲ ﺑﻴﻨﻴﻢ ﮐﻪ ﺭﺍﺑﻄﻪ‪ ‬ﺯﻳﺮ ﺑﺮﻗﺮﺍﺭ ﺍﺳﺖ‪.‬‬

‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬

‫) ‪a n +1 + bn +1 + c n +1 + d n +1 = (a n − bn ) + (bn − cn ) + (cn − d n ) + (d n − a n‬‬

‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬

‫‪= 2(a n + bn + c n + d n ) − 2a n bn − 2bn c n − 2c n d n − 2d n a n‬‬ ‫)‪(1‬‬

‫ﺣﺎﻻ ﺍﺯ ﺭﺍﺑﻄﻪ‪ 0 = a n + bn + cn + d n ‬ﺍﺳﺘﻔﺎﺩﻩ ﻣﻲ ﮐﻨﻴﻢ‪:‬‬

‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬

‫‪0 = (a n + bn + c n + d n ) = (a n + c n ) + (bn + d 2 ) + 2a n bn + 2bn c n + 2cn d n + 2d n a n‬‬

‫ﻃﺮﻓﻴﻦ ﺗﺴﺎﻭﻱ ﻓﻮﻕ ﻭ ﺭﺍﺑﻄﻪ‪ (1 ) ‬ﺭﺍ ﺑﺎ ﻫﻢ ﺟﻤﻊ ﻣﻲ ﮐﻨﻴﻢ ﺗﺎ ﺭﺍﺑﻄﻪ‪ ‬ﺯﻳﺮ ﺑﻪ ﺩﺳﺖ ﺁﻳﺪ‪:‬‬

‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬
‫) ‪a n +1 + bn +1 + c n +1 + d n +1 = 2(a n + bn + cn + d n ) + (a n + cn ) + (bn + d n‬‬

‫ﺩﺭﻧﺘﻴﺠﻪ ﺩﺍﺭﻳﻢ‪:‬‬

‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬

‫) ‪a n +1 + bn +1 + c n +1 + d n +1 ≥ 2(a n + bn + c n + d n‬‬

‫ﻭ ﺩﺭﻧﺘﻴﺠﻪ ﺑﻪ ﺍﺯﺍﻱ ﻫﺮ ‪ n‬ﺩﺍﺭﻳﻢ‪:‬‬

 ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪n −1‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪2‬‬
‫‪a n + bn + c n + d n ≥ 2‬‬ ‫) ‪(a1 + b1 + c1 + d 1‬‬

‫ﺑﻨﺎﺑﺮﺍﻳﻦ ﻣﺠﻤﻮﻉ ﺗﻮﺍﻥ ﺩﻭﻡ ﺍﻋﺪﺍﺩ ﻫﺮ ﭼﻬﺎﺭﺗﺎﻳﻲ ﺩﺭ ﻫﺮ ﻣﺮﺣﻠﻪ ﺩﺭ ﺣﺎﻝ ﺍﻓﺰﺍﻳﺶ ﺍﺳﺖ ﻭ ﭼﻮﻥ ﺍﻳـﻦ‬

‫ﻣﺠﻤﻮﻉ ﻫﻤﻴﺸﻪ ﻋﺪﺩ ﻃﺒﻴﻌﻲ ﺍﺳﺖ ﻣﻘﺪﺍﺭ ﺁﻥ ﻫﺮ ﺍﻧﺪﺍﺯﻩ ﮐﻪ ﺑﺨﻮﺍﻫﻴﻢ ﺑﺰﺭﮒ ﻣﻲ ﺷﻮﺩ‪ .‬ﺣﺎﻻ ﻧﺘﻴﺠﻪ ﻣﻲ ﮔﻴـﺮﻳﻢ‬

‫ﺑﺰﺭﮔﺘﺮﻳﻦ ﻋﺪﺩ ﻫﺮ ﭼﻬﺎﺭﺗﺎﻳﻲ ﺍﺯ ﻟﺤﺎﻅ ﻗﺪﺭﻣﻄﻠﻖ‪ ،‬ﻫﺮ ﺍﻧﺪﺍﺯﻩ ﮐﻪ ﺑﺨﻮﺍﻫﻴﻢ ﻣﻲ ﺗﻮﺍﻧـﺪ ﺯﻳـﺎﺩ ﺷـﻮﺩ‪ .‬ﺍﻣـﺎ ﭼـﻮﻥ‬

‫ﻣﺠﻤﻮﻉ ﺍﻋﺪﺍﺩ ‪4‬ﺗﺎﻳﻲ ﻫﺎ ﺑﻌﺪ ﺍﺯ ﻣﺮﺣﻠﻪ‪ ‬ﺍﻭﻝ ‪ 0‬ﺍﺳﺖ ﻧﺘﻴﺠﻪ ﻣﻲ ﮔﻴﺮﻳﻢ ﻫﻢ ﻗﺪﺭﻣﻄﻠﻖ ﮐﻮﭼﮑﺘﺮﻳﻦ ﻋﺪﺩ ﻣﻨﻔﻲ ﻭ‬

‫ﻫﻢ ﻗﺪﺭﻣﻄﻠﻖ ﺑﺰﺭﮔﺘﺮﻳﻦ ﻋﺪﺩ ﻣﺜﺒﺖ ﺩﺭ ﺣﺎﻝ ﺍﻓﺰﺍﻳﺶ ﺍﺳﺖ‪.‬‬

‫ﻣﻼﺣﻈﻪ‪ .‬ﺍﮔﺮ ﺩﺭ ﺍﻳﻦ ﻣﺴﺄﻟﻪ ) ‪ ρ n = (a n , bn , cn , d n‬ﺭﺍ ﻧﻘﻄﻪ ﺍﻱ ﺩﺭ ﺻﻔﺤﻪ‪ 4 ‬ﺑﻌﺪﻱ ﻓﺮﺽ ﮐﻨﻴﻢ‪.‬‬

‫ﻣﺘﻮﺟﻪ ﻣﻲ ﺷﻮﻳﻢ ﮐﻪ ﺩﺭ ﻫﺮ ﻣﺮﺣﻠﻪ‪ ،‬ﻓﺎﺻﻠﻪ‪ ‬ﻧﻘﻄﻪ‪ ‬ﺟﺪﻳﺪ ﺍﺯ ﻣﺒﺪﺃ ﺩﺭ ﺣﺎﻝ ﺍﻓﺰﺍﻳﺶ ﺍﺳﺖ ﺑﻨﺎﺑﺮﺍﻳﻦ ﻓﺎﺻﻠﻪ ﺍﺯ ﻣﺒﺪﺃ‬

‫ﺗﺎﺑﻊ ﻣﻬﻤﻲ ﺍﺳﺖ ﮐﻪ ﺯﻣﺎﻥ ﻫﺎﻳﻲ ﮐﻪ ﺑﺎ ﺩﻧﺒﺎﻟﻪ ﺍﻱ ﺍﺯ ﻧﻘﺎﻁ ﺳﺮﻭﮐﺎﺭ ﺩﺍﺭﻳﻢ ﻣﻤﮑﻦ ﺍﺳﺖ ﻣﻔﻴﺪ ﺑﺎﺷﺪ‪.‬‬

‫ﻣﺜﺎﻝ ‪ . 6‬ﺍﺯ ﻧﻘﻄﻪ ) ‪ ( x0 , y0‬ﺑﺎ ﻓﺮﺽ ‪ 0 < x0 < y0‬ﺷﺮﻭﻉ ﻣﻲ ﮐﻨﻴﻢ ﻭ ﺩﺭ ﻫﺮ ﻣﺮﺣﻠـﻪ ‪ yn +1 , xn +1‬ﺭﺍ‬

‫ﺑﻪ ﺻﻮﺭﺕ ﺯﻳﺮ ﺍﺯ ‪ yn , xn‬ﺑﻪ ﺩﺳﺖ ﻣﻲ ﺁﻭﺭﻳﻢ‪.‬‬

‫‪xn + y n‬‬
‫= ‪xn + 1‬‬ ‫ﻭ‬ ‫‪yn+1 = xn+1 yn+1‬‬
‫‪2‬‬

‫ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺷﮑﻞ ‪ 1‬ﻭ ﻧﺎﻣﺴﺎﻭﻱ ﻭﺍﺳﻄﻪ ﻫﺎﻱ ﺣﺴﺎﺑﻲ ﻭ ﻫﻨﺪﺳﻲ ﺑﺮﺍﻱ ﻫﺮ ‪ n‬ﻧﺸﺎﻥ ﺩﻫﻴﺪ‪:‬‬

‫ﺷﮑﻞ )‪(1‬‬

‫‪yn − xn‬‬
‫‪xn < yn ⇒ xn +1 < yn +1‬‬ ‫ﻭ‬ ‫< ‪yn +1 − xn +1‬‬
‫‪4‬‬
 ‫ﻫﻤﭽﻨﻴﻦ ﺛﺎﺑﺖ ﮐﻨﻴﺪ ‪ x‬ﺣﺪ ﺩﻧﺒﺎﻟﻪ‪ xn ‬ﻭ ‪ y‬ﺣﺪ ﺩﻧﺒﺎﻟﻪ‪ yn ‬ﺑﺎ ﻫﻢ ﻣﺴﺎﻭﻱ ﺍﻧﺪ‪.‬‬

‫‪xn‬‬
‫ﻭ ‪ xn − yn‬ﻭﻗﺘﻲ ﺍﺯ ﻣﺮﺣﻠﻪ‪‬‬ ‫ﺣﻞ‪ .‬ﺩﺭ ﺍﻳﻨﺠﺎ ﻧﻴﺰ ﺍﺻﻞ ﻋﺪﻡ ﺗﻐﻴﻴﺮ ﺑﻪ ﮐﻤﮏ ﻣﺎ ﻣﻲ ﺁﻳﺪ‪ .‬ﺑﻪ ﺗﻐﻴﻴﺮﺍﺕ‬
‫‪yn‬‬

‫‪n‬ﺍﻡ ﺑﻪ ﻣﺮﺣﻠﻪ‪ n + 1 ‬ﺍﻡ ﻣﻲ ﺭﻭﻳﻢ‪ ،‬ﺗﻮﺟﻪ ﮐﻨﻴﺪ‪:‬‬

‫‪xn‬‬
‫‪1+‬‬
‫‪xn +1‬‬ ‫‪xn +1‬‬ ‫‪xn +1‬‬ ‫‪yn‬‬
‫=‬ ‫=‬ ‫=‬ ‫)‪(1‬‬
‫‪yn +1‬‬ ‫‪xn +1 yn‬‬ ‫‪yn‬‬ ‫‪2‬‬

‫ﺍﻳﻦ ﺭﺍﺑﻄﻪ ﻣﺎ ﺭﺍ ﺑﻪ ﻳﺎﺩ ﺭﺍﺑﻄﻪ‪ ‬ﺑﻴﻦ ﮐﺴﻴﻨﻮﺱ ﻧﺼﻒ ﻳﮏ ﺯﺍﻭﻳﻪ ﺑﺎ ﮐﺴﻴﻨﻮﺱ ﺧﻮﺩ ﺁﻥ ﺯﺍﻭﻳﻪ ﻣﻲ ﺍﻧﺪﺍﺯﺩ‪:‬‬

‫‪α‬‬ ‫‪1 + cos α‬‬

‫‪cos‬‬ ‫=‬
‫‪2‬‬ ‫‪2‬‬

‫‪xn‬‬ ‫‪xn‬‬
‫‪ .‬ﺑﻨﺎﺑﺮﺍﻳﻦ‬ ‫< ‪ 0‬ﻫﻤﻴﺸﻪ ﺑﺮﻗﺮﺍﺭ ﺍﺳﺖ ﻣﻲ ﺗﻮﺍﻧﻴﻢ ﻓﺮﺽ ﮐﻨﻴﻢ ‪= cos α n‬‬ ‫ﺍﺯ ﺁﻧﺠﺎ ﮐﻪ ﺭﺍﺑﻄﻪ‪< 1 ‬‬
‫‪yn‬‬ ‫‪yn‬‬

‫ﺭﺍﺑﻄﻪ‪ (1) ‬ﺑﻪ ﺻﻮﺭﺕ ﺯﻳﺮ ﺩﺭﻣﻲ ﺁﻳﺪ‪:‬‬

‫‪αn‬‬ ‫‪α0‬‬ ‫‪n‬‬

‫‪cos α n +1 = cos‬‬ ‫= ‪⇒ αn‬‬ ‫‪n‬‬
‫‪⇒ 2 αn = α0‬‬ ‫)‪(2‬‬
‫‪2‬‬ ‫‪2‬‬

‫ﺑﻨﺎﺑﺮﺍﻳﻦ ﻣﻲ ﺗﻮﺍﻥ ﻧﺘﻴﺠﻪ ﮔﺮﻓﺖ‪:‬‬

‫‪n‬‬ ‫‪xn‬‬ ‫‪x0‬‬

‫‪2 Arc cos‬‬ ‫‪= Arc cos‬‬
‫‪yn‬‬ ‫‪y0‬‬

‫ﮐﻪ ﻫﻤﻮﺍﺭﻩ ﺑﺮﺍﻱ ﻫﺮ ‪ n‬ﺑﺮﻗﺮﺍﺭ ﺍﺳﺖ‪.‬‬

‫ﺑﺮﺍﻱ ﺍﻳﻨﮑﻪ ﺍﺯ ﺭﻳﺸﻪ ﺩﻭﻡ ﭘﺮﻫﻴﺰ ﮐﻨﻴﻢ ﺑﻪ ﺟﺎﻱ ‪ xn2 − yn2 ، xn − yn‬ﺭﺍ ﺑﺮﺭﺳﻲ ﻣﻲ ﮐﻨﻴﻢ‪.‬‬

‫ﺩﺍﺭﻳﻢ‪:‬‬
 2 2
2 2 yn − xn
yn +1 − xn +1 =
4

2 2 2 2
⇒ 2 yn +1 − xn +1 = yn − xn

:‫ ﺁﻥ ﺑﻪ ﺩﺳﺖ ﻣﻲ ﺁﻳﺪ‬‫ﮐﻪ ﺑﺎ ﺗﮑﺮﺍﺭ ﭼﻨﺪ ﺑﺎﺭﻩ‬

n 2 2 2 2
2 yn + xn = y0 − x0 (3 )

.‫ ﻣﻔﻴﺪ ﺩﻳﮕﺮﻱ ﺍﺳﺖ‬‫ﮐﻪ ﺍﻳﻦ ﻧﻴﺰ ﺭﺍﺑﻄﻪ‬

s = 1− t2 ‫ﻭ‬ arccos(t ) = arcsin( s )

:‫( ﻣﻲ ﺗﻮﺍﻥ ﻧﺘﻴﺠﻪ ﮔﺮﻓﺖ‬3) ‫( ﻭ‬2 ) ‫ ﻭ ﺭﻭﺍﺑﻂ‬2 ‫ﺍﺯ ﺷﮑﻞ‬

(2) ‫ﺷﮑﻞ‬

2 2 2 2
x0 n xn yn + xn n y0 − x0
arccos = 2 arccos = 2 arcsin = 2 arcsin n
y0 yn yn 2 yn
 ‫‪y02 + x02‬‬
‫ﺍﺳﺖ ﻭ ﺩﺭﻧﺘﻴﺠﻪ ﺭﺍﺑﻄﻪ‪ ‬ﺯﻳﺮ‬ ‫ﺣﺪ ﺳﻤﺖ ﺭﺍﺳﺖ ﻭﻗﺘﻲ ‪ n‬ﺑﻪ ﺳﻤﺖ ﺑﻴﻨﻬﺎﻳﺖ ﻣﻴﻞ ﮐﻨﺪ ﺑﺮﺍﺑﺮ‬
‫‪y‬‬

‫ﺑﻪ ﺩﺳﺖ ﻣﻲ ﺁﻳﺪ‪.‬‬

‫‪y02 − x02‬‬
‫=‪x= y‬‬
‫‪x ‬‬
‫‪arccos 0 ‬‬
‫‪ y0 ‬‬

‫ﻣﺎ ﺍﻳﻦ ﻣﺴﺄﻟﻪ ﺭﺍ ﺑﻪ ﺳﺨﺘﻲ ﻣﻲ ﺗﻮﺍﻧﺴﺘﻴﻢ ﺑﺪﻭﻥ ﺍﺻﻞ ﻋﺪﻡ ﺗﻐﻴﻴﺮ ﺣﻞ ﻧﻤﺎﻳﻴﻢ ﺍﺳﻦ ﻣﺴﺄﻟﻪ ﻳﻘﻴﻨﺎﹰ ﻣﺴﺄﻟﻪ‬

‫ﺍﻱ ﺩﺷﻮﺍﺭ ﺩﺭ ﺑﺮﺍﺑﺮ ﺍﺳﺘﺎﻧﺪﺍﺭﺩ ﺭﻗﺎﺑﺖ ﻫﺎﻱ ﺭﻳﺎﺿﻲ ﻣﻲ ﺑﺎﺷﺪ‪.‬‬

‫ﻣﺜﺎﻝ ‪ . 7‬ﻫﺮ ﻳﮏ ﺍﺯ ﺍﻋﺪﺍﺩ ‪ a1 , a 2 ,K, a n‬ﺑﺮﺍﺑﺮ ‪ 1‬ﻳﺎ ‪ − 1‬ﻫﺴﺘﻨﺪ ﻭ ﺩﺍﺭﻳﻢ‪:‬‬

‫‪S = a1 a 2 a 3 a 4 + a 2 a 3 a 4 a 5 + L + a n a1 a 2 a 3 = 0‬‬

‫ﺛﺎﺑﺖ ﮐﻨﻴﺪ ‪. . 4 | n‬‬

‫ﺣﻞ‪ .‬ﺍﻳﻦ ﻳﮏ ﻣﺴﺄﻟﻪ ﺩﺭ ﻧﻈﺮﻳﻪ‪ ‬ﺍﻋﺪﺍﺩ ﺍﺳﺖ ﺑﺮﺍﻱ ﺣﻞ ﻣﺴﺄﻟﻪ ﺑﺎﺯ ﻫﻢ ﺍﺯ ﺍﺻﻞ ﻋﺪﻡ ﻫﻤﺨﻮﺍﻧﻲ ﺍﺳـﺘﻔﺎﺩﻩ‬

‫ﮐﻨﻴﻢ‪ .‬ﻳﮑﻲ ﺍﺯ ‪ a i‬ﻫﺎ ﺭﺍ ﺑﻪ ‪ − a i‬ﺗﻐﻴﻴﺮ ﻣﻲ ﺩﻫﻴﻢ ﻭ ﺗﻐﻴﻴﺮﺍﺕ ‪ S‬ﺭﺍ ﺑﺮﺭﺳﻲ ﻣﻲ ﮐﻨﻴﻢ ﻣﻲ ﺑﻴﻨﻴﻢ ﮐـﻪ ﻋﻼﻣـﺖ ‪4‬‬

‫ﻼ ﻫﻢ ﻋﻼﻣﺖ ﺑﻮﺩﻧﺪ‪ S ،‬ﺑﻪ ﺍﻧﺪﺍﺯﻩ‪± 8 ‬‬

‫ﺟﻤﻠﻪ‪ ‬ﻣﺘﻮﺍﻟﻲ ﮐﻪ ﺷﺎﻣﻞ ‪ a i‬ﺍﺳﺖ ﺗﻐﻴﻴﺮ ﺧﻮﺍﻫﺪ ﮐﺮﺩ‪ .‬ﺍﮔﺮ ﻫﺮ ‪ 4‬ﺟﻤﻠﻪ ﻗﺒ ﹰ‬

‫ﺗﻐﻴﻴﺮ ﻣﻲ ﮐﻨﺪ ﺍﮔﺮ ‪ 2‬ﺗﺎ ﻣﺜﺒﺖ ﻭ ‪ 2‬ﺗﺎ ﻣﻨﻔﻲ ﺑﻮﺩﻧﺪ‪ S ،‬ﺗﻐﻴﻴﺮﻱ ﻧﻤﻲ ﮐﻨﺪ ﻭ ﺍﮔﺮ ‪ 3‬ﺗﺎ ﻫﻢ ﻋﻼﻣﺖ ﺑﻮﺩﻧﺪ ﻭ ﻳﮑﻲ ﺍﺯ‬

‫ﻋﻼﻣﺖ ﻣﺨﺎﻟﻒ‪ S ،‬ﺑﻪ ﺍﻧﺪﺍﺯﻩ‪ ± 4 ‬ﺗﻐﻴﻴﺮ ﻣﻲ ﮐﻨﺪ‪ .‬ﻣﺸﺎﻫﺪﻩ ﻣﻲ ﮐﻨﻴﻢ ﮐﻪ ﺑﺎﻗﻴﻤﺎﻧﺪﻩ‪ s ‬ﺩﺭ ﺗﻘﺴﻴﻢ ﺑﺮ ‪ 4‬ﻧﻴﺰ ﺛﺎﺑﺖ‬

‫ﺑﺎﻗﻲ ﻣﻲ ﻣﺎﻧﺪ‪ .‬ﺣﺎﻻ ﺗﻐﻴﻴﺮﺍﺕ ﺭﺍ ﻃﻮﺭﻱ ﺍﻧﺠﺎﻡ ﻣﻲ ﺩﻫﻴﻢ ﮐﻪ ﺗﻤﺎﻡ ‪ a i‬ﻫﺎ ﺑﺮﺍﺑﺮ ‪ 1‬ﺷﻮﺩ ﻣﺸﺨﺺ ﺍﺳﺖ ﮐﻪ ﺩﺭ ﺍﻳﻦ‬

‫ﺣﺎﻟﺖ ‪ S = n‬ﺧﻮﺍﻫﺪ ﺷﺪ ﻭﻟﻲ ﺑﺎﻗﻴﻤﺎﻧﺪﻩ‪ ‬ﺁﻥ ﺑﻪ ‪ 4‬ﺗﻐﻴﻴﺮ ﻧﮑﺮﺩﻩ ﺍﺳﺖ ﻳﻌﻨﻲ ﺑﺎﻗﻴﻤﺎﻧﺪﻩ‪ n ‬ﺑﺮ ‪ 4‬ﺑﺮﺍﺑﺮ ‪ 0‬ﺍﺳﺖ‪.‬‬
‫ﻣﺜﺎﻝ ‪ 2 n . 8‬ﺳﻔﻴﺮ ﺑﻪ ﻳﮏ ﻣﻬﻤﺎﻧﻲ ﺩﻋﻮﺕ ﺷﺪﻩ ﺍﻧﺪ ﮐﻪ ﻫـﺮ ﮐـﺪﺍﻡ ﺣـﺪﺍﮐﺜﺮ ‪ n − 1‬ﺩﺷـﻤﻦ ﺩﺭ ﺑـﻴﻦ‬

‫ﺳﻔﺮﺍﻱ ﺩﻳﮕﺮ ﺩﺍﺭﻧﺪ‪ .‬ﺛﺎﺑﺖ ﮐﻨﻴﺪ ﺍﻳﻦ ‪ 2n‬ﺳﻔﻴﺮ ﺭﺍ ﻣﻲ ﺗﻮﺍﻥ ﺩﻭﺭ ﻳﮏ ﻣﻴﺰﮔﺮﺩ ﻃﻮﺭﻱ ﻧﺸﺎﻧﺪ ﮐـﻪ ﺩﻭ ﻃـﺮﻑ ﻫـﺮ‬

‫ﺳﻔﻴﺮ‪ ،‬ﺳﻔﻴﺮﺍﻧﻲ ﻗﺮﺍﺭ ﮔﺮﻓﺘﻪ ﺑﺎﺷﻨﺪ ﮐﻪ ﺑﺎ ﺍﻭ ﺩﺷﻤﻦ ﻧﺒﺎﺷﻨﺪ‪.‬‬

‫ﺣﻞ‪ .‬ﺍﻳﻦ ﻣﺴﺄﻟﻪ ﺩﺍﺭﺍﻱ ﺣﻠﻲ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﻧﻈﺮﻳﻪ ﮔﺮﺍﻑ ﻣﻲ ﺑﺎﺷﺪ‪ ،‬ﺍﻣﺎ ﺍﻳﻨﺠﺎ ﻣﺎ ﺳـﻌﻲ ﻣـﻲ ﮐﻨـﻴﻢ ﺑـﺎ‬

‫ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﭘﺎﻳﺎﻥ ﭘﺬﻳﺮﻱ ﺁﻥ ﺭﺍ ﺣﻞ ﮐﻨﻴﻢ‪ :‬ﺩﺭ ﺍﺑﺘﺪﺍ ﺍﻓﺮﺍﺩ ﺭﺍ ﺑﻪ ﺻﻮﺭﺕ ﺗﺼﺎﺩﻓﻲ ﺩﻭﺭ ﻣﻴﺰﮔﺮﺩ ﻣﻲ ﻧﺸﺎﻧﻴﻢ ﻓﺮﺽ‬

‫ﮐﻨﻴﺪ ‪ H‬ﺗﻌﺪﺍﺩ ﺯﻭﺝ ﻫﺎﻱ ﺩﺷﻤﻦ ﮐﻪ ﮐﻨﺎﺭ ﻫﻢ ﻫﺴﺘﻨﺪ‪ ،‬ﺑﺎﺷﺪ‪ .‬ﺑﺎﻳﺪ ﺭﻭﺷﻲ ﺍﺭﺍﺋﻪ ﺩﻫﻴﻢ ﮐﻪ ﺩﺭ ﻫﺮ ﻣﺮﺣﻠﻪ ﺑﺎﻋـﺚ‬

‫ﮐﺎﻫﺶ ﻣﻘﺪﺍﺭ ‪ H‬ﮔﺮﺩﺩ‪ .‬ﻓﺮﺽ ﮐﻨﻴﺪ ‪ A‬ﻭ ‪ B‬ﺩﻭ ﺳﻔﻴﺮ ﻣﺠﺎﻭﺭ ﻭ ﺩﺷﻤﻦ ﺑﺎﺷﻨﺪ‪ ،‬ﺑﻪ ﻃﻮﺭﻱ ﮐﻪ ‪ B‬ﺳﻤﺖ ﺭﺍﺳـﺖ ‪A‬‬

‫ﺑﺎﺷﺪ )ﺷﮑﻞ ‪ (3‬ﺛﺎﺑﺖ ﻣﻲ ﮐﻨﻴﻢ ﺍﻓﺮﺍﺩ ﻣﺠﺎﻭﺭ '‪ A‬ﻭ '‪ B‬ﻭﺟﻮﺩ ﺩﺍﺭﺩ ﺑﻪ ﻃﻮﺭﻱ ﮐﻪ '‪ B‬ﺳﻤﺖ ﺭﺍﺳـﺖ '‪ A‬ﺑﺎﺷـﺪ ﻭ‬

‫) '‪ (A,A‬ﻭ ) '‪ (B,B‬ﺯﻭﺝ ﻫﺎﻱ ﺩﻭﺳﺖ ﺑﺎﺷﻨﺪ‪ .‬ﻣﻲ ﺩﺍﻧﻴﻢ ‪ A‬ﺣﺪﺍﻗﻞ ‪ n‬ﺩﻭﺳﺖ ﺩﺭ ﺑﻴﻦ ﺳﻔﺮﺍﻱ ﮐﺸﻮﺭﻫﺎ ﺩﺍﺭﺩ‪ .‬ﺩﻭﺭ‬

‫ﻣﻴﺰﮔﺮﺩ ‪ n‬ﻧﻔﺮ ﻧﺸﺴﺘﻪ ﺍﻧﺪ ﮐﻪ ﻫﺮ ﮐﺪﺍﻡ ﺩﺳﺖ ﺭﺍﺳﺖ ﻳﮑﻲ ﺍﺯ ﺍﻳﻦ ‪ n‬ﻧﻔﺮ ﻗﺮﺍﺭ ﺩﺍﺭﻧﺪ‪ .‬ﺍﮔﺮ ﻫﻤﻪ‪ ‬ﺍﻳﻦ ﺍﻓـﺮﺍﺩ ﺑـﺎ ‪B‬‬

‫ﺩﺷﻤﻦ ﺑﺎﺷﻨﺪ ‪ B‬ﺑﻴﺸﺘﺮ ﺍﺯ ‪ n − 1‬ﺩﺷﻤﻦ ﺧﻮﺍﻫﺪ ﺩﺍﺷﺖ ﺑﻨﺎﺑﺮﺍﻳﻦ ﺳﻔﻴﺮ '‪ B‬ﻭﺟﻮﺩ ﺩﺍﺭﺩ ﮐﻪ ﺳﻤﺖ ﺭﺍﺳﺖ ﺳﻔﻴﺮ‬

‫'‪ A‬ﻗﺮﺍﺭ ﮔﺮﻓﺘﻪ ﺑﺎﺷﺪ ﺑﻪ ﻃﻮﺭﻱ ﮐﻪ ) '‪ (B,B‬ﻭ ) '‪ (A,A‬ﺑﺎ ﻫﻢ ﺩﻭﺳﺖ ﺑﺎﺷﻨﺪ‪.‬‬

‫ﻣﻄﺎﺑﻖ ﺷﮑﻞ ‪ 3‬ﺁﺭﺍﻳﺶ ﺟﺪﻳﺪﻱ ﺍﺯ ﺍﻓﺮﺍﺩ ﺑﺎ ‪ H‬ﮐﻤﺘﺮ ﻣﻲ ﺗﻮﺍﻥ ﺳﺎﺧﺖ‪ .‬ﺩﻗﺖ ﮐﻨﻴﺪ ﺩﺭ ﺷـﮑﻞ ﺟﺪﻳـﺪ‪،‬‬

‫ﻗﺮﺍﺭ ﮔﺮﻓﺘﻦ ﺍﻓﺮﺍﺩ ﺑﻴﻦ ‪ B‬ﻭ '‪ A‬ﺩﺭ ﺟﻬﺖ ﺧﻼف ﻗﺮار ﮔﺮﻓﺘﻦ ﻗﺒﻠﯽ اﺳﺖ‪.‬‬

‫ﺷﮑﻞ )‪(3‬‬ ‫ﺷﮑﻞ )‪(4‬‬

‫ﻣﺴﺄﻟﻪ ﻓﻮﻕ ﻳﮏ ﻣﺴﺎﺃﻟﻪ‪ ‬ﻧﻈﺮﻳﻪ ﮔﺮﺍﻑ ﺍﺳﺖ ﻭ ﻣﻌﺎﺩﻝ ﺍﻳﻦ ﻣﺴﺄﻟﻪ ﺍﺳﺖ ﮐﻪ ﺍﮔﺮ ﺩﺭ ﻳﮏ ﮔﺮﺍﻑ ﺳﺎﺩﻩ ﺑﺎ ‪n‬‬

‫‪n‬‬
‫ﺑﺎﺷﺪ ﺁﻧﮕﺎﻩ ﺁﻥ ﮔﺮﺍﻑ ﺩﺍﺭﺍﻱ ﺩﻭﺭ ﻫـﺎﻣﻴﻠﺘﻮﻧﻲ ﺍﺳـﺖ‪ .‬ﺭﻭﺵ ﺣـﻞ‬ ‫ﺭﺃﺱ ﺩﺭﺟﻪ‪ ‬ﻫﺮ ﺭﺃﺱ ﺑﺰﺭﮔﺘﺮ ﻳﺎ ﻣﺴﺎﻭﻱ‬
‫‪2‬‬

‫ﺩﻳﮕﺮ ﺍﻳﻦ ﻣﺴﺄﻟﻪ ﺍﺯ ﻃﺮﻳﻖ ﺍﺳﺘﻘﺮﺍﺀ ﻗﻬﻘﺮﺍﻳﻲ ﺭﻭﻱ ﺗﻌﺪﺍﺩ ﻳﺎﻝ ﻫﺎﻱ ﮔﺮﺍﻑ ﺍﺳﺖ‪ .‬ﺣﺎﻟﺖ ﭘﺎﻳـﻪ‪ ‬ﺍﺳـﺘﻘﺮﺍﺀ ﺣـﺎﻟﺘﻲ‬

‫ﺍﺳﺖ ﮐﻪ ﮔﺮﺍﻑ ﺳﺎﺩﻩ ﻭ ﮐﺎﻣﻞ ﺩﺍﺭﻳﻢ‪.‬‬

‫ﻣﺜﺎﻝ ‪ . 9‬ﺑﻪ ﻫﺮ ﺭﺃﺱ ﻳﮏ ﭘﻨﺞ ﺿﻠﻌﻲ ﻋﺪﺩ ﺻﺤﻴﺢ ‪ (i = 1,K ,5) xi‬ﺭﺍ ﻧﺴﺒﺖ ﻣﻲ ﺩﻫﻴﻢ ﺑﻪ ﻃﻮﺭﻱ ﮐﻪ‬

‫‪i =5‬‬
‫‪ s = ∑ xi > 0‬ﺩﺭ ﻫﺮ ﻣﺮﺣﻠﻪ ‪ 3‬ﻋﺪﺩ ‪ y ،z‬ﻭ ‪ x‬ﮐﻪ ﺑﻪ ﺗﺮﺗﻴﺐ ﺍﻋﺪﺍﺩ ﻧﺴﺒﺖ ﺩﺍﺩﻩ ﺷﺪﻩ ﺑﻪ ‪ 3‬ﺭﺃﺱ ﻣﺘﻮﺍﻟﻲ ﭘﻨﺞ‬
‫‪i =1‬‬

‫ﺿﻠﻌﻲ ﻫﺴﺘﻨﺪ ﺭﺍ ﺍﻧﺘﺨﺎﺏ ﻣﻲ ﮐﻨﻴﻢ ﺑﻪ ﻃﻮﺭﻱ ﮐﻪ ‪ y < 0‬ﺑﺎﺷﺪ ﻭ ﺳﻪ ﺗﺎﻳﻲ )‪ ( x, y, z‬ﺭﺍ ﺗﺒﺪﻳﻞ ﺑﻪ ﺳﻪ ﺗـﺎﻳﻲ‬

‫)‪ ( x + y,− y, z + y‬ﻣﻲ ﮐﻨﻴﻢ ﻭ ﺍﻳﻦ ﮐﺎﺭ ﺭﺍ ﺗﺎ ﺯﻣﺎﻧﻲ ﮐﻪ ﻋﺪﺩ ﮐﻮﭼﮑﺘﺮ ﺍﺯ ﺻﻔﺮﻱ ﻭﺟﻮﺩ ﺩﺍﺷﺘﻪ ﺑﺎﺷـﺪ ﺍﺩﺍﻣـﻪ‬

‫ﻣﻲ ﺩﻫﻴﻢ‪ .‬ﺁﻳﺎ ﺍﻳﻦ ﻋﻤﻞ ﭘﺎﻳﺎﻥ ﻣﻲ ﻳﺎﺑﺪ ﻳﺎ ﺧﻴﺮ؟ )ﺍﻳﻦ ﻣﺴﺄﻟﻪ ﻣﺸﮑﻠﺘﺮﻳﻦ ﻣﺴﺄﻟﻪ‪ ‬ﺍﻟﻤﭙﻴﺎﺩ ﺑﻴﻦ ﺍﻟﻤﻠﻠـﻲ ﺭﻳﺎﺿـﻲ‬

‫ﺳﺎﻝ ‪ 1986‬ﺑﻮﺩ(‪.‬‬

‫ﺣﻞ‪ .‬ﺍﻳﻦ ﻋﻤﻞ ﻫﻤﻴﺸﻪ ﭘﺎﻳﺎﻥ ﭘﺬﻳﺮ ﺍﺳﺖ‪ .‬ﮐﻠﻴﺪ ﺍﺛﺒﺎﺕ )ﻫﻤﺎﻧﻨﺪ ﻣﺜﺎﻝ ﻫﺎﻱ ‪ 4‬ﻭ ‪ (8‬ﻳﺎﻓﺘﻦ ﺗـﺎﺑﻊ ﺻـﺤﻴﺢ‬

‫) ‪ f ( x1 ,K, x5‬ﺍﺳﺖ ﺑﻪ ﻃﻮﺭﻱ ﮐﻪ ﻣﻘﺪﺍﺭ ‪ f‬ﺩﺭ ﻫﺮ ﻣﺮﺣﻠﻪ ﮐﻪ ‪ 3‬ﻋﺪﺩ ﺭﺍ ﻋﻮﺽ ﻣﻲ ﮐﻨﻴﻢ ﮐـﺎﻫﺶ ﻳﺎﺑـﺪ‪ .‬ﺍﺯ ‪11‬‬

‫ﺩﺍﻧﺶ ﺁﻣﻮﺯﻱ ﮐﻪ ﺍﻳﻦ ﻣﺴﺄﻟﻪ ﺭﺍ ﺣﻞ ﮐﺮﺩﻧﺪ ﻳﮑﻲ ﺗﺎﺑﻌﻲ ﻣﺸﺎﺑﻪ ﺗﺎﺑﻊ ﺯﻳﺮ ﻣﻌﺮﻓﻲ ﮐﺮﺩ‪:‬‬

‫‪5‬‬
‫‪f ( x1 , x2 , x3 , x4 , x5 ) = ∑ ( xi − xi + 2 ) , x6 = x1 , x7 = x2‬‬
‫‪2‬‬

‫‪i =1‬‬

‫ﻓﺮﺽ ﮐﻨﻴﺪ ‪ . y = x4 < 0‬ﺩﺭ ﺍﻳﻦ ﺻﻮﺭﺕ ﺍﮔﺮ ‪ fnew‬ﻣﻘﺪﺍﺭ ‪ f‬ﭘﺲ ﺍﺯ ﺍﻧﺠﺎﻡ ﻳﮏ ﺗﻐﻴﻴـﺮ ﺑـﻪ ﻣﺮﮐﺰﻳـﺖ‬

‫‪ x4‬ﺑﺎﺷﺪ ﻭ ‪ fold‬ﻣﻘﺪﺍﺭ ‪ f‬ﻗﺒﻞ ﺍﺯ ﺗﻐﻴﻴﺮ ﺑﺎﺷﺪ ﺩﺍﺭﻳﻢ‪:‬‬

‫‪fnew − fold = 2sx4‬‬

‫ﻭ ﺍﺯ ﺁﻧﺠﺎ ﮐﻪ ‪ s > 0‬ﻣﻘﺪﺍﺭ ‪ fnew − fold‬ﻣﻨﻔﻲ ﺍﺳﺖ ﻳﻌﻨﻲ ﺗﺎﺑﻊ ‪ f‬ﺩﺭ ﻫﺮ ﻣﺮﺣﻠـﻪ ﺩﺭ ﺣـﺎﻝ ﮐـﺎﻫﺶ‬

‫ﺍﺳﺖ‪ .‬ﺑﻨﺎﺑﺮﺍﻳﻦ ﺍﮔﺮ ﺍﻳﻦ ﻋﻤﻞ ﭘﺎﻳﺎﻥ ﻧﺎﭘﺬﻳﺮ ﺑﺎﺷﺪ ﻣﺎ ﻳﮏ ﺩﻧﺒﺎﻟﻪ‪ ‬ﻧﺎﻣﺘﻨـﺎﻫﻲ ﺍﮐﻴـﺪﺍﹰ ﻧﺰﻭﻟـﻲ ﺍﺯ ﺍﻋـﺪﺍﺩ ﺻـﺤﻴﺢ ﻭ‬

‫ﻏﻴﺮﻣﻨﻔﻲ ﻳﺎﻓﺘﻪ ﺍﻳﻢ ﮐﻪ ﻏﻴﺮﻣﻤﮑﻦ ﺍﺳﺖ‪.‬‬

‫»ﺑﺮﻧﺎﻟﺪ ﭼﺎﺯﻝ« ﺍﺯ ﺩﺍﻧﺸﮕﺎﻩ ﭘﺮﻳﻨﺴﺘﻮﻥ ﺍﻳﻦ ﺳﻮﺍﻝ ﺭﺍ ﻣﻄﺮﺡ ﮐﺮﺩ‪ :‬ﭼﻨﺪ ﻣﺮﺣﻠﻪ ﻻﺯﻡ ﺍﺳﺖ ﺗﺎ ﺍﻟﮕـﻮﺭﻳﺘﻢ‬

‫ﻣﺘﻮﻗــﻒ ﺷــﻮﺩ‪ .‬ﺍﻭ ﺩﻧﺒﺎﻟــﻪ‪ ‬ﻧﺎﻣﺘﻨــﺎﻫﻲ ‪ S‬ﺍﺯ ﻣﺠﻤــﻮﻉ ﻫــﺎﻳﻲ ﺭﺍ ﺩﺭ ﻧﻈــﺮ ﮔﺮﻓــﺖ ﮐــﻪ ﺑــﻪ ﺻــﻮﺭﺕ‬

‫‪ S (i, j ) = xi + L + x j −1‬ﺗﻌﺮﻳﻒ ﻣﻲ ﺷﻮﻧﺪ‪ .( j > i,1 ≤ i ≤ 5 ) ( K, x7 = x2 , x6 = x1 ) .‬ﻭﻗﺘـﻲ ﺑـﻪ‬

‫ﻋﻨﻮﺍﻥ ﻣﺜﺎﻝ ‪ x4‬ﺑﻪ ‪) − x4‬ﻫﻤﺎﻥ ﮔﻮﻧﻪ ﮐﻪ ﺩﺭ ﺑﺎﻻ ﻣﺜﺎﻝ ﮔﻔﺘﻪ ﺷﺪ( ﺗﺒﺪﻳﻞ ﻣﻲ ﺷﻮﺩ ﺗﻨﻬﺎ ﺟﻤﻠﻪ‪ ‬ﻣﻨﻔﻲ ﮐﻪ ﺑﻴﻦ‬

‫ﺍﻋﺪﺍﺩ ‪ S‬ﻣﺜﺒﺖ ﻣﻲ ﺷﻮﺩ ‪ S (4,5) = x4‬ﺍﺳﺖ ﮐﻪ ﺗﻐﻴﻴﺮ ﻣﻲ ﮐﻨﺪ ﻭ ﺑﻪ ‪) − x4‬ﻫﻤﺎﻥ ﮔﻮﻧﻪ ﮐﻪ ﺩﺭ ﻣﺜـﺎﻝ ﺑـﺎﻻ‬

‫ﮔﻔﺘﻪ ﺷﺪ( ﺗﺒﺪﻳﻞ ﻣﻲ ﺷﻮﺩ ﺗﻨﻬﺎ ﺟﻤﻠﻪ‪ ‬ﻣﻨﻔﻲ ﮐﻪ ﺑﻴﻦ ﺍﻋﺪﺍﺩ ‪ S‬ﮐﻪ ﻣﻨﻔﻲ ﺑﻮﺩ ﻣﺜﺒﺖ ﻣـﻲ ﺷـﻮﺩ‪ .‬ﺍﺭ ﺁﻧﺠـﺎ ﮐـﻪ‬

‫‪ s > 0‬ﺍﺳﺖ‪ S ،‬ﺷﺎﻣﻞ ﺗﻌﺪﺍﺩ ﻣﺘﻨﺎﻫﻲ ﻋﺪﺩ ﻣﻨﻔﻲ ﻣﻲ ﺑﺎﺷﺪ ﺑﻨﺎﺑﺮﺍﻳﻦ ﺗﻌﺪﺍﺩ ﻣﺮﺍﺣﻞ ﻻﺯﻡ ﺑـﺮﺍﻱ ﺗﻮﻗـﻒ ﺑﺮﺍﺑـﺮ‬

‫ﺗﻌﺪﺍﺩ ﺍﻋﺪﺍﺩ ﻣﻨﻔﻲ ﺩﺍﺧﻞ ‪ S‬ﻣﻲ ﺑﺎﺷﺪ ﻫﻤﭽﻨﻴﻦ ﺩﻳﺪﻳﻢ ﮐﻪ ﻧﻴﺎﺯﻱ ﺑﻪ ﺻﺤﻴﺢ ﺑﻮﺩﻥ ﻣﻘﺪﺍﺭ ‪ xi‬ﻫﺎ ﻫﻢ ﻧﻴﺴﺖ‪.‬‬

‫ﻣﻼﺣﻈﻪ ‪ .‬ﺟﺎﻟﺐ ﺍﺳﺖ ﮐﻪ ﻳﮏ ﻓﺮﻣﻮﻝ ﺭﺍ ﺑـﺎ ﮐـﺎﻣﭙﻴﻮﺗﺮ ﺑﻴـﺎﺑﻴﻢ ﮐـﻪ ﺍﻳـﻦ ﻓﺮﻣـﻮﻝ ﺑـﺮﺍﻱ ﻫـﺮ ﻭﺭﻭﺩﻱ‬

‫)‪ (a , b, c, d , e‬ﺍﺯ ﺍﻋﺪﺍﺩ ﺗﻌﺪﺍﺩ ﻣﺮﺍﺣﻞ ﻻﺯﻡ ﺗﺎ ﺯﻣﺎﻥ ﺗﻮﻗﻒ ﺭﺍ ﺑﻴﺎﺑﺪ‪ .‬ﻳﺎﻓﺘﻦ ﺍﻳﻦ ﻓﺮﻣﻮﻝ ﺑﺮﺍﻱ ﺣﺎﻟﺖ ﻫـﺎﻱ ﮐـﻪ‬

‫‪ s = 1‬ﺍﺳﺖ ﭼﻨﺪﺍﻥ ﻣﺸﮑﻞ ﻧﻴﺴﺖ ﺑﺮﺍﻱ ﻣﺜﺎﻝ ﺑﺮﺍﻱ ﻭﺭﻭﺩﻱ ) ‪ (n, n,1 − 4n, n, n‬ﺗﻌﺪﺍﺩ ﻣﺮﺍﺣـﻞ ‪20 n − 10‬‬

‫ﺍﺳﺖ‪.‬‬

‫ﻣﺜﺎﻝ ‪ . 10‬ﮐﺎﻫﺶ ﻣﺮﺑﻊ ﻫﺎ )ﻳﮏ ﺗﺤﻘﻴﻖ ﺗﺠﺮﺑﻲ( ‪ :‬ﺍﺯ ﭼﻬﺎﺭﺗﺎﻳﻲ ) ‪ S = (a , b, c, d‬ﺍﺯ ﺍﻋﺪﺍﺩ ﺻﺤﻴﺢ ﻭ‬

‫ﻣﺜﺒﺖ ﺷﺮﻭﻉ ﻣﻲ ﮐﻨﻴﻢ ﻭ ﭼﻬﺎﺭﺗﺎﻳﻲ ﺟﺪﻳـﺪ )| ‪ S1 = T (S ) = (| a − b |, | b − c |, | c − d |, | d − a‬ﺭﺍ ﺍﺯ ‪S‬‬

‫ﺑﻪ ﺩﺳﺖ ﻣﻲ ﺁﻭﺭﻳﻢ ﺑﻪ ﻫﻤﻴﻦ ﺗﺮﺗﻴﺐ ﺩﻧﺒﺎﻟﻪ‪ ‬ﻧﺎﻣﺘﻨﺎﻫﻲ ‪ ...‬ﻭ ) ‪ S1 , S2 = T ( S1 ), S3 = T (S2‬ﺭﺍ ﻣﻲ ﺳﺎﺯﻳﻢ ﺁﻳـﺎ‬

‫ﻫﻤﻴﺸﻪ ﺩﺭ ﺍﻳﻦ ﺩﻧﺒﺎﻟﻪ ﻫﺎ ﺑﻪ ﭼﻬﺎﺭﺗﺎﻳﻲ ﻫﺎﻱ )‪ (0,0,0,0‬ﻣﻲ ﺭﺳﻴﻢ‪.‬‬

‫ﺣﻞ ‪ .‬ﺑﺮاي اﯾﻨﮑﻪ ﺟﻮاب را ﺣﺪس ﺑﺰﻧﯿﻢ ﭼﻨﺪ ﻣﺜﺎل ﺷﺮوع ﻣﯽ ﮐﻨﯿﻢ‪:‬‬

‫)‪(0,3,10,13) → (3,7,3,13) → (4,4,10,10‬‬

‫)‪→ (0,6,0,6) → (6,6,6,6‬‬

‫)‪→ (0,0,0,0‬‬

‫)‪(8,7,3,107) → (9,14,104,99) → (0,90,5,90‬‬

‫)‪→ (85,85,85,85) → (0,0,0,0‬‬

‫)‪(91,108,95,294) → (17,13,99,203) → (4,8,6,104,186‬‬

‫)‪→ (82,18,82,182) → (64,64,100,100‬‬

‫)‪→ (0,36,0,36) → (36,36,36,36‬‬

‫)‪→ (0,0,0,0‬‬

‫ﻣﺸﺎﻫﺪﺍﺕ ‪.‬‬

‫)‪ .(1‬ﺍﮔﺮ ‪ max S‬ﺭﺍ ﺑﺰﺭﮔﺘﺮﻳﻦ ﻋﻀﻮ ‪ 4‬ﺗﺎﻳﻲ ‪ S‬ﺗﻌﺮﻳﻒ ﮐﻨﻴﻢ ﺩﺭ ﺍﻳﻦ ﺻﻮﺭﺕ‪:‬‬

‫‪max Si +1 ≤ max Si‬‬

‫ﻭ ﻫﻤﭽﻨﻴﻦ ﺗﺎ ﺯﻣﺎﻧﻲ ﮐﻪ ‪ max Si > 0‬ﺩﺍﺭﻳﻢ‪:‬‬

‫‪max Si + 4 < max Si‬‬

‫ﺍﮔﺮ ﺍﻳﻦ ﻧﺎﻣﺴﺎﻭﻱ ﻫﺎ ﺍﺛﺒﺎﺕ ﺷﻮﺩ‪ ،‬ﻣﺴﺄﻟﻪ ﺛﺎﺑﺖ ﺷﺪﻩ ﺍﺳﺖ‪.‬‬

‫) ‪ S (2‬ﻭ ‪ 4) tS‬ﺗﺎﻳﻲ ﮐﻪ ﺍﺯ ﺿﺮﺏ ﺍﻋﺪﺍﺩ ‪ S‬ﺩﺭ ﻋﺪﺩ ‪ t‬ﺑﻪ ﺩﺳﺖ ﻣﻲ ﺁﻳﺪ( ﺩﺍﺭﺍﻱ ﻳـﮏ ﻃـﻮﻝ ﻋﻤـﺮ ﻣـﻲ‬

‫ﺑﺎﺷﻨﺪ‪.‬‬

‫) ‪ (3‬ﺑﻌﺪ از ‪ 4‬ﻣﺮﺣﻠﻪ ﻫﺮ ‪ 4‬ﻋﺪد ﺑﻪ دﺳﺖ آﻣﺪه ﺣﺘﻤﺎً زوج ﺧﻮاﻫﻨﺪ ﺑﻮد‪ .‬ﺑﺮاي اﺛﺒﺎت اﯾـﻦ ﻧﮑﺘـﻪ ﻣـﯽ‬

‫ﺗﻮاﻧﯿﻢ ﻣﺤﺎﺳﺒﺎت را ﺑﻪ ﭘﯿﻤﺎﻧﻪ‪ 2 ‬اﻧﺠﺎم دﻫﯿﻢ و ﺗﻤﺎم ﺣﺎﻟﺖ ﻫﺎ را آزﻣﺎﯾﺶ ﮐﻨﯿﻢ ﺑﻪ ﺧﺎﻃﺮ اﯾﻨﮑـﻪ ﺗﻐﯿﯿـﺮ دوري‬

‫ﺟﺎي ‪ 4‬ﺗﺎﯾﯽ ﻫﺎ ﺗﺄﺛﯿﺮي در اﺳﺘﺪﻻل ﻧﺪارد ﺗﻨﻬﺎ ﭼﻨﺪ ﺣﺎﻟﺖ ﺳﺎده را ﻻزم اﺳﺖ آزﻣﺎﯾﺶ ﮐﻨﯿﻢ‪:‬‬

‫‪0001 → 0011 → 0101 → 1111 → 0000‬‬

‫ﻭ‬

‫ﺑﻘﻴﻪ ﻣﺸﺎﺑﻪ ﺑﺎﻻ → ‪1110 → 0011‬‬

‫ﻣﻼﺣﻈﻪ‪ .‬ﺩﺭ ﺍﺛﺒﺎﺕ ﻣﺸﺎﻫﺪﻩ‪ (3) ‬ﺍﺯ ﺗﻘﺎﺭﻥ ﺩﻭﺭﻱ ﺍﺳﺘﻔﺎﺩﻩ ﮐـﺮﺩﻳﻢ ﻣـﺎ ﻫﻤﻴـﺸﻪ ﺑﺎﻳـﺴﺘﻲ ﺑﺘـﻮﺍﻧﻴﻢ ﺩﺭ‬

‫ﺻﻮﺭﺕ ﺍﻣﮑﺎﻥ ﺍﺯ ﺍﻳﻦ ﺍﻳﺪﻩ ﺍﺳﺘﻔﺎﺩﻩ ﮐﻨﻴﻢ‪ .‬ﺍﻟﺒﺘﻪ ﺍﻳﻦ ﺑﺨﺶ ﺑﻪ ﺍﻳﻦ ﻣﻮﺿﻮﻉ ﺍﺧﺘﺼﺎﺹ ﻧﺪﺍﺭﺩ‪.‬‬

‫ﻣﺸﺎﻫﺪﻩ‪ (3 ) ‬ﺍﺛﺒﺎﺕ ﺷﺪ‪ .‬ﭘﺲ ﺣﺪﺍﮐﺜﺮ ﺑﻌﺪ ﺍﺯ ‪ 4‬ﻣﺮﺣﻠﻪ ﻣﺎ ﺑﺎ ‪ 4‬ﻋﺪﺩ ﺯﻭﺝ ﺳﺮﻭﮐﺎﺭ ﺩﺍﺭﻳﻢ ﻭ ﺣﺪﺍﮐﺜﺮ ﺑﻌﺪ‬

‫‪k‬‬
‫ﺍﺯ ‪ 8‬ﻣﺮﺣﻠﻪ ﻫﺮ ﺟﻤﻠﻪ ﻣﻀﺮﺏ ‪ 22‬ﺧﻮﺍﻫﺪ ﺑﻮﺩ ﻭ ‪ ...‬ﻭ ﺑﻌﺪ ﺍﺯ ‪ 4 k‬ﻣﺮﺣﻠﻪ ﻫﺮ ﻋﺪﺩ ﺩﻧﺒﺎﻟﻪ ﻣـﻀﺮﺏ ‪ 2‬ﺧﻮﺍﻫـﺪ‬

‫‪k‬‬
‫ﺑﻮﺩ‪ .‬ﺍﮔﺮ ‪ k‬ﺭﺍ ﻃﻮﺭﻱ ﺗﻌﻴﻴﻦ ﮐﻨﻴﻢ ﮐﻪ ‪ max S < 2‬ﺑﺎﺷﺪ ﺩﺭ ﺍﻳﻦ ﺻﻮﺭﺕ ﭼﻮﻥ ﺑﻴﺸﺘﺮﻳﻦ ﻋـﺪﺩ ‪ S‬ﺩﺭ ﭼﻬـﺎﺭ‬

‫ﺗﺎﻳﻲ ﻫﺎﻱ ﺑﻌﺪﻱ ﺑﺰﺭﮔﺘﺮ ﻧﻤﻲ ﺷﻮﺩ ﺑﻨﺎﺑﺮﺍﻳﻦ ﭘﺲ ﺍﺯ ‪ 4 k‬ﻣﺮﺣﻠﻪ ﺑﺎﻳﺴﺘﻲ ﻫﺮ ‪ 4‬ﻋﺪﺩ ﺑﺮﺍﺑﺮ ‪ 0‬ﺑﺎﺷﺪ )ﭼﻮﻥ ﺑﻌﺪ ﺍﺯ‬

‫‪k‬‬ ‫‪k‬‬
‫‪ 4 k‬ﻣﺮﺣﻠﻪ ﺗﻤﺎﻡ ﺍﻋﺪﺍﺩ ﻣﻀﺮﺏ ‪ 2‬ﻫﺴﺘﻨﺪ ﻭﻟﻲ ﻫﻤﮕﻲ ﺍﺯ ‪ 2‬ﮐﻮﭼﮑﺘﺮﻧﺪ ﺑﻨﺎﺑﺮﺍﻳﻦ ﺑﺎﻳـﺪ ‪ 0‬ﺑﺎﺷـﻨﺪ‪ . (.‬ﺍﮔـﺮ‬

‫ﻣﺸﺎﻫﺪﻩ‪ ‬ﺍﻭﻝ ﻫﻢ ﺍﺛﺒﺎﺕ ﺷﻮﺩ ﻣﻲ ﺗﻮﺍﻥ ﺭﻭﺵ ﺩﻳﮕﺮﻱ ﺑﺮﺍﻱ ﺣﻞ ﻣﺴﺄﻟﻪ ﺑﻪ ﺩﺳﺖ ﺁﻭﺭﺩ‪ .‬ﺑﺮﺍﻱ ﺍﺛﺒـﺎﺕ ﻣـﺸﺎﻫﺪﻩ‪‬‬

‫ﺍﻭﻝ ﻣﻲ ﺗﻮﺍﻥ ﺍﺯ ﺍﺻﻞ ﺍﮐﺴﺘﺮﻣﺎﻝ ﺍﺳﺘﻔﺎﺩﻩ ﮐﺮﺩ ﺍﻧﺘﺨﺎﺏ ﻋﻨﺼﺮ ﻣﺎﮔﺰﻳﻤﺎﻝ! ﮐﻪ ﺩﺭ ﺑﺨﺶ ‪ 3‬ﺑﻪ ﺁﻥ ﻣﻲ ﭘﺮﺩﺍﺯﻳﻢ‪.‬‬

‫ﻧﺘﺎﻳﺞ ‪ .‬ﺍﻟﻒ‪ .‬ﺍﮔﺮ ﺍﺯ ﺍﻋﺪﺍﺩ ﺣﻘﻴﻘﻲ ﺷﺮﻭﻉ ﮐﻨﻴﻢ ﺑﺮﺍﻱ ﻣﺜﺎﻝ‪:‬‬

 ‫‪2‬‬ ‫‪π‬‬ ‫‪3‬‬ ‫‪e‬‬
‫‪π− 2‬‬ ‫‪π− 3‬‬ ‫‪e− 3‬‬ ‫‪e− 2‬‬
‫‪3− 2‬‬ ‫‪π −e‬‬ ‫‪3− 2‬‬ ‫‪π −e‬‬
‫‪π −e− 3 + 2‬‬ ‫‪π −e 3 + 2‬‬ ‫‪π −2 3+ 2‬‬ ‫‪π −e 3+ 2‬‬
‫‪0‬‬ ‫‪0‬‬ ‫‪0‬‬ ‫‪0‬‬

‫ﻣﻲ ﺗﻮﺍﻥ ﻧﺘﺎﻳﺞ ﺧﺎﺻﻲ ﺑﻪ ﺩﺳﺖ ﺁﻭﺭﺩ‪ .‬ﮐﻪ ﻫﻨﻮﺯ ﺍﺛﺒﺎﺕ ﻧﺸﺪﻩ ﺍﺳﺖ‪ .‬ﺁﻳﺎ ﻫﻤﻴـﺸﻪ ﺑـﻪ )‪ (0,0,0,0‬ﻣـﻲ‬

‫‪2‬‬ ‫‪3‬‬
‫ﺭﺳﻴﻢ؟ ﻓﺮﺽ ﮐﻨﻴﺪ ) ‪ S = (1, t , t , t‬ﺩﺍﺭﻳﻢ‪:‬‬

‫])‪T (S ) = [(t − 1), t (t − 1), (t − 1)t 2 , (t − 1)(t 2 + t + 1‬‬

‫ﺍﮔﺮ ‪ t‬ﺑﻪ ﮔﻮﻧﻪ ﺍﻱ ﺍﺧﺘﻴﺎﺭ ﺷﻮﺩ ﮐﻪ ‪ t 3 = t 2 + t + 1‬ﺷﻮﺩ‪ .‬ﺍﻳﻦ ﻋﻤﻞ ﻫﺮﮔﺰ ﭘﺎﻳﺎﻥ ﻧﻤﻲ ﻳﺎﺑﺪ )ﺑﺮﺍﻱ ﻣﺜـﺎﻝ‬

‫ﺍﮔﺮ ‪ ( t = 1 / 8392867552 K‬ﻫﻤﭽﻨﻴﻦ ﺍﻳﻦ ﻣﻘﺪﺍﺭ ‪ t‬ﺑﺎ ﺻﺮﻑ ﻧﻈﺮ ﺍﺯ ﺗﻐﻴﻴﺮﺍﺗﻲ ﺑﻪ ﺻـﻮﺭﺕ ‪f (t ) = at + b‬‬

‫ﻣﻨﺤﺼﺮ ﺑﻪ ﻓﺮﺩ ﺧﻮﺍﻫﺪ ﺑﻮﺩ‪.‬‬

‫ﺏ‪ .‬ﺍﺯ ) ‪ S = (a 0 , a1 ,K , a n −1‬ﺷﺮﻭﻉ ﻣﻲ ﮐﻨﻴﻢ ﻭ ﻓﺮﺽ ﻣﻲ ﮐﻨﻴﻢ ‪ a i‬ﻫﺎ ﺍﻋﺪﺍﺩ ﺻﺤﻴﺢ ﻏﻴﺮﻣﻨﻔﻲ‬

‫ﻫﺴﺘﻨﺪ‪ .‬ﺑﺮﺍﻱ ‪ n = 2‬ﭘﺲ ﺍﺯ ‪ 1‬ﻣﺮﺣﻠﻪ ﺑﻪ )‪ (0,0‬ﻣﻲ ﺭﺳﻴﻢ‪ .‬ﺑﺮﺍﻱ ‪ n = 3‬ﺩﺍﺭﻳﻢ‪:‬‬

‫‪001 → 101 → 110 → 011‬‬

‫ﻫﻤﭽﻨﻴﻦ ﺑﺮﺍﻱ ‪ n = 5‬ﺩﺍﺭﻳﻢ‪:‬‬

‫‪00011 → 00101 → 01111 → 10001 → 10010‬‬

‫‪→ 10111 → 11000 → 01001 → 11011‬‬

‫‪→ 01100 → 10100 → 11101 → 00110 → 01010‬‬

‫‪→ 11110 → 00011‬‬

‫ﮐﻪ ﻳﮏ ﺣﻠﻘﻪ ﺑﻪ ﻃﻮﻝ ‪ 15‬ﻣﻲ ﺑﺎﺷﺪ‪.‬‬

 ‫‪ .1‬ﻃﻮﻝ ﺣﻠﻘﻪ ﻫﺎ ﺭﺍ ﺑﺮﺍﻱ ‪) n = 6‬ﻳﺎ ‪ ( n = 8‬ﺑﺎ ﺩﻧﺒﺎﻟﻪ‪ 000001000011 ‬ﺑﻴﺎﺑﻴﺪ‪.‬‬

‫‪ .2‬ﻧﺸﺎﻥ ﺩﻫﻴﺪ ﺑﺮﺍﻱ ‪ n = 8‬ﺍﻟﮕﻮﺭﻳﺘﻢ ﺑﺎ ﻭﺭﻭﺩﻱ ‪ 00000011‬ﻣﺘﻮﻗﻒ ﻣﻲ ﺷﻮﺩ‪.‬‬

‫‪r‬‬ ‫‪r‬‬
‫‪ .3‬ﻧﺸﺎﻥ ﺩﻫﻴﺪ ﺑﺮﺍﻱ ‪ n = 2‬ﻫﻤﻴﺸﻪ ﺑﻪ ﺩﻧﺒﺎﻟﻪ‪ (0,0,0,K,0) ‬ﻣﻲ ﺭﺳـﻴﻢ ﻭ ﺑـﺮﺍﻱ ‪n ≠ 2‬‬

‫ﻫﻤﻴﺸﻪ ﺑﻪ ﺩﻧﺒﺎﻟﻪ ﺍﻱ ﺍﺯ ﺣﻠﻘﻪ ﻫﺎ ﺗﮑﺮﺍﺭ ﺷﻮﻧﺪﻩ ﻣﻲ ﺭﺳﻴﻢ ﮐﻪ ﺷﺎﻣﻞ ﺗﻨﻬﺎ ‪ 2‬ﻋﺪﺩ ﻣﻲ ﺑﺎﺷـﻨﺪ‬

‫ﮐﻪ ﻳﮑﻲ ‪ 0‬ﻭ ﺩﻳﮕﺮﻱ ﻏﻴﺮﺻﻔﺮ ﺍﺳﺖ ﺑﺮﺍﻱ ﺍﺛﺒﺎﺕ ﺍﻳﻦ ﻗﻀﻴﻪ ﻣﻲ ﺗـﻮﺍﻥ ﺍﺯ ﺍﺛﺒـﺎﺕ ﻣـﺸﺎﻫﺪﻩ‪2 ‬‬

‫ﺍﺳﺘﻔﺎﺩﻩ ﮐﺮﺩ‪.‬‬

‫‪r‬‬
‫‪ .4‬ﻓﺮﺽ ﮐﻨﻴﻢ ) ‪ c(n‬ﺣﺪﺍﮐﺜﺮ ﻃﻮﻝ ﺣﻠﻘﻪ‪ ‬ﺗﮑﺮﺍﺭ ﺷـﻮﻧﺪﻩ ﺑـﺮﺍﻱ ‪ n ≠ 2‬ﺑﺎﺷـﺪ ﺛﺎﺑـﺖ ﮐﻨﻴـﺪ‬

‫) ‪. c (2 n ) = 2 c ( n‬‬

‫‪ .5‬ﺛﺎﺑﺖ ﮐﻨﻴﺪ ﮐﻪ ﺑﺮﺍﻱ ‪ n‬ﻫﺎﻱ ﻓﺮﺩ ﺩﻧﺒﺎﻟﻪ‪ (0,0,K,0,1,1) ‬ﺍﺯ ﻫﻤﺎﻥ ﺍﺑﺘـﺪﺍ ﺭﻭﻱ ﺣﻠﻘـﻪ‪ ‬ﺗﮑـﺮﺍﺭ‬

‫ﺷﻮﻧﺪﻩ ﺍﺳﺖ‪.‬‬

‫‪ .6‬ﺟﺒـــــﺮﻱ ﮐـــــﺮﺩﻥ‪ .‬ﺑـــــﻪ ﺩﻧﺒﺎﻟـــــﻪ‪ (a 0 , a1 ,K , a n −1 ) ‬ﭼﻨﺪﺟﻤﻠـــــﻪ ﺍﻱ‬

‫‪n‬‬ ‫‪n−1‬‬
‫‪ ρ ( x) = a n−1 + a n−2 x + L + a 0 x‬ﺭﺍ ﺍﺧﺘﺼﺎﺹ ﻣﻲ ﺩﻫـﻴﻢ ﮐـﻪ ﺩﺭ ﺁﻥ ‪x) x = 1‬‬

‫ﻳﮑﻲ ﺍﺯ ﺭﻳﺸﻪ ﻫﺎﻱ ‪n‬ﺍﻡ ﻋﺪﺩ ‪ 1‬ﺍﺳﺖ ﺩﺭ ﺑﺤﺚ ﺍﻋﺪﺍﺩ ﻣﺨﺘﻠﻂ ﺛﺎﺑﺖ ﻣﻲ ﺷـﻮﺩ ﻋـﺪﺩ ‪ n ،1‬ﺗـﺎ‬

‫ﺭﻳﺸﻪ‪ n ‬ﺍﻡ ﻣﺘﻤﺎﻳﺰ ﺩﺍﺭﺩ( ﺩﺭ ﺍﻳﻦ ﺻﻮﺭﺕ ﭼﻨﺪﺟﻤﻠـﻪ ﺍﻱ )‪ (1 + x) ρ ( x‬ﺑـﻪ ﺩﻧﺒﺎﻟـﻪ‪T (S ) ‬‬

‫ﺗﻌﻠﻖ ﺩﺍﺭﺩ‪ .‬ﺁﻳﺎ ﻣﻲ ﺗﻮﺍﻧﻴﺪ ﺍﺯ ﺍﻳﻦ ﺟﺒﺮﻱ ﮐﺮﺩﻥ ﺍﺳﺘﻔﺎﺩﻩ ﻧﻤﺎﻳﻴﺪ‪.‬‬

‫‪ .7‬ﺟﺪﻭﻝ ﺯﻳﺮ ﺗﻮﺳﻂ ﮐﺎﻣﭙﻴﻮﺗﺮ ﺗﻮﻟﻴﺪ ﺷﺪﻩ ﺍﺳﺖ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺟﺪﻭﻝ ﺯﻳﺮ ﺣﺪﺱ ﻫـﺎﻳﻲ ﺑـﺮﺍﻱ‬

‫) ‪ c(n‬ﺑﺰﻧﻴﺪ ﻭ ﺁﻧﻬﺎ ﺭﺍ ﺍﺛﺒﺎﺕ ﮐﻨﻴﺪ‪.‬‬

‫‪n‬‬ ‫‪3 15 7‬‬ ‫‪9‬‬ ‫‪11‬‬ ‫‪13‬‬ ‫‪15‬‬ ‫‪17‬‬ ‫‪19‬‬ ‫‪21‬‬ ‫‪23‬‬ ‫‪25‬‬
‫‪cn‬‬ ‫‪3 15 7 63 341 819 15 255 9709 63 2047 25575‬‬
n 27 29 31 33 35 37 39 41 43
cn 13797 47405 31 1023 4095 3233097 4095 41943 5461