Inaba Coin Problem
You have 10 points distributed on the plane, can you cover them using unit disks without any overlap.
You have 10 points distributed on the plane, can you cover them using unit disks without any overlap.
In this blog, I will explain the theorem, do some interesting applications and shed light on the proof without going into technicalities.

This blog post derives the famous word2vec algorithm using skip gram method.
An interesting puzzle.
A routine problem from IMO 2024.
This is amongst the simplest problems to say, easiest to approach and yet somehow unsolvable at times.
One of my favourite puzzle. So simple to speak, never lacked avenues of attack, though rested all but one!
In this introductory post we discuss the mathematical model of an MDP and some elementary ways to solve it in both offline and online setting.
Let us say we toss a coin N times. Which occurs more frequently the Tail - Tail (TT) or Head - Tail (HT)? In the sequence TTT, we count 2 TT's.
A kinematic problem that requires one to understand difference between radial and perpendicular velocity, and a bit of differential equations.