{"id":91,"date":"2023-11-06T01:12:21","date_gmt":"2023-11-05T22:12:21","guid":{"rendered":"http:\/\/www.cuneytbayrak.com\/?p=91"},"modified":"2025-02-21T00:47:35","modified_gmt":"2025-02-20T21:47:35","slug":"m-elemanina-kadar-nth-seviye-bonacci-sayilarini-bulan-algoritma","status":"publish","type":"post","link":"http:\/\/www.cuneytbayrak.com\/?p=91","title":{"rendered":"M.eleman\u0131na kadar , Nth seviye bonacci say\u0131lar\u0131n\u0131 bulan Algoritma"},"content":{"rendered":"<div>\n<p>Size N ve M olmak \u00fczere iki tam say\u0131 verilir ve N-bonacci Say\u0131lar\u0131n\u0131n M terimine kadar olan serinin t\u00fcm terimlerini yazd\u0131r\u0131rs\u0131n\u0131z.<\/p>\n<\/div>\n<div>\n<p>\u00d6rne\u011fin, N = 2 oldu\u011funda dizi Fibonacci olur, N = 3 oldu\u011funda dizi Tribonacci olur.<\/p>\n<\/div>\n<div>\n<p>Genel olarak, N-bonacci dizisinde, bir sonraki terimden \u00f6nceki N say\u0131lar\u0131n\u0131n toplam\u0131n\u0131 kullan\u0131r\u0131z.<\/p>\n<\/div>\n<div>\n<p>Fibonacci dizisi, bir veya s\u0131f\u0131r ile ba\u015flayan, ard\u0131ndan bir gelen ve her say\u0131n\u0131n kendinden \u00f6nceki iki say\u0131n\u0131n toplam\u0131na e\u015fit olmas\u0131 kural\u0131na g\u00f6re ilerleyen bir say\u0131 k\u00fcmesidir 0, 1, 1, 2, 3, 5, 8\u2026..<\/p>\n<\/div>\n<div>\n<p>\u00d6rne\u011fin, 3-bonacci dizisi a\u015fa\u011f\u0131daki gibidir:<\/p>\n<\/div>\n<div>0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81<\/div>\n<div><\/div>\n<div><u><b>\u00d6rnekler :<\/b><\/u><\/div>\n<div>\n<p>Giri\u015f : N = 3, M = 8 \u00c7\u0131k\u0131\u015f : 0, 0, 1, 1, 2, 4, 7, 13<br \/>\n\u0130lk M terimi yazd\u0131rmam\u0131z gerekiyor. \u0130lk \u00fc\u00e7 terim 0, 0 ve 1. D\u00f6rd\u00fcnc\u00fc terim 0 + 0 + 1 = 1 Be\u015finci terim 0 + 1 + 1 = 2 Alt\u0131nc\u0131 terim 1 + 1 + 2 = 4 Yedinci terim 7 (1 + 2 + 4) ve sekizinci terim 13 (7 + 4 + 2).<\/p>\n<\/div>\n<div>\n<p>Giri\u015f : N = 4, M = 10 \u00c7\u0131k\u0131\u015f : 0 0 0 1 1 2 4 8 15 29<\/p>\n<\/div>\n<div>\n<p><a href=\"http:\/\/www.flowgorithm.org\/download\/index.html\" target=\"_blank\" rel=\"noopener\">Flowgorithm<\/a>\u00a0program\u0131 ile bir flowchart olu\u015fturdum. A\u015fa\u011f\u0131da inceleyebilirsiniz.<\/p>\n<\/div>\n<div>Algoritman\u0131n tamam\u0131n\u0131 da\u00a0<a href=\"http:\/\/cuneytbayrak.com\/wp-content\/uploads\/2025\/02\/MbonacciMlayer.rar\">buradan<\/a>\u00a0indirebilirsiniz.<\/div>\n<div><\/div>\n<div><u><b>\u00a0Algoritma \u00e7\u0131kt\u0131s\u0131:<br \/>\n<\/b><\/u><\/div>\n<p>L\u00fctfen M.eleman\u0131na kadar , Nth seviye bonacci say\u0131lar\u0131n\u0131 bulmam i\u00e7in s\u0131ras\u0131 ile N ve M say\u0131lar\u0131n\u0131 giriniz giriniz.<\/p>\n<p>4<\/p>\n<p>20<\/p>\n<p>0 0 0 1 1 2 4 8 15 29 56 108 208 401 773 1490 2872 5536 10671 20569<\/p>\n<div>G\u00f6r\u00fcld\u00fc\u011f\u00fc gibi 4. seviye bonacci say\u0131lar\u0131n\u0131n ilk 20 sini yazd\u0131rm\u0131\u015f olduk. Dizide ki herhangi bir say\u0131 kendinden \u00f6nceki 4 say\u0131n\u0131n toplam\u0131 \u015feklindedir.<br \/>\n\u00d6rne\u011fin; 5536=2872+1490+773+401<\/div>\n<div><\/div>\n<div><\/div>\n<div>Kolay gele&#8230;<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Size N ve M olmak \u00fczere iki tam say\u0131 verilir ve N-bonacci Say\u0131lar\u0131n\u0131n M terimine kadar olan serinin t\u00fcm terimlerini yazd\u0131r\u0131rs\u0131n\u0131z. \u00d6rne\u011fin, N = 2 oldu\u011funda dizi Fibonacci olur, N&#8230;<\/p>\n<div class=\"more-link-wrapper\"><a class=\"more-link\" href=\"http:\/\/www.cuneytbayrak.com\/?p=91\">Devam\u0131n\u0131 Oku<span class=\"screen-reader-text\">M.eleman\u0131na kadar , Nth seviye bonacci say\u0131lar\u0131n\u0131 bulan Algoritma<\/span><\/a><\/div>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"iawp_total_views":0,"footnotes":""},"categories":[2],"tags":[28],"class_list":["post-91","post","type-post","status-publish","format-standard","hentry","category-algoritmalar","tag-nbonaccimlayerfind","excerpt"],"_links":{"self":[{"href":"http:\/\/www.cuneytbayrak.com\/index.php?rest_route=\/wp\/v2\/posts\/91","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.cuneytbayrak.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.cuneytbayrak.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.cuneytbayrak.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.cuneytbayrak.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=91"}],"version-history":[{"count":1,"href":"http:\/\/www.cuneytbayrak.com\/index.php?rest_route=\/wp\/v2\/posts\/91\/revisions"}],"predecessor-version":[{"id":92,"href":"http:\/\/www.cuneytbayrak.com\/index.php?rest_route=\/wp\/v2\/posts\/91\/revisions\/92"}],"wp:attachment":[{"href":"http:\/\/www.cuneytbayrak.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=91"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.cuneytbayrak.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=91"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.cuneytbayrak.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=91"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}