<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>birthday-problem on Dimitris Kokoretsis</title>
    
    
    
    <link>https://dimitris.netlify.app/tags/birthday-problem/</link>
    <description>Recent content in birthday-problem 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/birthday-problem/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>
    
    <item>
      <title>The birthday problem — Part 2: The statistical shortcut</title>
      <link>https://dimitris.netlify.app/posts/birthday-problem-2/</link>
      <pubDate>Mon, 13 Jan 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dimitris.netlify.app/posts/birthday-problem-2/</guid>
      <description>
        
          &lt;img src=&#34;https://dimitris.netlify.app/posts/birthday-problem-2/thumbnail.gif&#34;/&gt;
          
        
        
        
          In this post, we will answer a question that we previously failed at:
What is the probability that two students in a classroom share the same birthday?
This is described as a paradox because for a classroom of realistic size, the probability is surprisingly higher than intuitively expected.
Previously, we could only solve this for very small classrooms of 2 or 3 students. The reason? Too much data.
We will now get around this obstacle by the means of random sampling.
          
        
        </description>
    </item>
    
    <item>
      <title>The birthday problem — Part 1: When counting fails</title>
      <link>https://dimitris.netlify.app/posts/birthday-problem-1/</link>
      <pubDate>Wed, 30 Nov 2022 00:00:00 +0000</pubDate>
      
      <guid>https://dimitris.netlify.app/posts/birthday-problem-1/</guid>
      <description>
        
          &lt;img src=&#34;https://dimitris.netlify.app/posts/birthday-problem-1/images/intro_animation.gif&#34;/&gt;
          
        
        
        
          After the &amp;ldquo;toy problem&amp;rdquo; of the previous post, I decided to take a chance at a more tangible, real-world question. Consider this one:
What is the probability that two students in a classroom share the same birthday?
Intuitively (and correctly), you might think it depends on the total number of students. But for a realistic classroom of around 20 students, the probability should be quite low - whatever &amp;ldquo;low&amp;rdquo; means. After all, how many times have you witnessed that?
          
        
        </description>
    </item>
    
  </channel>
</rss>