<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>recursive-formula on Dimitris Kokoretsis</title>
    
    
    
    <link>https://dimitris.netlify.app/tags/recursive-formula/</link>
    <description>Recent content in recursive-formula on Dimitris Kokoretsis</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Wed, 13 May 2026 00:00:00 +0000</lastBuildDate>
    
	<atom:link href="https://dimitris.netlify.app/tags/recursive-formula/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>The birthday problem — Part 3: Calculating in steps</title>
      <link>https://dimitris.netlify.app/posts/birthday-problem-3/</link>
      <pubDate>Wed, 13 May 2026 00:00:00 +0000</pubDate>
      
      <guid>https://dimitris.netlify.app/posts/birthday-problem-3/</guid>
      <description>
        
          &lt;img src=&#34;https://dimitris.netlify.app/posts/birthday-problem-3/cover.png&#34;/&gt;
          
        
        
        
          “Good, fast, cheap. Choose two.” — expression of a universal sentiment: quality and precision are expensive and take time.
This is the third and final part of the series on the birthday problem:
What’s the probability that two students in a classroom share a common birthday?
After mostly failing in part 1, we reached approximate answers in part 2. In this part, we will
find the true pattern of the probability, translate it into code for precise calculations, and look back on the series through the prism of project management.
          
        
        </description>
    </item>
    
  </channel>
</rss>