Given t\in\mathbb{R}, we would like to find solutions, probably rather approximate solutions, to the diophantine equation pt-q=0 (so the unknown p,q are constrained to live in \mathbb{Z} ; we may also require them to be coprime, and the denominator shall always be positive). This equation has an exact integral solution if and only if t is rational. Finding an approximate solution amounts to finding a fraction p/q approximating t. We want to define a notion of best approximation. Of course there are rationals arbitrarily close to t, but their denominators are then unbounded; so we fix an amount we are ready to pay, or rather a bound to the denominators, say Q, and we restrict our attention to fractions p/q with q\leq Q. We will say that p/q with q\leq Q is a best approximation (of first kind) of order Q if \vert pt-q\vert < \vert at -b\vert for all a/b,b\leq Q. The second kind would be to demand \vert t-p/q\vert to be minimal; it happens that both awards aren't always awarded to the same candidate.

How well can a number be approximated ?
Given a bound Q on the denominators, how close can be fractions with denominator q\leq Q to t ? Let \Vert x\Vert \in [0,1/2] be the distance to the nearest integer, so we are looking at \Vert qt\Vert. A simple application of the pigeonhole principle ensures that there exists q\leq Q with \Vert qt \Vert\leq 1/Q, so in particular \Vert qt \Vert \leq 1/q and there exists a sequence of fractions p/q with \vert t-p/q\vert\leq 1/q^2. Note that the result is not constructive. This exponent 2 is nice, but can we do better? Can we be sure to find an unbounded sequence of q with \Vert qt\Vert \leq 1/q^2 for instance?
The answer is no: Liouville proved that if t is an irrational algebraic number of degree at most d (so that there exists a unitary rational polynomial of degree d\geq 2 such that P(t)=0, then there exists a constant C(t) such that for any p,q, \vert t-p/q\vert\geq C(t)/q^d. Thus for quadratic irrationals (irrationals which are algebraic of degree 2), the exponent 2 is really the best possible. But the discussion concerning the optimal constant C is still open.
So if you define \delta(t) =\sup \{m\mid\exists\text{ a sequence }p/q\text{ with }q\rightarrow \infty : \vert t-p/q\vert\leq 1/q^m\} then \delta\leq d for algebraic irrationals of degree d.

This theorem seems paradoxical because it states that the irrationals which seem to be the least irrational, the algebraic ones of low degree, are actually the most difficult to approximate. The paradox vanishes (or at least fades) when one remarks that the rationals are actually the most difficult to approximate: indeed, if t=a/b is in lowest terms, and if p/q\neq t is a rational in lowest terms with q\leq Q, then \vert p/q-t\vert\geq \frac{1}{bq}\geq\frac{1}{bQ} so we get an exponent 1. Notice the trick that a non-zero integer is at least 1, which is also together with the intermediate value theorem, the trick to prove Liouville’s theorem. Liouville’s theorem is also the easiest gateway to exhibiting transcendental numbers; indeed Liouville found numbers with arbitrarily high \delta.

In fact, as far as the exponent is concerned, algebraic irrationals of high degree are not any easier to approximate than quadratic irrationals, as has been revealed by the theorem of Thue-Siegel-Roth, saying that for an algebraic irrational t and any \epsilon>0, there exists a constant C(t,\epsilon) such that for all integers p,q, \vert t-p/q\vert\leq \frac{C(t,\epsilon)}{q^{2+\epsilon}}.

The best exponent is 2 in general, but what about the constant ?
We can always find a sequence p/q with \vert t-p/q\vert\leq 1/q^2, and for quadratic irrationals, \vert t-p/q\vert\geq C/q^2 so between C and 1, what is the optimal constant? The truth, as Hurwitz’s theorem says, is that \vert t-p/q\vert < \frac{1}{\sqrt{5}q^2} for infinitely many p,q. And for the golden ratio and its conjugates, \frac{1}{\sqrt{5}} is optimal; for all other numbers, one can do better, certainly arbitrarily better (arbitrarily big constants) for algebraic irrationals of degree more than 2, and merely a better constant for other quadratic irrationals. We’ll come back to this later.

How to construct good approximations (exponent 2)?
The existence of a sequence p/q with \vert t-p/q\vert\leq 1/q^2 is always granted but how to construct one? If you naively look at the decimal expansion of your number, you only get an approximation of quality 1/q.
So the correct way to proceed is to use continuous fraction expansion. So take t\in [0,1], and look at the map T(x)=\{\frac{1}{x}\}. Put a_1=\lfloor \frac{1}{x}\rfloor and a_k=\lfloor \frac{1}{T^k(x)}\rfloor. Then
x=\frac{1}{a_1+\frac{1}{a_2+\cdots}}=:[a_1,a_2,\cdots...]. If you write A_k/B_k=[a_1,\cdots,a_k] the kth convergent, then you can prove that \vert B_kt-A_k\vert<1/B_{k+1}<1/B_k, which is the quadratic approximation we desired.

Best approximation
Not only do continuous fractions yield a natural way towards quadratic approximation, they also provide the « best approximations » in the following sense. We fix a number t (let’s say for convenience that it’s irrational); we say a fraction a/b is a best approximation if every other fraction p/q\neq a/b with 0<q\leq b satisfies \vert bt-a\vert< \vert pt-q\vert.

Then every best approximation is a convergent A_k/B_k=[a_0;a_1,\cdots,a_k] and any convergent is a best approximation

Which numbers are the toughest to approximate ?
We have seen that for every number t, there exists a convergent sequence p/q with \vert t-p/q\vert\leq \frac{1}{\sqrt{5}q^2}. The only numbers for which \sqrt{5} is optimal are the golden ratio g and his conjugate, solution of the quadratic equation x^2-x-1=0. We know that g\in (1,2) and g=1+1/g, so a_0=\lfloor g\rfloor=1 and by injecting the description of g in the right-hand side, we get g=1+\frac{1}{1+1/g}=1+\frac{1}{1+\frac{1}{1+1/g}}=\cdots so the convergents are plainly [1,\cdots,1]. In particular it is periodic.
We could try to characterize the numbers for which the a_k (called the partial quotients) are periodic. The same question is easy to answer for the other pleasant type of rational approximations, the decimal approximations: for which numbers is the sequence of digits eventually periodic, i.e. t=a_0,a_1a_2\cdots a_k\overline{a_{k+1}\cdots a_m} where the bar means that the sequence is repeated ad vitam? The answer is very easy: it is the rationals. So for which numbers do we have t=[a_0;a_1,a_2,\cdots a_k,\overline{a_{k+1},\cdots ,a_m}]? Lagrange proved that these were exactly the quadratic irrationals.

Now from Liouville’s theorem, and Thue-Siegel-Roth, we suspect that the toughest numbers to approximate are the quadratic irrationals, so the numbers which have periodic partial quotients. The answer is slightly more general: it is the numbers which have bounded partial quotients. Indeed, we can formulate the following alternative:
For any irrational number t and integer n, either there are infinitely many positive b such that b\Vert bt\Vert<\frac{1}{\sqrt{n^2+4}} or a_k<n for all sufficiently large indices k. This is a generalization of Hurwitz' theorem.

Other neighbouring questions
What we have just seen is a characterization of the real numbers t such that \inf n\Vert nt\Vert>0: they are the real numbers with bounded partial quotients a_k. Borel has shown that this set has Lebesgue measure 0. But of course they do exist, the golden ratio for instance. Now what if you take a second real number s and ask for \liminf n\Vert nt\Vert\Vert ns\Vert: will you always find 0? Littlewood’s conjecture is that it is the case.