<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Set-Theory on nyadgar.com</title>
		<link>https://nyadgar.com/tags/set-theory/</link>
		<description>Recent content in Set-Theory on nyadgar.com</description>
		<generator>Hugo</generator>
		<language>en-us</language>
		
		
		
		
			<lastBuildDate>Mon, 28 Apr 2025 00:00:00 +0000</lastBuildDate>
		
			<atom:link href="https://nyadgar.com/tags/set-theory/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Happy Birthday Paradox</title>
				<link>https://nyadgar.com/posts/happy-birthday-paradox/</link>
				<pubDate>Mon, 28 Apr 2025 00:00:00 +0000</pubDate>
				<guid>https://nyadgar.com/posts/happy-birthday-paradox/</guid>
				<description>&lt;p&gt;The Birthday &lt;em&gt;paradox&lt;/em&gt; only seems like a paradox because it unexpectedly challenges our perception&#xA;of probability. It states that in a group of only 23 individuals, there&#xA;is more than a 50% chance that at least two are sharing a birthday. Although it may seem&#xA;counterintuitive, we have the math that proves and supports this statement.&lt;/p&gt;&#xA;&lt;p&gt;&#xA;&lt;img src=&#34;cats.png&#34; style=&#34;width: 40%;&#34; alt=&#34;cats&#34;&gt;&#xA;&lt;/p&gt;&#xA;&lt;p&gt;In this article, we will gradually reprogram our intuition and build the knowledge required to&#xA;derive the expression that proves the &lt;em&gt;paradox&lt;/em&gt;. This blog focuses on software engineering and&#xA;system design so we will follow a real-world example of this problem found in software.&#xA;But first, let&amp;rsquo;s start with basic counting.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
