# Minimal distance to Pi

Given two integers and (), find and print a common fraction such that and is minimal. If there are several fractions having minimal distance to , choose the one with the smallest denominator.

Read more

Given two integers and (), find and print a common fraction such that and is minimal. If there are several fractions having minimal distance to , choose the one with the smallest denominator.

Read more

In this exposition, we rewrite the classical proof of the Nash-Williams’ partition theorem so that it resembles that of the infinite Ramsey theorem.

Read more

Hausdorff moment problem asks for the necessary and sufficient conditions for a sequence with to be the sequence of the moments of a random variable supported on .

Read more

We give an upper bound on the Stirling number of the second kind by the probabilistic method.

Read more

We demonstrate a probabilistic proof of the isoperimetric inequality.

Read more

This note is based on my talk An Expedition to the World of -adic Numbers at Carnegie Mellon University on January 15, 2014.

Read more

A classical mathematical analysis problem, also known as the Basel problem, first posed by Pietro Mengoli in 1644 and solved by Leonhard Euler in 1735, asks the precise sum in closed form of the infinite series .

Read more

This note is based on my talk Introduction to Diophantine Approximation at Carnegie Mellon University on November 4, 2014.

Read more

In the previous post, I asserted without proof that the Hex Game will never result a draw. In *An Invitation to Discrete Mathematics*, Jiri Matousek gave an elegant proof for the assertion, which requires only a little bit of elementary graph theory.

Read more

A room contains a normal 8 by 8 chessboard together with 64 identical coins, each with one “heads” side and one “tails” side. Two prisoners are at the mercy of a typically eccentric jailer who has decided to play a game with them for their freedom.

Read more