<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Exponential on Zio Ivan</title>
    <link>https://ivandemarino.me/tags/exponential/</link>
    <description>Recent content in Exponential on Zio Ivan</description>
    <generator>Hugo</generator>
    <language>en</language>
    <managingEditor>detronizator&#43;blog@gmail.com (Ivan De Marino, aka &#34;Zio Ivan&#34;, aka &#34;detro&#34;)</managingEditor>
    <webMaster>detronizator&#43;blog@gmail.com (Ivan De Marino, aka &#34;Zio Ivan&#34;, aka &#34;detro&#34;)</webMaster>
    <copyright>2004-2026 Ivan De Marino. Licensed under CC BY 4.0</copyright>
    <lastBuildDate>Tue, 05 Jan 2010 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://ivandemarino.me/tags/exponential/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Fibonacci&#39;s numbers calculator</title>
      <link>https://ivandemarino.me/posts/fibonacci-s-numbers-calculator/</link>
      <pubDate>Tue, 05 Jan 2010 00:00:00 +0000</pubDate><author>detronizator&#43;blog@gmail.com (Ivan De Marino, aka &#34;Zio Ivan&#34;, aka &#34;detro&#34;)</author>
      <guid>https://ivandemarino.me/posts/fibonacci-s-numbers-calculator/</guid>
      <description>&lt;p&gt;Another simple-but-yet-interesting problem that I found challenging solving is the to &lt;em&gt;Write a Fibonacci&amp;rsquo;s numbers calculator&lt;/em&gt;. It&amp;rsquo;s a REALLY SIMPLE problem, but still can demonstrate how superficial thinking in programming can lead to dramatically bad solutions.&lt;/p&gt;
&lt;h2 id=&#34;whats-a-fibonaccis-number&#34;&gt;What&amp;rsquo;s a Fibonacci&amp;rsquo;s number&lt;/h2&gt;
&lt;p&gt;A &lt;a href=&#34;http://en.wikipedia.org/wiki/Fibonacci_number&#34;&gt;Fibonacci&amp;rsquo;s number&lt;/a&gt; is an integer number generated using the following function:&lt;/p&gt;
&lt;blockquote&gt;
&lt;blockquote&gt;
&lt;p&gt;Assumed that:
&lt;code&gt;f(0) = 0&lt;/code&gt;
&lt;code&gt;f(1) = 1&lt;/code&gt;
for a generic &amp;ldquo;n&amp;rdquo; Integer:
&lt;code&gt;f(n) = f(n-1) + f(n-2)&lt;/code&gt;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;/blockquote&gt;
&lt;p&gt;For example, the first 20 Fibonacci&amp;rsquo;s number are:
&lt;code&gt;0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765&lt;/code&gt;&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
